sethiyash/DS_Algo_Python

Graph -

Tarjans Algorithm -

Uses-

1. To Find all the bridge edges in graph
2. To Find Articulation points/cut-vertex in a graph
3. Find all the Strongly Connected Components in a Directed Graph (uses single DFS travesal)

References and solutions -

• https://www.geeksforgeeks.org/articulation-points-or-cut-vertices-in-a-graph/
• https://www.geeksforgeeks.org/tarjan-algorithm-find-strongly-connected-components/
• https://www.youtube.com/watch?v=TyWtx7q2D7Y
• https://www.techiedelight.com/types-edges-involved-dfs-relation/ (types of edges envolved in DFS)