MATLAB Answers

find the shortest path

13 views (last 30 days)
Elysi Cochin
Elysi Cochin on 10 Apr 2019
Commented: 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

Accepted Answer

Matt J
Matt J on 10 Apr 2019
There are a number of implementations of Dijkstra's algorithm on the File Exchange,

More Answers (2)

Kelly Kearney
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.

Image Analyst
Image Analyst on 11 Apr 2019
See Steve Eddins's blog series on this: MathWorks Image Processing Blog
  4 Comments
Walter Roberson
Walter Roberson on 13 Apr 2019
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.

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!