| Display title | Floyd–Warshall algorithm |
| Default sort key | Floyd-Warshall algorithm |
| Page length (in bytes) | 23,497 |
| Namespace ID | 0 |
| Page ID | 230401 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 174 |
| Number of page watchers who visited in the last 30 days | 7 |
| Number of redirects to this page | 18 |
| Counted as a content page | Yes |
| Wikidata item ID | Q1047576 |
| Local description | Algorithm in graph theory |
| Central description | algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Poor Yorick (talk | contribs) |
| Date of page creation | 08:52, 20 May 2003 |
| Latest editor | 2403:5809:d10c:0:25c7:69f9:1f3e:ffb0 (talk) |
| Date of latest edit | 07:12, 23 May 2025 |
| Total number of edits | 818 |
| Recent number of edits (within past 30 days) | 2 |
| Recent number of distinct authors | 2 |
| Hidden categories (5) | This page is a member of 5 hidden categories (help):
|
| Transcluded templates (82) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
