【python】最短路径问题.zip

# 找到一条从start到end的路径 def findPath(graph,start,end,path=[]): path = path + [start] if start == end: return path for node in graph[start]: if node not in path: newpath = findPath(graph,node,end,path) if newpath: return newpath return None # 找到所有从start到end的路径 def findAllPath(graph,start,end,path=[]): path = path +[start] if start == end: return [path] paths = [] #存储所有路径 for node in graph[start]: if node not in path: newpaths = findAllPath(graph,node,end,path) for newpath in newpaths: paths.append(newpath) return paths # 查找最短路径 def findShortestPath(graph,start,end,path=[]): path = path +[start] if start == end: return path shortestPath = [] for node in graph[start]: if node not in path: newpath = findShortestPath(graph,node,end,path) if newpath: if not shortestPath or len(newpath)<len(shortestPath): shortestPath = newpath return shortestPath