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

fix(csharp): Modify method name to PascalCase, simplify new expression (#840)

Browse Source 
* Modify method name to PascalCase(array and linked list)

* Modify method name to PascalCase(backtracking)

* Modify method name to PascalCase(computational complexity)

* Modify method name to PascalCase(divide and conquer)

* Modify method name to PascalCase(dynamic programming)

* Modify method name to PascalCase(graph)

* Modify method name to PascalCase(greedy)

* Modify method name to PascalCase(hashing)

* Modify method name to PascalCase(heap)

* Modify method name to PascalCase(searching)

* Modify method name to PascalCase(sorting)

* Modify method name to PascalCase(stack and queue)

* Modify method name to PascalCase(tree)

* local check
This commit is contained in:
hpstory
2023-10-08 01:33:46 +08:00
committed by GitHub
parent 6f7e768cb7
commit f62256bee1
129 changed files with 1186 additions and 1192 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/csharp/chapter_graph/graph_bfs.cs
+7 -7
View File
@@ -9,13 +9,13 @@ namespace hello_algo.chapter_graph;
public class graph_bfs {
/* 广度优先遍历 BFS */
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
public static List<Vertex> graphBFS(GraphAdjList graph, Vertex startVet) {
public static List<Vertex> GraphBFS(GraphAdjList graph, Vertex startVet) {
// 顶点遍历序列
List<Vertex> res = new List<Vertex>();
List<Vertex> res = new();
// 哈希表，用于记录已被访问过的顶点
HashSet<Vertex> visited = new HashSet<Vertex>() { startVet };
HashSet<Vertex> visited = new() { startVet };
// 队列用于实现 BFS
Queue<Vertex> que = new Queue<Vertex>();
Queue<Vertex> que = new();
que.Enqueue(startVet);
// 以顶点 vet 为起点，循环直至访问完所有顶点
while (que.Count > 0) {
@@ -46,12 +46,12 @@ public class graph_bfs {
new Vertex[2] { v[5], v[8] }, new Vertex[2] { v[6], v[7] }, new Vertex[2] { v[7], v[8] }
};
GraphAdjList graph = new GraphAdjList(edges);
GraphAdjList graph = new(edges);
Console.WriteLine("\n初始化后，图为");
graph.print();
graph.Print();
/* 广度优先遍历 BFS */
List<Vertex> res = graphBFS(graph, v[0]);
List<Vertex> res = GraphBFS(graph, v[0]);
Console.WriteLine("\n广度优先遍历（BFS）顶点序列为");
Console.WriteLine(string.Join(" ", Vertex.VetsToVals(res)));
}