Contains various graph problems like Spanning Tree,traversals(iterative dfs ),Topological Sort,Cycle,Shortest_Path(single source,all pair). See Sample_Graph which is made as reusable in which all algorithms are implemented whereas all others are caller classes in which user can make edges according to them and call respective method of Sample_Graph class.