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-21 15:57: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,75 @@
+/**
+ * File: graph_dfs.c
+ * Created Time: 2023-07-13
+ * Author: NI-SW (947743645@qq.com)
+ */
+
+#include "graph_adjacency_list.c"
+
+// Assume max node count is 100
+#define MAX_SIZE 100
+
+/* Check if vertex has been visited */
+int isVisited(Vertex **res, int size, Vertex *vet) {
+    // Traverse to find node using O(n) time
+    for (int i = 0; i < size; i++) {
+        if (res[i] == vet) {
+            return 1;
+        }
+    }
+    return 0;
+}
+
+/* Depth-first traversal helper function */
+void dfs(GraphAdjList *graph, Vertex **res, int *resSize, Vertex *vet) {
+    // Record visited vertex
+    res[(*resSize)++] = vet;
+    // Traverse all adjacent vertices of this vertex
+    AdjListNode *node = findNode(graph, vet);
+    while (node != NULL) {
+        // Skip vertices that have been visited
+        if (!isVisited(res, *resSize, node->vertex)) {
+            // Recursively visit adjacent vertices
+            dfs(graph, res, resSize, node->vertex);
+        }
+        node = node->next;
+    }
+}
+
+/* Depth-first traversal */
+// Use adjacency list to represent the graph, in order to obtain all adjacent vertices of a specified vertex
+void graphDFS(GraphAdjList *graph, Vertex *startVet, Vertex **res, int *resSize) {
+    dfs(graph, res, resSize, startVet);
+}
+
+/* Driver Code */
+int main() {
+    // Add edge
+    int vals[] = {0, 1, 2, 3, 4, 5, 6};
+    int size = sizeof(vals) / sizeof(vals[0]);
+    Vertex **v = valsToVets(vals, size);
+    Vertex *edges[][2] = {{v[0], v[1]}, {v[0], v[3]}, {v[1], v[2]}, {v[2], v[5]}, {v[4], v[5]}, {v[5], v[6]}};
+    int egdeSize = sizeof(edges) / sizeof(edges[0]);
+    GraphAdjList *graph = newGraphAdjList();
+    // Add all vertices and edges
+    for (int i = 0; i < size; i++) {
+        addVertex(graph, v[i]);
+    }
+    for (int i = 0; i < egdeSize; i++) {
+        addEdge(graph, edges[i][0], edges[i][1]);
+    }
+    printf("\nAfter initialization, graph is\n");
+    printGraph(graph);
+
+    // Depth-first traversal
+    Vertex *res[MAX_SIZE];
+    int resSize = 0;
+    graphDFS(graph, v[0], res, &resSize);
+    printf("\nDepth-first traversal (DFS) vertex sequence is\n");
+    printArray(vetsToVals(res, resSize), resSize);
+
+    // Free memory
+    delGraphAdjList(graph);
+    free(v);
+    return 0;
+}