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

feat(csharp) .NET 8.0 code migration (#966)

Browse Source 
* .net 8.0 migration

* update docs

* revert change

* revert change and update appendix docs

* remove static

* Update binary_search_insertion.cs

* Update binary_search_insertion.cs

* Update binary_search_edge.cs

* Update binary_search_insertion.cs

* Update binary_search_edge.cs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
hpstory
2023-11-26 23:18:44 +08:00
committed by GitHub
parent d960c99a1f
commit 56b20eff36
93 changed files with 539 additions and 487 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/csharp/chapter_graph/graph_bfs.cs
+11 -11
View File
@@ -9,11 +9,11 @@ namespace hello_algo.chapter_graph;
public class graph_bfs {
/* 广度优先遍历 BFS */
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
public static List<Vertex> GraphBFS(GraphAdjList graph, Vertex startVet) {
List<Vertex> GraphBFS(GraphAdjList graph, Vertex startVet) {
// 顶点遍历序列
List<Vertex> res = new();
List<Vertex> res = [];
// 哈希表，用于记录已被访问过的顶点
HashSet<Vertex> visited = new() { startVet };
HashSet<Vertex> visited = [startVet];
// 队列用于实现 BFS
Queue<Vertex> que = new();
que.Enqueue(startVet);
@@ -37,14 +37,14 @@ public class graph_bfs {
[Test]
public void Test() {
/* 初始化无向图 */
Vertex[] v = Vertex.ValsToVets(new int[10] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
Vertex[][] edges = new Vertex[12][]
{
new Vertex[2] { v[0], v[1] }, new Vertex[2] { v[0], v[3] }, new Vertex[2] { v[1], v[2] },
new Vertex[2] { v[1], v[4] }, new Vertex[2] { v[2], v[5] }, new Vertex[2] { v[3], v[4] },
new Vertex[2] { v[3], v[6] }, new Vertex[2] { v[4], v[5] }, new Vertex[2] { v[4], v[7] },
new Vertex[2] { v[5], v[8] }, new Vertex[2] { v[6], v[7] }, new Vertex[2] { v[7], v[8] }
};
Vertex[] v = Vertex.ValsToVets([0, 1, 2, 3, 4, 5, 6, 7, 8, 9]);
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 = new(edges);
Console.WriteLine("\n初始化后，图为");