20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Tarjans Strongly Connected Components Algorithm: Graph Theory, Algorithm, Strongly Connected Components -

English
2026-03-17
€156.58 €195.73

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

High Quality Content by WIKIPEDIA articles! The basic idea of the algorithm is this: a depth-first search begins from a start node. The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components. The nodes are placed on a stack in the order in which they are visited. When the search returns from a subtree, the nodes are taken fro ... Full description

You May Also Like

Description

High Quality Content by WIKIPEDIA articles! The basic idea of the algorithm is this: a depth-first search begins from a start node. The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components. The nodes are placed on a stack in the order in which they are visited. When the search returns from a subtree, the nodes are taken from the stack and it is determined whether each node is the root of a strongly connected component. If a node is the root of a strongly connected component, then it and all of the nodes taken off before it form that strongly connected component.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786131171260
Write Your Own Review
You're reviewing: Tarjans Strongly Connected Components Algorithm: Graph Theory, Algorithm, Strongly Connected Components
Your Rating:

Goodreads Reviews

€156.58 €195.73