How do i find the eulers path with an adjacency matrix
9 次查看(过去 30 天)
显示 更早的评论
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 个评论
采纳的回答
Walter Roberson
2014-1-13
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 个评论
Walter Roberson
2014-1-13
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.
更多回答(0 个)
另请参阅
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!