Shortest path constrained to use specific nodes
3 ビュー (過去 30 日間)
古いコメントを表示
Let's say I have a simple graph:
G = graph([1,2,3,4,5],[2,3,4,5,1]);
I want to find the shortest path from 1 to 3. The shortestpath function would give me 1-2-3. But in my case, I have a list of nodes that I can travel on:
nodes = [1,3,4,5];
How can I find the shortest path between any two nodes in the graph that only takes the nodes in that list (which will be 1-5-4-3 in this case)?
0 件のコメント
回答 (3 件)
Sulaymon Eshkabilov
2021 年 4 月 3 日
Here is an easy solution:
shortestpath(G, 1,3) % Shortest path between 1 and 3
Good luck.
参考
カテゴリ
Help Center および File Exchange で Graph and Network Algorithms についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!