xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-02 10:34:35 +00:00
Code Issues Packages Projects Releases Wiki Activity

Format python codes with black. (#453)

Browse Source
This commit is contained in:
Yudong Jin
2023-04-09 05:05:35 +08:00
committed by GitHub
parent 1c8b7ef559
commit 5ddcb60825
45 changed files with 656 additions and 456 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/python/chapter_graph/graph_adjacency_list.py
+24 -15
View File
@@ -5,13 +5,16 @@ Author: Krahets (krahets@163.com)
"""
import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from modules import *
class GraphAdjList:
""" 基于邻接表实现的无向图类 """
"""基于邻接表实现的无向图类"""
def __init__(self, edges: list[list[Vertex]]) -> None:
""" 构造方法 """
"""构造方法"""
# 邻接表，key: 顶点，value：该顶点的所有邻接顶点
self.adj_list = dict[Vertex, Vertex]()
# 添加所有顶点和边
@@ -21,11 +24,11 @@ class GraphAdjList:
self.add_edge(edge[0], edge[1])
def size(self) -> int:
""" 获取顶点数量 """
"""获取顶点数量"""
return len(self.adj_list)
def add_edge(self, vet1: Vertex, vet2: Vertex) -> None:
""" 添加边 """
"""添加边"""
if vet1 not in self.adj_list or vet2 not in self.adj_list or vet1 == vet2:
raise ValueError
# 添加边 vet1 - vet2
@@ -33,7 +36,7 @@ class GraphAdjList:
self.adj_list[vet2].append(vet1)
def remove_edge(self, vet1: Vertex, vet2: Vertex) -> None:
""" 删除边 """
"""删除边"""
if vet1 not in self.adj_list or vet2 not in self.adj_list or vet1 == vet2:
raise ValueError
# 删除边 vet1 - vet2
@@ -41,14 +44,14 @@ class GraphAdjList:
self.adj_list[vet2].remove(vet1)
def add_vertex(self, vet: Vertex) -> None:
""" 添加顶点 """
"""添加顶点"""
if vet in self.adj_list:
return
# 在邻接表中添加一个新链表
self.adj_list[vet] = []
def remove_vertex(self, vet: Vertex) -> None:
""" 删除顶点 """
"""删除顶点"""
if vet not in self.adj_list:
raise ValueError
# 在邻接表中删除顶点 vet 对应的链表
@@ -59,7 +62,7 @@ class GraphAdjList:
self.adj_list[vertex].remove(vet)
def print(self) -> None:
""" 打印邻接表 """
"""打印邻接表"""
print("邻接表 =")
for vertex in self.adj_list:
tmp = [v.val for v in self.adj_list[vertex]]
@@ -68,33 +71,39 @@ class GraphAdjList:
""" Driver Code """
if __name__ == "__main__":
""" 初始化无向图 """
# 初始化无向图
v = vals_to_vets([1, 3, 2, 5, 4])
edges = [[v[0], v[1]], [v[0], v[3]], [v[1], v[2]],
[v[2], v[3]], [v[2], v[4]], [v[3], v[4]]]
edges = [
[v[0], v[1]],
[v[0], v[3]],
[v[1], v[2]],
[v[2], v[3]],
[v[2], v[4]],
[v[3], v[4]],
]
graph = GraphAdjList(edges)
print("\n初始化后，图为")
graph.print()
""" 添加边 """
# 添加边
# 顶点 1, 2 即 v[0], v[2]
graph.add_edge(v[0], v[2])
print("\n添加边 1-2 后，图为")
graph.print()
""" 删除边 """
# 删除边
# 顶点 1, 3 即 v[0], v[1]
graph.remove_edge(v[0], v[1])
print("\n删除边 1-3 后，图为")
graph.print()
""" 添加顶点 """
# 添加顶点
v5 = Vertex(6)
graph.add_vertex(v5)
print("\n添加顶点 6 后，图为")
graph.print()
""" 删除顶点 """
# 删除顶点
# 顶点 3 即 v[1]
graph.remove_vertex(v[1])
print("\n删除顶点 3 后，图为")