| Display title | Reachability |
| Default sort key | Reachability |
| Page length (in bytes) | 16,122 |
| Namespace ID | 0 |
| Page ID | 2833097 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 38 |
| Number of page watchers who visited in the last 30 days | 8 |
| Number of redirects to this page | 5 |
| Counted as a content page | Yes |
| Wikidata item ID | Q1361526 |
| Local description | Whether one vertex can be reached from another in a graph |
| Central description | 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 | Eecs574group6 (talk | contribs) |
| Date of page creation | 17:33, 4 October 2005 |
| Latest editor | Thatsme314 (talk | contribs) |
| Date of latest edit | 12:28, 26 June 2023 |
| Total number of edits | 66 |
| 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 (30) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
