algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: add/refactor method in include, simplified print code (#471)

Browse Source
This commit is contained in:
hpstory
2023-04-21 14:59:22 +08:00
committed by GitHub
parent 9c2e5e2831
commit 9eeefff447
24 changed files with 102 additions and 109 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
codes/csharp/chapter_graph/graph_adjacency_list.cs
View File

@@ -85,8 +85,8 @@ public class GraphAdjList
{
List<int> tmp = new List<int>();
foreach (Vertex vertex in entry.Value)
tmp.Add(vertex.Val);
Console.WriteLine(entry.Key.Val + ": [" + string.Join(", ", tmp) + "],");
tmp.Add(vertex.val);
Console.WriteLine(entry.Key.val + ": [" + string.Join(", ", tmp) + "],");
}
}
}
@@ -97,7 +97,7 @@ public class graph_adjacency_list
public void Test()
{
/* 初始化无向图 */
Vertex[] v = Vertex.valsToVets(new int[] { 1, 3, 2, 5, 4 });
Vertex[] v = Vertex.ValsToVets(new int[] { 1, 3, 2, 5, 4 });
Vertex[][] edges = new Vertex[][] { new Vertex[] { v[0], v[1] }, new Vertex[] { v[0], v[3] },
new Vertex[] { v[1], v[2] }, new Vertex[] { v[2], v[3] },
new Vertex[] { v[2], v[4] }, new Vertex[] { v[3], v[4] } };

2
codes/csharp/chapter_graph/graph_adjacency_matrix.cs
View File

@@ -104,7 +104,7 @@ class GraphAdjMat
Console.Write("顶点列表 = ");
PrintUtil.PrintList(vertices);
Console.WriteLine("邻接矩阵 =");
PrintUtil.printMatrix(adjMat);
PrintUtil.PrintMatrix(adjMat);
}
}

4
codes/csharp/chapter_graph/graph_bfs.cs
View File

@@ -46,7 +46,7 @@ public class graph_bfs
public void Test()
{
/* 初始化无向图 */
Vertex[] v = Vertex.valsToVets(new int[10] { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 });
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] },
@@ -62,6 +62,6 @@ public class graph_bfs
/* 广度优先遍历 BFS */
List<Vertex> res = graphBFS(graph, v[0]);
Console.WriteLine("\n广度优先遍历（BFS）顶点序列为");
Console.WriteLine(string.Join(" ", Vertex.vetsToVals(res)));
Console.WriteLine(string.Join(" ", Vertex.VetsToVals(res)));
}
}

4
codes/csharp/chapter_graph/graph_dfs.cs
View File

@@ -44,7 +44,7 @@ public class graph_dfs
public void Test()
{
/* 初始化无向图 */
Vertex[] v = Vertex.valsToVets(new int[7] { 0, 1, 2, 3, 4, 5, 6 });
Vertex[] v = Vertex.ValsToVets(new int[7] { 0, 1, 2, 3, 4, 5, 6 });
Vertex[][] edges = new Vertex[6][]
{
new Vertex[2] { v[0], v[1] }, new Vertex[2] { v[0], v[3] }, new Vertex[2] { v[1], v[2] },
@@ -58,6 +58,6 @@ public class graph_dfs
/* 深度优先遍历 DFS */
List<Vertex> res = graphDFS(graph, v[0]);
Console.WriteLine("\n深度优先遍历（DFS）顶点序列为");
Console.WriteLine(string.Join(" ", Vertex.vetsToVals(res)));
Console.WriteLine(string.Join(" ", Vertex.VetsToVals(res)));
}
}