Graph Traversal Algorithms

Tarjan's Algorithm

Linear algorithm that identifies strongly connected components in a directed graph using depth-first search with numbering and stacks.

← Indietro