Python关于拓扑排序知识点讲解

from collections import defaultdict 
 
class graph: 
 def __init__(self,vertices): 
  self.graph = defaultdict(list) 
  self.v = vertices
 
 def addedge(self,u,v): 
  self.graph[u].append(v) 
 
 def topologicalsortutil(self,v,visited,stack): 
 
  visited[v] = true
 
  for i in self.graph[v]: 
   if visited[i] == false: 
    self.topologicalsortutil(i,visited,stack) 
 
  stack.insert(0,v) 
 
 def topologicalsort(self): 
  visited = [false]*self.v 
  stack =[] 
 
  for i in range(self.v): 
   if visited[i] == false: 
    self.topologicalsortutil(i,visited,stack) 
 
  print (stack) 
 
g= graph(6) 
g.addedge(5, 2); 
g.addedge(5, 0); 
g.addedge(4, 0); 
g.addedge(4, 1); 
g.addedge(2, 3); 
g.addedge(3, 1); 
 
print ("拓扑排序结果：")
g.topologicalsort()

def toposort(graph):
 in_degrees = dict((u,0) for u in graph) #初始化所有顶点入度为0
 vertex_num = len(in_degrees)
 for u in graph:
  for v in graph[u]:
   in_degrees[v] += 1  #计算每个顶点的入度
 q = [u for u in in_degrees if in_degrees[u] == 0] # 筛选入度为0的顶点
 seq = []
 while q:
  u = q.pop()  #默认从最后一个删除
  seq.append(u)
  for v in graph[u]:
   in_degrees[v] -= 1  #移除其所有指向
   if in_degrees[v] == 0:
    q.append(v)   #再次筛选入度为0的顶点
 if len(seq) == vertex_num:  #如果循环结束后存在非0入度的顶点说明图中有环，不存在拓扑排序
  return seq
 else:
  print("there's a circle.")
g = {
 'a':'bce',
 'b':'d',
 'c':'d',
 'd':'',
 'e':'cd'
}
print(toposort(g))