push to github

examples/edge_classify.py

@@ -1,6 +1,7 @@
-# code
-import random
+# Algorithm from GeeksforGeeks (wrong)
+# https://www.geeksforgeeks.org/tree-back-edge-and-cross-edges-in-dfs-of-graph/
 
+import random
 
 class Graph:
 	# instance variables

examples/edge_classify_2.py

@@ -1,3 +1,6 @@
+# Algorithm from MIT OpenCourseWare (seems correct)
+# https://courses.csail.mit.edu/6.006/fall11/rec/rec14.pdf
+
 class DFSResult:
     def __init__(self):
         self.parent = {}