| Display title | Kosaraju |
| Default sort key | Kosaraju |
| Page length (in bytes) | 57,755 |
| Namespace ID | 0 |
| Page ID | 11581 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Page views in the past month | 0 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | rosettacode>Mikymaione |
| Date of page creation | 18:10, 5 February 2017 |
| Latest editor | Eschel (talk | contribs) |
| Date of latest edit | 01:13, 26 December 2024 |
| Total number of edits | 62 |
| Recent number of edits (within past 180 days) | 3 |
| Recent number of distinct authors | 3 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Kosaraju's algorithm (also known as the Kosaraju–Sharir algorithm) is a linear time algorithm to find the strongly connected components of a directed graph. Aho... |
