A geodesic is the shortest path between two nodes on a graph or the fewest number of links we need to traverse in order to get from any given node to another.
A geodesic is the shortest path between two nodes on a graph or the fewest number of links we need to traverse in order to get from any given node to another.