Add note linking to Kahn's algorithm in TopologicalSortAdjacencyList

williamfiset · claude · williamfiset · commit 4b96cd9c03fc · 2026-03-24T21:58:21.000-07:00
Co-Authored-By: Claude Opus 4.6 &lt;noreply@anthropic.com&gt;
diff --git a/src/main/java/com/williamfiset/algorithms/graphtheory/TopologicalSortAdjacencyList.java b/src/main/java/com/williamfiset/algorithms/graphtheory/TopologicalSortAdjacencyList.java
@@ -5,6 +5,9 @@
  *
  * <p>Also includes a method to find shortest paths in a DAG using the topological ordering.
  *
+ * <p>NOTE: An arguably simpler approach to topological sorting is Kahn's algorithm, which uses
+ * in-degree counting and BFS instead of DFS. See {@link Kahns}.
+ *
  * <p>Time: O(V + E)
  *
  * <p>Space: O(V + E)

Original file line number	Diff line number	Diff line change
`@@ -5,6 +5,9 @@`
`5`	`5`	`*`
`6`	`6`	`* <p>Also includes a method to find shortest paths in a DAG using the topological ordering.`
`7`	`7`	`*`
	`8`	`+ * <p>NOTE: An arguably simpler approach to topological sorting is Kahn's algorithm, which uses`
	`9`	`+ * in-degree counting and BFS instead of DFS. See {@link Kahns}.`
	`10`	`+ *`
`8`	`11`	`* <p>Time: O(V + E)`
`9`	`12`	`*`
`10`	`13`	`* <p>Space: O(V + E)`