Information for "Talk:Maximal elements algorithms"

Basic information

Display titleTalk:Maximal elements algorithms
Default sort keyMaximal elements algorithms
Page length (in bytes)2,467
Namespace ID1
Page ID529
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Number of subpages of this page0 (0 redirects; 0 non-redirects)

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
DeleteAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>MarkusSchulze
Date of page creation11:44, 27 October 2006
Latest editorBetterVotingAdvocacy (talk | contribs)
Date of latest edit20:00, 26 February 2020
Total number of edits5
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

SEO properties



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.
Information from Extension:WikiSEO