Graph Algos in Java Basic Traversal 1.Breadth First Search 2.Depth First Search Topological Ordering 1.Topological Order 2.Shortest path using topological sort: Only applicable for DAG(Directed Acyclic Graph)