| Display title | Bellman–Ford algorithm |
| Default sort key | Bellman-Ford algorithm |
| Page length (in bytes) | 20,881 |
| Namespace ID | 0 |
| Page ID | 221244 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 178 |
| Number of page watchers who visited in the last 30 days | 13 |
| Number of redirects to this page | 28 |
| Counted as a content page | Yes |
| Wikidata item ID | Q816022 |
| Local description | Algorithm for finding the shortest paths in graphs |
| Central description | algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative |
| 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.111.6.56 (talk) |
| Date of page creation | 12:31, 4 May 2003 |
| Latest editor | IntGrah (talk | contribs) |
| Date of latest edit | 22:56, 9 June 2024 |
| Total number of edits | 711 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (8) | This page is a member of 8 hidden categories (help):
|
| Transcluded templates (87) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
