xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-08 05:26:07 +00:00
Code Issues Packages Projects Releases Wiki Activity

Translate all code to English (#1836)

Browse Source 
* 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
This commit is contained in:
Yudong Jin
2025-12-31 07:44:52 +08:00
committed by GitHub
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
Download Patch File Download Diff File Expand all files Collapse all files
en/codes/cpp/chapter_graph/graph_adjacency_list.cpp
+6 -6
View File
@@ -12,7 +12,7 @@ class GraphAdjList {
// Adjacency list, key: vertex, value: all adjacent vertices of that vertex
unordered_map<Vertex *, vector<Vertex *>> adjList;
/* Remove a specified node from vector */
/* Remove specified node from vector */
void remove(vector<Vertex *> &vec, Vertex *vet) {
for (int i = 0; i < vec.size(); i++) {
if (vec[i] == vet) {
@@ -59,7 +59,7 @@ class GraphAdjList {
void addVertex(Vertex *vet) {
if (adjList.count(vet))
return;
// Add a new linked list to the adjacency list
// Add a new linked list in the adjacency list
adjList[vet] = vector<Vertex *>();
}
@@ -67,15 +67,15 @@ class GraphAdjList {
void removeVertex(Vertex *vet) {
if (!adjList.count(vet))
throw invalid_argument("Vertex does not exist");
// Remove the vertex vet's corresponding linked list from the adjacency list
// Remove the linked list corresponding to vertex vet in the adjacency list
adjList.erase(vet);
// Traverse other vertices' linked lists, removing all edges containing vet
// Traverse the linked lists of other vertices and remove all edges containing vet
for (auto &adj : adjList) {
remove(adj.second, vet);
}
}
/* Print the adjacency list */
/* Print adjacency list */
void print() {
cout << "Adjacency list =" << endl;
for (auto &adj : adjList) {
@@ -87,4 +87,4 @@ class GraphAdjList {
}
};
// See test case in graph_adjacency_list_test.cpp
// See graph_adjacency_list_test.cpp for test cases
en/codes/cpp/chapter_graph/graph_adjacency_list_test.cpp
+9 -9
View File
@@ -8,36 +8,36 @@
/* Driver Code */
int main() {
/* Initialize undirected graph */
/* Add edge */
vector<Vertex *> v = valsToVets(vector<int>{1, 3, 2, 5, 4});
vector<vector<Vertex *>> edges = {{v[0], v[1]}, {v[0], v[3]}, {v[1], v[2]},
{v[2], v[3]}, {v[2], v[4]}, {v[3], v[4]}};
GraphAdjList graph(edges);
cout << "\nAfter initialization, the graph is" << endl;
cout << "\nAfter initialization, graph is" << endl;
graph.print();
/* Add edge */
// Vertices 1, 2 i.e., v[0], v[2]
// Vertices 1, 3 are v[0], v[1]
graph.addEdge(v[0], v[2]);
cout << "\nAfter adding edge 1-2, the graph is" << endl;
cout << "\nAfter adding edge 1-2, graph is" << endl;
graph.print();
/* Remove edge */
// Vertices 1, 3 i.e., v[0], v[1]
// Vertex 3 is v[1]
graph.removeEdge(v[0], v[1]);
cout << "\nAfter removing edge 1-3, the graph is" << endl;
cout << "\nAfter removing edge 1-3, graph is" << endl;
graph.print();
/* Add vertex */
Vertex *v5 = new Vertex(6);
graph.addVertex(v5);
cout << "\nAfter adding vertex 6, the graph is" << endl;
cout << "\nAfter adding vertex 6, graph is" << endl;
graph.print();
/* Remove vertex */
// Vertex 3 i.e., v[1]
// Vertex 3 is v[1]
graph.removeVertex(v[1]);
cout << "\nAfter removing vertex 3, the graph is" << endl;
cout << "\nAfter removing vertex 3, graph is" << endl;
graph.print();
// Free memory
en/codes/cpp/chapter_graph/graph_adjacency_matrix.cpp
+20 -20
View File
@@ -8,8 +8,8 @@
/* Undirected graph class based on adjacency matrix */
class GraphAdjMat {
vector<int> vertices; // Vertex list, elements represent "vertex value", index represents "vertex index"
vector<vector<int>> adjMat; // Adjacency matrix, row and column indices correspond to "vertex index"
vector<int> vertices; // Vertex list, where the element represents the "vertex value" and the index represents the "vertex index"
vector<vector<int>> adjMat; // Adjacency matrix, where the row and column indices correspond to the "vertex index"
public:
/* Constructor */
@@ -19,7 +19,7 @@ class GraphAdjMat {
addVertex(val);
}
// Add edge
// Edges elements represent vertex indices
// Note that the edges elements represent vertex indices, i.e., corresponding to the vertices element indices
for (const vector<int> &edge : edges) {
addEdge(edge[0], edge[1]);
}
@@ -33,7 +33,7 @@ class GraphAdjMat {
/* Add vertex */
void addVertex(int val) {
int n = size();
// Add new vertex value to the vertex list
// Add the value of the new vertex to the vertex list
vertices.push_back(val);
// Add a row to the adjacency matrix
adjMat.emplace_back(vector<int>(n, 0));
@@ -48,30 +48,30 @@ class GraphAdjMat {
if (index >= size()) {
throw out_of_range("Vertex does not exist");
}
// Remove vertex at `index` from the vertex list
// Remove the vertex at index from the vertex list
vertices.erase(vertices.begin() + index);
// Remove the row at `index` from the adjacency matrix
// Remove the row at index from the adjacency matrix
adjMat.erase(adjMat.begin() + index);
// Remove the column at `index` from the adjacency matrix
// Remove the column at index from the adjacency matrix
for (vector<int> &row : adjMat) {
row.erase(row.begin() + index);
}
}
/* Add edge */
// Parameters i, j correspond to vertices element indices
// Parameters i, j correspond to the vertices element indices
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 out_of_range("Vertex does not exist");
}
// In an undirected graph, the adjacency matrix is symmetric about the main diagonal, i.e., satisfies (i, j) == (j, i)
// 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 vertices element indices
// Parameters i, j correspond to the vertices element indices
void removeEdge(int i, int j) {
// Handle index out of bounds and equality
if (i < 0 || j < 0 || i >= size() || j >= size() || i == j) {
@@ -92,35 +92,35 @@ class GraphAdjMat {
/* Driver Code */
int main() {
/* Initialize undirected graph */
// Edges elements represent vertex indices
/* Add edge */
// Note that the edges elements represent vertex indices, i.e., corresponding to the vertices element indices
vector<int> vertices = {1, 3, 2, 5, 4};
vector<vector<int>> edges = {{0, 1}, {0, 3}, {1, 2}, {2, 3}, {2, 4}, {3, 4}};
GraphAdjMat graph(vertices, edges);
cout << "\nAfter initialization, the graph is" << endl;
cout << "\nAfter initialization, graph is" << endl;
graph.print();
/* Add edge */
// Indices of vertices 1, 2 are 0, 2 respectively
// Add vertex
graph.addEdge(0, 2);
cout << "\nAfter adding edge 1-2, the graph is" << endl;
cout << "\nAfter adding edge 1-2, graph is" << endl;
graph.print();
/* Remove edge */
// Indices of vertices 1, 3 are 0, 1 respectively
// Vertices 1, 3 have indices 0, 1 respectively
graph.removeEdge(0, 1);
cout << "\nAfter removing edge 1-3, the graph is" << endl;
cout << "\nAfter removing edge 1-3, graph is" << endl;
graph.print();
/* Add vertex */
graph.addVertex(6);
cout << "\nAfter adding vertex 6, the graph is" << endl;
cout << "\nAfter adding vertex 6, graph is" << endl;
graph.print();
/* Remove vertex */
// Index of vertex 3 is 1
// Vertex 3 has index 1
graph.removeVertex(1);
cout << "\nAfter removing vertex 3, the graph is" << endl;
cout << "\nAfter removing vertex 3, graph is" << endl;
graph.print();
return 0;
en/codes/cpp/chapter_graph/graph_bfs.cpp
+9 -9
View File
@@ -8,11 +8,11 @@
#include "./graph_adjacency_list.cpp"
/* Breadth-first traversal */
// Use adjacency list to represent the graph, to obtain all adjacent vertices of a specified vertex
// Use adjacency list to represent the graph, in order to obtain all adjacent vertices of a specified vertex
vector<Vertex *> graphBFS(GraphAdjList &graph, Vertex *startVet) {
// Vertex traversal sequence
vector<Vertex *> res;
// Hash set, used to record visited vertices
// Hash set for recording vertices that have been visited
unordered_set<Vertex *> visited = {startVet};
// Queue used to implement BFS
queue<Vertex *> que;
@@ -20,29 +20,29 @@ vector<Vertex *> graphBFS(GraphAdjList &graph, Vertex *startVet) {
// Starting from vertex vet, loop until all vertices are visited
while (!que.empty()) {
Vertex *vet = que.front();
que.pop(); // Dequeue the vertex at the head of the queue
que.pop(); // Dequeue the front vertex
res.push_back(vet); // Record visited vertex
// Traverse all adjacent vertices of that vertex
// Traverse all adjacent vertices of this vertex
for (auto adjVet : graph.adjList[vet]) {
if (visited.count(adjVet))
continue; // Skip already visited vertices
continue; // Skip vertices that have been visited
que.push(adjVet); // Only enqueue unvisited vertices
visited.emplace(adjVet); // Mark the vertex as visited
visited.emplace(adjVet); // Mark this vertex as visited
}
}
// Return the vertex traversal sequence
// Return vertex traversal sequence
return res;
}
/* Driver Code */
int main() {
/* Initialize undirected graph */
/* Add edge */
vector<Vertex *> v = valsToVets({0, 1, 2, 3, 4, 5, 6, 7, 8, 9});
vector<vector<Vertex *>> edges = {{v[0], v[1]}, {v[0], v[3]}, {v[1], v[2]}, {v[1], v[4]},
{v[2], v[5]}, {v[3], v[4]}, {v[3], v[6]}, {v[4], v[5]},
{v[4], v[7]}, {v[5], v[8]}, {v[6], v[7]}, {v[7], v[8]}};
GraphAdjList graph(edges);
cout << "\nAfter initialization, the graph is\n";
cout << "\nAfter initialization, graph is\\n";
graph.print();
/* Breadth-first traversal */
en/codes/cpp/chapter_graph/graph_dfs.cpp
+7 -7
View File
@@ -10,22 +10,22 @@
/* Depth-first traversal helper function */
void dfs(GraphAdjList &graph, unordered_set<Vertex *> &visited, vector<Vertex *> &res, Vertex *vet) {
res.push_back(vet); // Record visited vertex
visited.emplace(vet); // Mark the vertex as visited
// Traverse all adjacent vertices of that vertex
visited.emplace(vet); // Mark this vertex as visited
// Traverse all adjacent vertices of this vertex
for (Vertex *adjVet : graph.adjList[vet]) {
if (visited.count(adjVet))
continue; // Skip already visited vertices
continue; // Skip vertices that have been visited
// Recursively visit adjacent vertices
dfs(graph, visited, res, adjVet);
}
}
/* Depth-first traversal */
// Use adjacency list to represent the graph, to obtain all adjacent vertices of a specified vertex
// Use adjacency list to represent the graph, in order to obtain all adjacent vertices of a specified vertex
vector<Vertex *> graphDFS(GraphAdjList &graph, Vertex *startVet) {
// Vertex traversal sequence
vector<Vertex *> res;
// Hash set, used to record visited vertices
// Hash set for recording vertices that have been visited
unordered_set<Vertex *> visited;
dfs(graph, visited, res, startVet);
return res;
@@ -33,12 +33,12 @@ vector<Vertex *> graphDFS(GraphAdjList &graph, Vertex *startVet) {
/* Driver Code */
int main() {
/* Initialize undirected graph */
/* Add edge */
vector<Vertex *> v = valsToVets(vector<int>{0, 1, 2, 3, 4, 5, 6});
vector<vector<Vertex *>> 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]}};
GraphAdjList graph(edges);
cout << "\nAfter initialization, the graph is" << endl;
cout << "\nAfter initialization, graph is" << endl;
graph.print();
/* Depth-first traversal */