OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Tarjan's algorithm

 Home Mathematics Fields of mathematics Applied mathematics Algorithms
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Tarjan's algorithm is a graph theory algorithm used to find strongly connected components (SCCs) in a directed graph. A strongly connected component of a directed graph is a maximal subgraph where every vertex is reachable from every other vertex in that subgraph. The algorithm was developed by Robert Tarjan and operates in linear time, which is O(V + E), where V is the number of vertices and E is the number of edges in the graph.

 Ancestors (5)

  1. Algorithms
  2. Applied mathematics
  3. Fields of mathematics
  4. Mathematics
  5.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook