Python_自定义有向图

directedGraph.py

 class DirectedGraph(object):
     def __init__(self,d):
         if isinstance(d,dict):
             self.__graph = d
         else:
             self.__graph = dict()
             print('Sth error')

     def __generatePath(self,graph,path,end,results):
         curret = path[-1]
         if curret == end:
             results.append(path)
         else:
             for n in graph[curret]:
                 if n not in path:
                     self.__generatePath(graph,path+[n],end,results)

     def searchPath(self,start,end):
         self.__results = []
         self.__generatePath(self.__graph,[start],end,self.__results)
         self.__results.sort(key=lambda  x:len(x))   #按所有路径的长度进行排序
         print('The path from ',self.__results[0][0],'to',self.__results[0][-1],'is:')
         for path in self.__results:
             print(path)
 d={'A':['B','C','D'],
     'B':['E'],
     'C':['D','F'],
     'D':['B','E','G'],
     'E':['D'],
     'F':['D','G'],
     'G':['E']}
 g=DirectedGraph(d)
 g.searchPath('A','D')
 g.searchPath('A','E')

 '''输出结果
 The path from  A to D is:
 ['A', 'D']
 ['A', 'C', 'D']
 ['A', 'B', 'E', 'D']
 ['A', 'C', 'F', 'D']
 ['A', 'C', 'F', 'G', 'E', 'D']
 The path from  A to E is:
 ['A', 'B', 'E']
 ['A', 'D', 'E']
 ['A', 'C', 'D', 'E']
 ['A', 'D', 'B', 'E']
 ['A', 'D', 'G', 'E']
 ['A', 'C', 'D', 'B', 'E']
 ['A', 'C', 'D', 'G', 'E']
 ['A', 'C', 'F', 'D', 'E']
 ['A', 'C', 'F', 'G', 'E']
 ['A', 'C', 'F', 'D', 'B', 'E']
 ['A', 'C', 'F', 'D', 'G', 'E']
 '''