Translate all code to English (#1836)

* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
2026-08-30 20:07:14 +00:00 · 2025-12-31 07:44:52 +08:00
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
@@ -0,0 +1,54 @@
+=begin
+File: graph_dfs.rb
+Created Time: 2024-04-25
+Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
+=end
+
+require 'set'
+require_relative './graph_adjacency_list'
+require_relative '../utils/vertex'
+
+### Depth-first traversal helper function ###
+def dfs(graph, visited, res, vet)
+  res << vet # Record visited vertex
+  visited.add(vet) # Mark this vertex as visited
+  # Traverse all adjacent vertices of this vertex
+  for adj_vet in graph.adj_list[vet]
+    next if visited.include?(adj_vet) # Skip vertices that have been visited
+    # Recursively visit adjacent vertices
+    dfs(graph, visited, res, adj_vet)
+  end
+end
+
+### Depth-first traversal ###
+def graph_dfs(graph, start_vet)
+  # Use adjacency list to represent the graph, in order to obtain all adjacent vertices of a specified vertex
+  # Vertex traversal sequence
+  res = []
+  # Hash set for recording vertices that have been visited
+  visited = Set.new
+  dfs(graph, visited, res, start_vet)
+  res
+end
+
+### Driver Code ###
+if __FILE__ == $0
+  # Add edge
+  v = vals_to_vets([0, 1, 2, 3, 4, 5, 6])
+  edges = [
+    [v[0], v[1]],
+    [v[0], v[3]],
+    [v[1], v[2]],
+    [v[2], v[5]],
+    [v[4], v[5]],
+    [v[5], v[6]],
+  ]
+  graph = GraphAdjList.new(edges)
+  puts "\nAfter initialization, graph is"
+  graph.__print__
+
+  # Depth-first traversal
+  res = graph_dfs(graph, v[0])
+  puts "\nDepth-first traversal (DFS) vertex sequence is"
+  p vets_to_vals(res)
+end