GRAPH Graph implementation with adjacency lists and its algorithms: bfs dfs Connected component topology circle strongly connected alticulation point find bridges kruskal prim bellman ford all path max flow