python图的应用

一 图的结构

 

 

二 代码

1. def searchGraph(graph,start,end):
2. results =[]
3. generatePath(graph,[start],end,results)
4. results.sort(key =lambda x:len(x))
5. return results
6. def generatePath(graph,path,end,results):
7. state = path[-1]
8. if state == end:
9. results.append(path)
10. else:
11. for arc in graph[state]:
12. if arc notin path:
13. generatePath(graph,path +[arc],end ,results)
15. if __name__ =='__main__':
16. Graph={'A':['B','C','D'],
17. 'B':['E'],
18. 'C':['D','F'],
19. 'D':['B','E','G'],
20. 'E':[],
21. 'F':['D','G'],
22. 'G':['E']}
23. r = searchGraph(Graph,'A','E')
24. print("******************")
25. print(' path A to E')
26. print("******************")
27. for i in r:
28. print(i)

 

三运行结果

******************

  path A to E

******************

['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']