How can the edges on the shortestpath be determined?
1 view (last 30 days)
Show older comments
After using shortestpath (Dijkstra algorithm) on directed and weighted graph, Matlab gives the node sequence on the shortest path.
How can I write the edges on the shortest path?
Thanks
CO
0 Comments
Accepted Answer
Chunru
on 27 Jun 2022
Edited: Chunru
on 28 Jun 2022
s = [1 1 2 3 3 4 4 6 6 7 8 7 5];
t = [2 3 4 4 5 5 6 1 8 1 3 2 8];
G = digraph(s,t);
plt = plot(G)
[P, d, edgepath] = shortestpath(G,7,8)
E = G.Edges(edgepath, :)
highlight(plt, 'Edges', edgepath)
More Answers (0)
See Also
Categories
Find more on Graph and Network Algorithms in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!