狄克斯特拉算法

寻找起点到终点的最近路 1、需要准备三个散列 ## 节点 graph = {} graph['start'] = {} graph['start']['a'] = 6 graph['start']['b'] = 2 graph['a'] = {} graph['a']['fin'] = 1 graph['b'] = {} graph['b']['a'] = 3 graph['b']['fin']

>>阅读原文<<