| Display title | Kosaraju's algorithm |
| Default sort key | Kosaraju's algorithm |
| Page length (in bytes) | 8,907 |
| Namespace ID | 0 |
| Page ID | 4072443 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 48 |
| Number of page watchers who visited in the last 30 days | 3 |
| Number of redirects to this page | 2 |
| Counted as a content page | Yes |
| Wikidata item ID | Q2655281 |
| Local description | Method of finding a directed graph's strongly connected components |
| Central description | algorithm to find the strongly connected component of a directed graph |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Playswithfire (talk | contribs) |
| Date of page creation | 20:57, 14 February 2006 |
| Latest editor | Ftiercel (talk | contribs) |
| Date of latest edit | 17:09, 22 April 2025 |
| Total number of edits | 111 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (4) | This page is a member of 4 hidden categories (help):
|
| Transcluded templates (45) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
