Kosaraju's algorithm

Kosaraju's algorithm

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

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.

Excerpt from the Wikipedia article “Kosaraju's algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Open free boosters and add Kosaraju's algorithm to your collection.

Play for free

Related cards