In the mathematical field of graph theory, the distance between two vertices of a graph is the number of edges in a shortest path connecting them, also known as the geodesic distance or the shortest path distance. More than one shortest path can exist between two vertices, and if no path connects them at all, because they lie in different connected components, the distance between them is conventionally taken to be infinite.
Facts
Connections
In Branch
Source Wolfram MathWorld: Distance
Is Kind Of Object
Sources
1. Distance (Graph Theory) (Wikipedia)
Wolfram MathWorld: Distance
Wolfram MathWorldIn Branch: Geometry, Subject classificationsQuote, In Branch: Geometry, Subject classifications
Geometry Distance
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.