How to find distance between two nodes? including the nodes.

For example: In this graph i would like to find distance *between s1 and s3.

SO MY OUTPUT SHOULD LOOK LIKE : Distance = 7 (includes both edges and nodes)

[Paolo]

Can you share the code with which the image was generated?

[Aswin Sandirakumaran]

I just used addnode and addedge.

Answer 1

[Anton Semechko]

Download graph processing toolbox from FEX. Use Dijkstra's algorithm to get shortest path between pairs of nodes. Path length = distance between nodes = sum of edge weights along the path.

Answer 2

[Walter Roberson]

Call https://www.mathworks.com/help/matlab/ref/graph.shortestpath.html shortestpath() on the graph object to get the distances.

[navanit dubey]

https://in.mathworks.com/matlabcentral/answers/650538-how-to-find-kshortest-path-or-use-dijkstra-algorithm-for-12-plot-points?s_tid=prof_contriblnk

how to find this plz help