def dijkstra(graph,from_node,to_node): q,seen = [(0,[])],set() while q: cost,node,path = heappop(q) seen.add(node) path = path+[node] if node == to_node: return cost,path for adj_node,c in graph.get(node,{}).items(): if adj_node not in seen: heappush(q,(cost+c,adj_node,path)) return -1,[] air_lines = {"1":{"2":2000,"3":2000,"4":4000,"5": 4500},"2":{"5": 1000},"3":{"4": 1000},"4":{"5": 500}} print(dijkstra(air_lines,"1","4")) print(dijkstra(air_lines,"5")) print(dijkstra(air_lines,"4","5","1")) print(dijkstra(air_lines,"10","10")) """ (3000,[‘1‘,‘3‘,‘4‘]) (3000,‘2‘,‘5‘]) (500,[‘4‘,‘5‘]) (-1,[]) (0,[‘1‘]) (0,[‘10‘]) """
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。