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-07-18 01:36:07 +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,137 @@
+/**
+ * File: graph_adjacency_matrix.cs
+ * Created Time: 2023-02-06
+ * Author: zjkung1123 (zjkung1123@gmail.com)
+ */
+
+namespace hello_algo.chapter_graph;
+
+/* Undirected graph class based on adjacency matrix */
+class GraphAdjMat {
+    List<int> vertices;     // Vertex list, where the element represents the "vertex value" and the index represents the "vertex index"
+    List<List<int>> adjMat; // Adjacency matrix, where the row and column indices correspond to the "vertex index"
+
+    /* Constructor */
+    public GraphAdjMat(int[] vertices, int[][] edges) {
+        this.vertices = [];
+        this.adjMat = [];
+        // Add vertex
+        foreach (int val in vertices) {
+            AddVertex(val);
+        }
+        // Add edge
+        // Note that the edges elements represent vertex indices, i.e., corresponding to the vertices element indices
+        foreach (int[] e in edges) {
+            AddEdge(e[0], e[1]);
+        }
+    }
+
+    /* Get the number of vertices */
+    int Size() {
+        return vertices.Count;
+    }
+
+    /* Add vertex */
+    public void AddVertex(int val) {
+        int n = Size();
+        // Add the value of the new vertex to the vertex list
+        vertices.Add(val);
+        // Add a row to the adjacency matrix
+        List<int> newRow = new(n);
+        for (int j = 0; j < n; j++) {
+            newRow.Add(0);
+        }
+        adjMat.Add(newRow);
+        // Add a column to the adjacency matrix
+        foreach (List<int> row in adjMat) {
+            row.Add(0);
+        }
+    }
+
+    /* Remove vertex */
+    public void RemoveVertex(int index) {
+        if (index >= Size())
+            throw new IndexOutOfRangeException();
+        // Remove the vertex at index from the vertex list
+        vertices.RemoveAt(index);
+        // Remove the row at index from the adjacency matrix
+        adjMat.RemoveAt(index);
+        // Remove the column at index from the adjacency matrix
+        foreach (List<int> row in adjMat) {
+            row.RemoveAt(index);
+        }
+    }
+
+    /* Add edge */
+    // Parameters i, j correspond to the vertices element indices
+    public void AddEdge(int i, int j) {
+        // Handle index out of bounds and equality
+        if (i < 0 || j < 0 || i >= Size() || j >= Size() || i == j)
+            throw new IndexOutOfRangeException();
+        // In an undirected graph, the adjacency matrix is symmetric about the main diagonal, i.e., (i, j) == (j, i)
+        adjMat[i][j] = 1;
+        adjMat[j][i] = 1;
+    }
+
+    /* Remove edge */
+    // Parameters i, j correspond to the vertices element indices
+    public void RemoveEdge(int i, int j) {
+        // Handle index out of bounds and equality
+        if (i < 0 || j < 0 || i >= Size() || j >= Size() || i == j)
+            throw new IndexOutOfRangeException();
+        adjMat[i][j] = 0;
+        adjMat[j][i] = 0;
+    }
+
+    /* Print adjacency matrix */
+    public void Print() {
+        Console.Write("Vertex list = ");
+        PrintUtil.PrintList(vertices);
+        Console.WriteLine("Adjacency matrix =");
+        PrintUtil.PrintMatrix(adjMat);
+    }
+}
+
+public class graph_adjacency_matrix {
+    [Test]
+    public void Test() {
+        /* Add edge */
+        // Note that the edges elements represent vertex indices, i.e., corresponding to the vertices element indices
+        int[] vertices = [1, 3, 2, 5, 4];
+        int[][] edges = 
+        [
+            [0, 1],
+            [0, 3],
+            [1, 2],
+            [2, 3],
+            [2, 4],
+            [3, 4]
+        ];
+        GraphAdjMat graph = new(vertices, edges);
+        Console.WriteLine("\nAfter initialization, graph is");
+        graph.Print();
+
+        /* Add edge */
+        // Add vertex
+        graph.AddEdge(0, 2);
+        Console.WriteLine("\nAfter adding edge 1-2, graph is");
+        graph.Print();
+
+        /* Remove edge */
+        // Vertices 1, 3 have indices 0, 1 respectively
+        graph.RemoveEdge(0, 1);
+        Console.WriteLine("\nAfter removing edge 1-3, graph is");
+        graph.Print();
+
+        /* Add vertex */
+        graph.AddVertex(6);
+        Console.WriteLine("\nAfter adding vertex 6, graph is");
+        graph.Print();
+
+        /* Remove vertex */
+        // Vertex 3 has index 1
+        graph.RemoveVertex(1);
+        Console.WriteLine("\nAfter removing vertex 3, graph is");
+        graph.Print();
+    }
+}