Information for "Kosaraju's algorithm"

From HandWiki

Basic information

Display titleKosaraju's algorithm
Default sort keyKosaraju's algorithm
Page length (in bytes)9,171
Namespace ID0
Page ID183489
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
HandWiki item IDNone

Page protection

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

Edit history

Page creatorimported>AnLinks
Date of page creation21:20, 8 February 2024
Latest editorimported>AnLinks
Date of latest edit21:20, 8 February 2024
Total number of edits1
Recent number of edits (within past 90 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (14)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
In computer science, Kosaraju-Sharir's algorithm (also known as Kosaraju's algorithm) is a linear time algorithm to find the strongly connected components of a directed graph. Aho, Hopcroft and Ullman credit it to S. Rao Kosaraju and Micha Sharir. Kosaraju suggested it in 1978 but did not publish it...
Information from Extension:WikiSEO