I have implemented Tarjan's algorithm to find strongly connected component in a graph and getting Segmentation fault for some large input. #include <iostream
For ex, unordered_set<int> s ; s.insert(100); How do I get value 100 from s? From http://www.cplusplus.com/reference/unordered_set/unordered_set/begin