| Display title | Johnson's algorithm |
| Default sort key | Johnson's algorithm |
| Page length (in bytes) | 7,879 |
| Namespace ID | 0 |
| Page ID | 1284311 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 43 |
| Number of page watchers who visited in the last 30 days | 2 |
| Number of redirects to this page | 1 |
| Counted as a content page | Yes |
| Wikidata item ID | Q2345824 |
| Local description | Computer-based path-finding method |
| Central description | algorithm to find shortest paths between all pairs of vertices in a sparse, edge-weighted (possibly negatively), directed graph; uses the Bellman–Ford algorithm to remove negative weights and Dijkstra’s algorithm on the rest |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | 152.2.166.128 (talk) |
| Date of page creation | 06:17, 16 December 2004 |
| Latest editor | BD2412 (talk | contribs) |
| Date of latest edit | 18:17, 18 November 2024 |
| Total number of edits | 138 |
| 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 (56) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
