find the shortest path

3 次查看（过去 30 天）
Elysi Cochin
Elysi Cochin 2019-4-10
评论： Walter Roberson 2019-4-13
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

请先登录，再回答此问题。

采纳的回答

Matt J
Matt J 2019-4-10
There are a number of implementations of Dijkstra's algorithm on the File Exchange,
https://www.mathworks.com/matlabcentral/fileexchange?q=Dijkstra+shortest+path

更多回答（2 个）

Kelly Kearney
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.
Image Analyst
Image Analyst 2019-4-11
See Steve Eddins's blog series on this: MathWorks Image Processing Blog
  4 个评论
显示 2更早的评论
Umar Awan
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
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!

Translated by