# Geodesic Distance Between Two Graph-Nodes Measure

(Redirected from Distance Between Two Graph Nodes Measure)

A Geodesic Distance Between Two Graph-Nodes Measure is a length measure [math]f(v_x,v_y)[/math] which is a graph-based distance measure that is based on the count of graph edges along the shortest path between the two graph nodes.

**Context:**- If there is no path between the two Nodes then the distance is infinite.
- It, along with the Node Set, forms a Metric Space iff the Graph is a Connected Graph.

**See:**Length Function, Graph Node Eccentricity, Graph Radius, Graph Diameter, Shortest Path Problem.

## References

### 2020

- (Wikipedia, 2020) ⇒ https://en.wikipedia.org/wiki/Distance_(graph_theory) Retrieved:2020-6-30.
- In the mathematical field of graph theory, the
**distance**between two vertices in a graph is the number of edges in a shortest path (also called a**graph geodesic**) connecting them. This is also known as the**geodesic distance**. Notice that there may be more than one shortest path between two vertices. If there is no path connecting the two vertices, i.e., if they belong to different connected components, then conventionally the distance is defined as infinite. In the case of a directed graph the distance [math] d(u,v) [/math] between two vertices [math] u [/math] and [math] v [/math] is defined as the length of a shortest directed path from [math] u [/math] to [math] v [/math] consisting of arcs, provided at least one such path exists.^{[1]}Notice that, in contrast with the case of undirected graphs, [math] d(u,v) [/math] does not necessarily coincide with [math] d(v,u) [/math] , and it might be the case that one is defined while the other is not.

- In the mathematical field of graph theory, the

- ↑ F. Harary, Graph Theory, Addison-Wesley, 1969, p.199.