Dijkstra algorithm using branching point

4 views (last 30 days)

mohammed alany on 31 Jul 2019

Commented: mohammed alany on 31 Jul 2019

if i have this binary picture, how i can find the shortest path using Dijkstra algorithm, the branching point "in green" are

[86 151; 96 93; 118 119; 127 118; 144 97; 215 93; 230 107; 245 149; 256 91; 307 143], and i would like

to connect [86 151] with [256 91] as example

any help please?

KALYAN ACHARJYA on 31 Jul 2019

Edited: KALYAN ACHARJYA on 31 Jul 2019

Have you deleted the previous same question?

mohammed alany on 31 Jul 2019

yes, by mistake, any help please to solve this question?

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