How can the edges on the shortestpath be determined?
2 Ansichten (letzte 30 Tage)
Ältere Kommentare anzeigen
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 Kommentare
Akzeptierte Antwort
Chunru
am 27 Jun. 2022
Bearbeitet: Chunru
am 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)
Weitere Antworten (0)
Siehe auch
Kategorien
Mehr zu Graph and Network Algorithms finden Sie in Help Center und File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!