I'm reading a paper that deals with networks/graphs. In the paper they mention the term 'geodesic distance'. I'm not able to understand what does it mean. I hope if you can explain it to me.
2026-04-24 03:42:54.1777002174
Geodesic distance in graphs
1k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
The geodesic of two vertices in the graph is the shortest path between them. In an unweighted graph, this is the edge count of the shortest path.