Update code style for Python

codes/python/chapter_graph/graph_adjacency_list.py

@@ -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]]