Tarjan's strongly connected components algorithm

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

Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph. It runs in linear time, matching the time bound for alternative methods including Kosaraju's algorithm and the path-based strong component algorithm.

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

Image: LynX, CC BY-SA 3.0, via Wikimedia Commons.