| Display title | Talk:Maximal elements algorithms |
| Default sort key | Maximal elements algorithms |
| Page length (in bytes) | 2,467 |
| Namespace ID | 1 |
| Namespace | Talk |
| Page ID | 529 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | imported>MarkusSchulze |
| Date of page creation | 11:44, 27 October 2006 |
| Latest editor | BetterVotingAdvocacy (talk | contribs) |
| Date of latest edit | 20:00, 26 February 2020 |
| Total number of edits | 5 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | As far as I know, Kosaraju's algorithm finds the "strongly connected components" of a directed graph. But the Schwartz set is not identical to the "strongly connected components", but to the "communicating classes" of a directed graph. |
