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. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Connections
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Distance (Graph Theory) (Wikipedia)
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.