MATLAB Answers

0

find the shortest path

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

  0 件のコメント

サインイン to comment.

タグ

3 件の回答

Matt J
回答者: Matt J
2019 年 4 月 10 日
 採用された回答

There are a number of implementations of Dijkstra's algorithm on the File Exchange,

  0 件のコメント

サインイン to comment.


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.

  0 件のコメント

サインイン to comment.


Image Analyst
回答者: Image Analyst
2019 年 4 月 11 日

See Steve Eddins's blog series on this: MathWorks Image Processing Blog

  4 件のコメント

Walter Roberson
2019 年 4 月 12 日
Segmentation does not have to do with shortest path, so this should be in a different Question.
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.

サインイン to comment.



Translated by