| Display title | Distance (graph theory) |
| Default sort key | Distance (graph theory) |
| Page length (in bytes) | 6,819 |
| Namespace ID | 0 |
| Page ID | 1020021 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 82 |
| Number of page watchers who visited in the last 30 days | 8 |
| Number of redirects to this page | 6 |
| Counted as a content page | Yes |
| Wikidata item ID | Q2742711 |
| Local description | Length of shortest path between two nodes of a graph |
| Central description | in graph theory, the minimum number of edges in a path connecting two vertices |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | MathMartin (talk | contribs) |
| Date of page creation | 19:56, 26 September 2004 |
| Latest editor | David Eppstein (talk | contribs) |
| Date of latest edit | 02:34, 30 December 2024 |
| Total number of edits | 139 |
| Recent number of edits (within past 30 days) | 1 |
| Recent number of distinct authors | 1 |
| Hidden categories (2) | This page is a member of 2 hidden categories (help):
|
| Transcluded templates (41) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
