# Other articles

# Using Tarjan's Algorithm

## Strongly Connected Components with Tarjan's Algorithm¶

When we deal with Directed Graphs we will sometimes find a Strongly Conected Graph. Such graph has a path between every pair of nodes (vertexes) in the graph going on both directions.

When we refer to Strongly Connected Components in a graph, we ...

Page 1 / 1