Category "tarjans-algorithm"

The special case for using Tarjan's algorithm to find bridges in directed graphs

I am trying to get better understanding of Tarjan's algorithm for finding SCC, articulation points and bridges. I am considering a special case where the graph

Segmentation Fault - unordered_map(tarjan's algorithm)

I have implemented Tarjan's algorithm to find strongly connected component in a graph and getting Segmentation fault for some large input. #include <iostream