Shortest path constrained to use specific nodes
조회 수: 2 (최근 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!