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

Update code style for Python

Browse Source
This commit is contained in:
krahets
2023-03-03 03:07:22 +08:00
parent 7e9e6b000c
commit 7c501140f0
45 changed files with 274 additions and 266 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
codes/python/chapter_graph/graph_adjacency_list.py
View File

@ -6,16 +6,15 @@ Author: Krahets (krahets@163.com)
import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from include import *
from modules import *
""" 基于邻接表实现的无向图类 """
class GraphAdjList:
""" 基于邻接表实现的无向图类 """
# 邻接表，key: 顶点，value：该顶点的所有邻接顶点
adj_list = {}
""" 构造方法 """
def __init__(self, edges: List[List[Vertex]]) -> None:
""" 构造方法 """
self.adj_list = {}
# 添加所有顶点和边
for edge in edges:
@ -23,35 +22,35 @@ class GraphAdjList:
self.add_vertex(edge[1])
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
self.adj_list[vet1].append(vet2)
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
self.adj_list[vet1].remove(vet2)
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 对应的链表
@ -61,8 +60,8 @@ class GraphAdjList:
if vet in self.adj_list[vertex]:
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]]

24
codes/python/chapter_graph/graph_adjacency_matrix.py
View File

@ -6,18 +6,17 @@ Author: Krahets (krahets@163.com)
import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from include import *
from modules import *
""" 基于邻接矩阵实现的无向图类 """
class GraphAdjMat:
""" 基于邻接矩阵实现的无向图类 """
# 顶点列表，元素代表“顶点值”，索引代表“顶点索引”
vertices = []
# 邻接矩阵，行列索引对应“顶点索引”
adj_mat = []
""" 构造方法 """
def __init__(self, vertices, edges):
""" 构造方法 """
self.vertices = []
self.adj_mat = []
# 添加顶点
@ -28,12 +27,12 @@ class GraphAdjMat:
for e in edges:
self.add_edge(e[0], e[1])
""" 获取顶点数量 """
def size(self):
""" 获取顶点数量 """
return len(self.vertices)
""" 添加顶点 """
def add_vertex(self, val):
""" 添加顶点 """
n = self.size()
# 向顶点列表中添加新顶点的值
self.vertices.append(val)
@ -44,9 +43,8 @@ class GraphAdjMat:
for row in self.adj_mat:
row.append(0)
""" 删除顶点 """
def remove_vertex(self, index):
""" 删除顶点 """
if index >= self.size():
raise IndexError()
# 在顶点列表中移除索引 index 的顶点
@ -57,9 +55,9 @@ class GraphAdjMat:
for row in self.adj_mat:
row.pop(index)
""" 添加边 """
# 参数 i, j 对应 vertices 元素索引
def add_edge(self, i, j):
""" 添加边 """
# 参数 i, j 对应 vertices 元素索引
# 索引越界与相等处理
if i < 0 or j < 0 or i >= self.size() or j >= self.size() or i == j:
raise IndexError()
@ -67,17 +65,17 @@ class GraphAdjMat:
self.adj_mat[i][j] = 1
self.adj_mat[j][i] = 1
""" 删除边 """
# 参数 i, j 对应 vertices 元素索引
def remove_edge(self, i, j):
""" 删除边 """
# 参数 i, j 对应 vertices 元素索引
# 索引越界与相等处理
if i < 0 or j < 0 or i >= self.size() or j >= self.size() or i == j:
raise IndexError()
self.adj_mat[i][j] = 0
self.adj_mat[j][i] = 0
""" 打印邻接矩阵 """
def print(self):
""" 打印邻接矩阵 """
print("顶点列表 =", self.vertices)
print("邻接矩阵 =")
print_matrix(self.adj_mat)

9
codes/python/chapter_graph/graph_bfs.py
View File

@ -6,12 +6,12 @@ Author: Krahets (krahets@163.com)
import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from include import *
from modules import *
from graph_adjacency_list import GraphAdjList
""" 广度优先遍历 BFS """
# 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
def graph_bfs(graph: GraphAdjList, start_vet: Vertex) -> List[Vertex]:
""" 广度优先遍历 BFS """
# 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
# 顶点遍历序列
res = []
# 哈希表，用于记录已被访问过的顶点
@ -32,6 +32,7 @@ def graph_bfs(graph: GraphAdjList, start_vet: Vertex) -> List[Vertex]:
return res
""" Driver Code """
if __name__ == "__main__":
"""初始化无向图"""
v = vals_to_vets([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
@ -45,4 +46,4 @@ if __name__ == "__main__":
"""广度优先遍历 BFS"""
res = graph_bfs(graph, v[0])
print("\n广度优先遍历（BFS）顶点序列为")
print(vets_to_vals(res))
print(vets_to_vals(res))

7
codes/python/chapter_graph/graph_dfs.py
View File

@ -6,12 +6,11 @@ Author: Krahets (krahets@163.com)
import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.abspath(__file__))))
from include import *
from modules import *
from graph_adjacency_list import GraphAdjList
""" 深度优先遍历 DFS 辅助函数 """
def dfs(graph: GraphAdjList, visited: Set[Vertex], res: List[Vertex], vet: Vertex):
""" 深度优先遍历 DFS 辅助函数 """
res.append(vet) # 记录访问顶点
visited.add(vet) # 标记该顶点已被访问
# 遍历该顶点的所有邻接顶点
@ -21,9 +20,9 @@ def dfs(graph: GraphAdjList, visited: Set[Vertex], res: List[Vertex], vet: Verte
# 递归访问邻接顶点
dfs(graph, visited, res, adjVet)
""" 深度优先遍历 DFS """
# 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
def graph_dfs(graph: GraphAdjList, start_vet: Vertex) -> List[Vertex]:
""" 深度优先遍历 DFS """
# 顶点遍历序列
res = []
# 哈希表，用于记录已被访问过的顶点