From da73a0c684be023d79fe20481bdcb8b6529ea209 Mon Sep 17 00:00:00 2001
From: jacques <gkounkou@gmail.com>
Date: Fri, 25 Oct 2024 01:21:08 -0700
Subject: [PATCH] (chore) Update topological code answer

---
 logic/topological-sorting/topological-sorting.js | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/logic/topological-sorting/topological-sorting.js b/logic/topological-sorting/topological-sorting.js
index 06f9cbd..915c4c0 100644
--- a/logic/topological-sorting/topological-sorting.js
+++ b/logic/topological-sorting/topological-sorting.js
@@ -10,9 +10,9 @@ var question = [
         answerCpp: `void dfs(int node, map<int, bool>& visited, stack<int>& stk, vector<int> graph[]) {
     visited[node] = true;
     
-    for (int i : graph[node]) {
-        if (visited[i]) continue;
-        dfs(i, visited, stk, graph);
+    for (int nei : graph[node]) {
+        if (visited[nei]) continue;
+        dfs(nei, visited, stk, graph);
     }
     
     stk.push(node);
@@ -35,9 +35,9 @@ void topoSortGraph(vector<int> nodes, vector<int> graph[]) {
         answerGo: `func dfs(v int, visited []bool, stk *[]int, graph [][]int) {
     visited[v] = true
     
-    for _, i := range graph[v] {
-        if !visited[i] {
-            dfs(i, visited, stk, graph)
+    for _, nei := range graph[v] {
+        if !visited[nei] {
+            dfs(nei, visited, stk, graph)
         }
     }