find the shortest path

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

Answer 1

[Matt J]

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

https://www.mathworks.com/matlabcentral/fileexchange?q=Dijkstra+shortest+path

Answer 2

[Kelly Kearney]

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

Answer 3

[Image Analyst]

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

[Image Analyst]

You can use impixelinfo() to find out what row and column of the image contains the Urdu text, then just set it to black

rgbImage(row1:row2, col1:col2, :) = 0;  % Erase box.

[Walter Roberson]

Segmentation does not have to do with shortest path, so this should be in a different Question.

[Umar Awan]

@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]

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.