Information for "Bellman–Ford algorithm"
Basic information
| Display title | Bellman–Ford algorithm |
| Default sort key | Bellman–Ford algorithm |
| Page length (in bytes) | 1,883 |
| Namespace ID | 0 |
| Page ID | 838907 |
| 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 | 1 |
| Counted as a content page | Yes |
| Wikidata item ID | Q816022 |
| Central description | algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative |
| Page views in the past 30 days | 15 |
Page protection
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
Edit history
| Page creator | Kdbeall (talk | changes) |
| Date of page creation | 19:42, 1 May 2021 |
| Latest editor | MathXplore (talk | changes) |
| Date of latest edit | 14:37, 27 September 2022 |
| Total number of edits | 2 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
Page properties
| Transcluded templates (2) | Templates used on this page:
|
| Wikidata entities used in this page |
|
Lint errors
| Missing end tag | 1 |