DepthFirstSearch Implements a Depth-First-Search based algorithm to find strongly connected components in a Directed Graph. Uses Adjacency lists to represent the graphs. Written in Python 3.3