MATLAB Answers

find the shortest path

52 ビュー (過去 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

  0 件のコメント

Sign in to comment.

採用された回答

Matt J
Matt J 2019 年 4 月 10 日
There are a number of implementations of Dijkstra's algorithm on the File Exchange,

  0 件のコメント

Sign in to comment.

その他の回答 (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.

  0 件のコメント

Sign in to comment.


Image Analyst
Image Analyst 2019 年 4 月 11 日
See Steve Eddins's blog series on this: MathWorks Image Processing Blog

  4 件のコメント

表示 1 件の古いコメント
Walter Roberson
Walter Roberson 2019 年 4 月 12 日
Segmentation does not have to do with shortest path, so this should be in a different Question.
Umar Awan
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.

Sign in to comment.

タグ


Translated by