MATLAB Answers

0

find the shortest path

Asked by Elysi Cochin on 10 Apr 2019
Latest activity Commented on by Walter Roberson
on 13 Apr 2019
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 Comments

Sign in to comment.

3 Answers

Answer by Matt J
on 10 Apr 2019
 Accepted Answer

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

  0 Comments

Sign in to comment.


Answer by Kelly Kearney
on 10 Apr 2019

Take a look at graph and digraph objects; the shortestpath function provides several different algorithms to calculate this for a given graph.

  0 Comments

Sign in to comment.


Answer by Image Analyst
on 11 Apr 2019

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

  4 Comments

Show 1 older comment
Segmentation does not have to do with shortest path, so this should be in a different Question.
@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?
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.