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

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

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

@@ -8,8 +8,8 @@ namespace hello_algo.chapter_graph;
/* 基于邻接矩阵实现的无向图类 */
class GraphAdjMat {
List<int> vertices; // 顶点列表，元素代表“顶点值”，索引代表“顶点索引”
List<List<int>> adjMat; // 邻接矩阵，行列索引对应“顶点索引”
readonly List<int> vertices; // 顶点列表，元素代表“顶点值”，索引代表“顶点索引”
readonly List<List<int>> adjMat; // 邻接矩阵，行列索引对应“顶点索引”
/* 构造函数 */
public GraphAdjMat(int[] vertices, int[][] edges) {
@@ -17,27 +17,27 @@ class GraphAdjMat {
this.adjMat = new List<List<int>>();
// 添加顶点
foreach (int val in vertices) {
addVertex(val);
AddVertex(val);
}
// 添加边
// 请注意，edges 元素代表顶点索引，即对应 vertices 元素索引
foreach (int[] e in edges) {
addEdge(e[0], e[1]);
AddEdge(e[0], e[1]);
}
}
/* 获取顶点数量 */
public int size() {
public int Size() {
return vertices.Count;
}
/* 添加顶点 */
public void addVertex(int val) {
int n = size();
public void AddVertex(int val) {
int n = Size();
// 向顶点列表中添加新顶点的值
vertices.Add(val);
// 在邻接矩阵中添加一行
List<int> newRow = new List<int>(n);
List<int> newRow = new(n);
for (int j = 0; j < n; j++) {
newRow.Add(0);
}
@@ -49,8 +49,8 @@ class GraphAdjMat {
}
/* 删除顶点 */
public void removeVertex(int index) {
if (index >= size())
public void RemoveVertex(int index) {
if (index >= Size())
throw new IndexOutOfRangeException();
// 在顶点列表中移除索引 index 的顶点
vertices.RemoveAt(index);
@@ -64,9 +64,9 @@ class GraphAdjMat {
/* 添加边 */
// 参数 i, j 对应 vertices 元素索引
public void addEdge(int i, int j) {
public void AddEdge(int i, int j) {
// 索引越界与相等处理
if (i < 0 || j < 0 || i >= size() || j >= size() || i == j)
if (i < 0 || j < 0 || i >= Size() || j >= Size() || i == j)
throw new IndexOutOfRangeException();
// 在无向图中，邻接矩阵沿主对角线对称，即满足 (i, j) == (j, i)
adjMat[i][j] = 1;
@@ -75,16 +75,16 @@ class GraphAdjMat {
/* 删除边 */
// 参数 i, j 对应 vertices 元素索引
public void removeEdge(int i, int j) {
public void RemoveEdge(int i, int j) {
// 索引越界与相等处理
if (i < 0 || j < 0 || i >= size() || j >= size() || i == j)
if (i < 0 || j < 0 || i >= Size() || j >= Size() || i == j)
throw new IndexOutOfRangeException();
adjMat[i][j] = 0;
adjMat[j][i] = 0;
}
/* 打印邻接矩阵 */
public void print() {
public void Print() {
Console.Write("顶点列表 = ");
PrintUtil.PrintList(vertices);
Console.WriteLine("邻接矩阵 =");
@@ -101,31 +101,31 @@ public class graph_adjacency_matrix {
int[][] edges = new int[][] { new int[] { 0, 1 }, new int[] { 0, 3 },
new int[] { 1, 2 }, new int[] { 2, 3 },
new int[] { 2, 4 }, new int[] { 3, 4 } };
GraphAdjMat graph = new GraphAdjMat(vertices, edges);
GraphAdjMat graph = new(vertices, edges);
Console.WriteLine("\n初始化后，图为");
graph.print();
graph.Print();
/* 添加边 */
// 顶点 1, 2 的索引分别为 0, 2
graph.addEdge(0, 2);
graph.AddEdge(0, 2);
Console.WriteLine("\n添加边 1-2 后，图为");
graph.print();
graph.Print();
/* 删除边 */
// 顶点 1, 3 的索引分别为 0, 1
graph.removeEdge(0, 1);
graph.RemoveEdge(0, 1);
Console.WriteLine("\n删除边 1-3 后，图为");
graph.print();
graph.Print();
/* 添加顶点 */
graph.addVertex(6);
graph.AddVertex(6);
Console.WriteLine("\n添加顶点 6 后，图为");
graph.print();
graph.Print();
/* 删除顶点 */
// 顶点 3 的索引为 1
graph.removeVertex(1);
graph.RemoveVertex(1);
Console.WriteLine("\n删除顶点 3 后，图为");
graph.print();
graph.Print();
}
}