Counting SCCs using DFS [closed]

Counting SCCs using DFS [closed]

References

Reference NO 1

http://stackoverflow.com/questions/15189666/counting-sccs-using-dfs

Reference NO 2

http://www.geeksforgeeks.org/strongly-connected-components/

Reference NO 3

http://ion.uwinnipeg.ca/~ychen2/StudentPresentation/Presentation.pdf

Reference NO 4

https://gist.github.com/2355050

Reference NO 5

http://codehiker.wordpress.com/2012/04/06/kosarajus-scc/

Reference NO 6

http://mypathtothe4.blogspot.com/2013/04/graph-path-problems-lost-mittens.html

Reference NO 7

http://cseweb.ucsd.edu/classes/sp13/cse101-a/lecture-dijkstra.pdf

Reference NO 8

http://en.wikipedia.org/wiki/Tarjan's_strongly_connected_components_algorithm