find the shortest path
조회 수: 2 (최근 30일)
이전 댓글 표시
i have 2 set of coordinates S1-S25 (set 1) and D1-D10 (set2)
i have connection between coordinates
my start points are from set1 and destination points from set2
if i select start and destination points, and i can go only through the path that has connection
how to reach destination using the given path, also i need to use shortest path
eg: i need to go from S7 to D8, using the specified path
댓글 수: 0
채택된 답변
Matt J
2019년 4월 10일
There are a number of implementations of Dijkstra's algorithm on the File Exchange,
댓글 수: 0
추가 답변 (2개)
Kelly Kearney
2019년 4월 10일
Take a look at graph and digraph objects; the shortestpath function provides several different algorithms to calculate this for a given graph.
댓글 수: 0
Image Analyst
2019년 4월 11일
See Steve Eddins's blog series on this: MathWorks Image Processing Blog
댓글 수: 4
Umar Awan
2019년 4월 13일
편집: Umar Awan
2019년 4월 13일
@Image Analyst
Thank You so much, for you help. I have one more question. sir when i extract all words they extrated randomly, i want to extract them in sequence like in image first "Name" then "Muhammad" then "Mughees" then "Raza" and so on.. can you please tell how i do this?
Walter Roberson
2019년 4월 13일
Umar Awan:
This Question is about finding shortest path. Asking about optical character recognition is off topic for this Question. You need to start your own Question.
참고 항목
카테고리
Help Center 및 File Exchange에서 Dijkstra algorithm에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!