How do i find the eulers path with an adjacency matrix
7 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
Ajay Gautham
le 13 Jan 2014
Commenté : Walter Roberson
le 13 Jan 2014
Hi all, I have a 11x11 adjacency matrix for a graph(COST239) network with different weights on each vertices. Please help me regarding this. I tried matgraph, but that doesnt give eulers path with adjacency matrix, moreover this file inturn calls a lots of .m files.
0 commentaires
Réponse acceptée
Walter Roberson
le 13 Jan 2014
The weights are irrelevant because every vertex must be visited a fixed number of times (half of the number of edges incident on it), and every edge must be visited once. There is nothing to optimize on a Eulear's path.
(Is COST239 "Ultra-High Capacity Optical Transmission Networks" ?)
2 commentaires
Walter Roberson
le 13 Jan 2014
Without weights, visiting all nodes exactly once would be a Hamiltonian Path. With weights, visiting all nodes exactly once would be a Weighted Hamiltonian Path. With weights, visiting all nodes at least once would be Traveling Salesman Problem.
There is no polynomial-time solution to Hamiltonian Path or Traveling Salesman.
Plus de réponses (0)
Voir également
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!