Dijkstra algorithm using branching point

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]

Have you deleted the previous same question?

[mohammed alany]

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