update top sorting

Author: jsgoller1

implementations/Technique - Topological Sorting.ipynb

@@ -96,7 +96,7 @@
     "- The graph may have multiple roots; you need to be able to access them all to formulate the t order\n",
     "- You don't get a root at the beginning but some other representation of a graph; you will need to find roots first and sometimes construct an adjacency list. \n",
     "\n",
-    "The code below implements the DFS-based te,[;ate on the above tree. In it, we assume that the given node is the root node, and that every other node is reachable from it:"
+    "The code below implements the DFS-based approach on the above tree. In it, we assume that the given node is the root node, and that every other node is reachable from it:"
    ]
   },
   {