Update topological-sort.md

FranklinLiang · web-flow · commit b861d1ec80d7 · 2025-03-08T02:54:08.000-05:00
In the implementation example, the if statement within the dfs function is missing a pair of brackets.
diff --git a/src/graph/topological-sort.md b/src/graph/topological-sort.md
@@ -65,8 +65,9 @@ vector<int> ans;
 void dfs(int v) {
     visited[v] = true;
     for (int u : adj[v]) {
-        if (!visited[u])
+        if (!visited[u]) {
             dfs(u);
+        }
     }
     ans.push_back(v);
 }
