| Display title | Shortest path problem |
| Default sort key | Shortest path problem |
| Page length (in bytes) | 47,034 |
| Namespace ID | 0 |
| Page ID | 41985 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 199 |
| Number of page watchers who visited in the last 30 days | 8 |
| Number of redirects to this page | 52 |
| Counted as a content page | Yes |
| Wikidata item ID | Q1058754 |
| Local description | Computational problem of graph theory |
| Central description | problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized |
| Page image |  |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | 80.128.181.114 (talk) |
| Date of page creation | 15:45, 26 February 2002 |
| Latest editor | LooksGreatInATurtleNeck (talk | contribs) |
| Date of latest edit | 14:36, 26 April 2025 |
| Total number of edits | 810 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (10) | This page is a member of 10 hidden categories (help):
|
| Transcluded templates (92) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | - shortest path problem
- Title
- Sitelink
- Some statements
- Description: en
- Miscellaneous (e.g. aliases, entity existence)
|
| Duplicate IDs | 1 |
| Background color inline style rule exists without a corresponding text color | 3 |
