update output annotation without reverse neighbors.(dfs_iterative_optimized.py)

Author: zhuj05

graph/dfs_iterative_optimized.py

@@ -20,7 +20,8 @@ def dfs_iterative_optimized(graph, start_node):
             # Optimization 4: List comprehension/Reversed filtering
             # We push neighbors in reverse to maintain expected traversal order
             neighbors = [n for n in graph.get(node, []) if n not in visited]
-            stack.extend(reversed(neighbors))
+            #stack.extend(reversed(neighbors))
+            stack.extend((neighbors))
 
     return result
 
@@ -38,4 +39,5 @@ def dfs_iterative_optimized(graph, start_node):
 output = dfs_iterative_optimized(graph, 'A')
 print(f"DFS result: {output}")
 # output
-# DFS result: ['A', 'B', 'D', 'E', 'F', 'C']
+# DFS result: ['A', 'B', 'D', 'E', 'F', 'C']
+# DFS result: ['A', 'C', 'F', 'E', 'B', 'D']