algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-04 06:07:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update graph_adjacency_list.java, .cs

Browse Source
This commit is contained in:
krahets
2023-02-15 21:45:35 +08:00
parent 1209261bdd
commit 0fa78e4b3b
3 changed files with 5 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -12,7 +12,7 @@ namespace hello_algo.chapter_graph;
/* 基于邻接表实现的无向图类 */
class GraphAdjList
{
// 邻接表 adjList 中的元素是 Vertex 对象
// 邻接表，key: 顶点，value：该顶点的所有邻接结点
Dictionary<Vertex, List<Vertex>> adjList;
/* 构造函数 */

4
codes/csharp/include/Vertex.cs
View File

@ -4,8 +4,10 @@
* Author: zjkung1123 (zjkung1123@gmail.com), krahets (krahets@163.com)
*/
namespace hello_algo.include;
/* 顶点类 */
class Vertex
public class Vertex
{
public int Val { get; init; }
public Vertex(int val)

3
codes/java/chapter_graph/graph_adjacency_list.java
View File

@ -11,8 +11,7 @@ import include.*;
/* 基于邻接表实现的无向图类 */
class GraphAdjList {
// 邻接表，使用哈希表来代替链表，以提升删除边、删除顶点的效率
// 请注意，adjList 中的元素是 Vertex 对象
// 邻接表，key: 顶点，value：该顶点的所有邻接结点
Map<Vertex, List<Vertex>> adjList;
/* 构造方法 */