CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-11-10 16:00:36 +08:00
Code Issues Packages Projects Releases Wiki Activity

Retranslate the complete English edition from Simplified Chinese (#2010)

Browse Source 
* Retranslate the complete English edition from Simplified Chinese

* Polish three English explanations after reader-focused review
This commit is contained in:
Yudong Jin
2026-10-31 03:35:51 +08:00
committed by GitHub
parent ef46e2ed95
commit 14c314c08c
1502 changed files with 29459 additions and 23517 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
en/codes/cpp/chapter_graph/graph_bfs.cpp
View File

@@ -8,46 +8,46 @@
#include "./graph_adjacency_list.cpp"
/* Breadth-first traversal */
// Use adjacency list to represent the graph, in order to obtain all adjacent vertices of a specified vertex
// Represent the graph with an adjacency list to access all neighbors of a given vertex
vector<Vertex *> graphBFS(GraphAdjList &graph, Vertex *startVet) {
// Vertex traversal sequence
vector<Vertex *> res;
// Hash set for recording vertices that have been visited
// Hash set recording visited vertices
unordered_set<Vertex *> visited = {startVet};
// Queue used to implement BFS
// Use a queue to implement BFS
queue<Vertex *> que;
que.push(startVet);
// Starting from vertex vet, loop until all vertices are visited
// Starting from startVet, continue until all reachable vertices have been visited
while (!que.empty()) {
Vertex *vet = que.front();
que.pop(); // Dequeue the front vertex
res.push_back(vet); // Record visited vertex
// Traverse all adjacent vertices of this vertex
res.push_back(vet); // Record the visited vertex
// Traverse all neighbors of this vertex
for (auto adjVet : graph.adjList[vet]) {
if (visited.count(adjVet))
continue; // Skip vertices that have been visited
que.push(adjVet); // Only enqueue unvisited vertices
continue; // Skip vertices that have already been visited
que.push(adjVet); // Enqueue only unvisited vertices
visited.emplace(adjVet); // Mark this vertex as visited
}
}
// Return vertex traversal sequence
// Return the vertex traversal sequence
return res;
}
/* Driver Code */
/* Driver code */
int main() {
/* Add edge */
/* Initialize the undirected graph */
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, graph is\\n";
cout << "\nGraph after initialization:\\n";
graph.print();
/* Breadth-first traversal */
vector<Vertex *> res = graphBFS(graph, v[0]);
cout << "\nBreadth-first traversal (BFS) vertex sequence is" << endl;
cout << "\nVertex sequence from breadth-first traversal (BFS):" << endl;
printVector(vetsToVals(res));
// Free memory