Merge pull request #1512 from Zombiesalad1337/master

mhayter · web-flow · commit 6b0fc53d0f8a · 2025-08-27T19:30:30.000-04:00
Fix incorrect reference direction in DFS article
diff --git a/src/graph/depth-first-search.md b/src/graph/depth-first-search.md
@@ -44,7 +44,7 @@ For more details check out the implementation.
     The required topological ordering will be the vertices sorted in descending order of exit time.
   
   
-  * Check whether a given graph is acyclic and find cycles in a graph. (As mentioned above by counting back edges in every connected components).
+  * Check whether a given graph is acyclic and find cycles in a graph. (As mentioned below by counting back edges in every connected components).
   
   * Find strongly connected components in a directed graph:
   
