IB is possible to take all courses topological sorting

Author: Dhananjay Nagargoje

Diff for: src/main/java/problems/ongraph/TopologicalSorting.java

@@ -41,11 +41,11 @@ public static void main(String[] args) {
          */
 
         graph.addEdge(0, 1);
-        graph.addEdge(1, 2);
-        graph.addEdge(1, 3);
-        graph.addEdge(3, 2);
-        graph.addEdge(4, 3);
-        graph.addEdge(0, 4);
+        graph.addEdge(1, 0);
+   //     graph.addEdge(2, 0);
+//        graph.addEdge(3, 2);
+//        graph.addEdge(4, 3);
+//        graph.addEdge(0, 4);
 
         TopologicalSorting topologicalSorting = new TopologicalSorting(graph, 0);
         topologicalSorting.topoOrder.forEach(integer -> System.out.println(integer));