Apply batched suggestions from code review

Co-authored-by: Christian Clauss <cclauss@me.com>

Author: cclauss

sorts/topological_sort.py

@@ -1,4 +1,10 @@
-"""Topological Sort."""
+"""Topological Sort.
+
+https://en.wikipedia.org/wiki/Topological_sorting
+https://en.wikipedia.org/wiki/Directed_acyclic_graph
+
+Note: topological_sort() sorts a directed acyclic graph so topological_sort(2, 1, 3) should fail.
+"""
 
 #     a
 #    / \
@@ -21,7 +27,21 @@ def topological_sort(start: str, visited: list[str], sort: list[str]) -> list[st
 
     >>> topological_sort('a', [], [])
     ['c', 'd', 'e', 'b', 'a']
+
+    >>> topological_sort("a", "b", "c")
+    Traceback (most recent call last):
+        ...
+    ValueError: visited must be a list"
+
+    >>> topological_sort"a", [], "c")
+    Traceback (most recent call last):
+        ...
+    ValueError: visited must be a list"    
     """
+    if not isinstance(visited, list):
+        raise ValueError("visited must be a list")
+    if not isinstance(current, list):
+        raise ValueError("current must be a list")
     current = start
     # add current to visited
     visited.append(current)