| Display title | Parallel single-source shortest path algorithm |
| Default sort key | Parallel single-source shortest path algorithm |
| Page length (in bytes) | 15,281 |
| Namespace ID | 0 |
| Page ID | 63215363 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | Fewer than 30 watchers |
| Number of redirects to this page | 2 |
| Counted as a content page | Yes |
| Wikidata item ID | Q96398406 |
| Local description | Computational problem of graph theory |
| Central description | Computational problem of graph theory |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Igorfratel (talk | contribs) |
| Date of page creation | 11:08, 26 February 2020 |
| Latest editor | ChaosTheoryEnthusiast (talk | contribs) |
| Date of latest edit | 17:30, 4 October 2025 |
| Total number of edits | 24 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (2) | This page is a member of 2 hidden categories (help):
|
| Transcluded templates (31) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |