python3dijkstra_python实现Dijkstra算法

#-*- coding: utf-8 -*-

"""Created on Fri Jul 07 11:33:19 2017

@author: linzr"""

## 表示无穷大

INF_val = 9999

classDijkstra_Path():def __init__(self, node_map):

self.node_map=node_map

self.node_length=len(node_map)

self.used_node_list=[]

self.collected_node_dict={}def __call__(self, from_node, to_node):

self.from_node=from_node

self.to_node=to_node

self._init_dijkstra()returnself._format_path()def_init_dijkstra(self):## Add from_node to used_node_list

self.used_node_list.append(self.from_node)for index1 inrange(self.node_length):

self.collected_node_dict[index1]= [INF_val, -1]

self.collected_node_dict[self.from_node]= [0, -1] #from_node don't have pre_node

for index1, weight_val inenumerate(self.node_map[self.from_node]):ifweight_val:

self.collected_node_dict[index1]= [weight_val, self.from_node] #[weight_val, pre_node]

self._foreach_dijkstra()def_foreach_dijkstra(self):while(len(self.used_node_list) < self.node_length - 1):

min_key= -1min_val=INF_valfor key, val in self.collected_node_dict.items(): #遍历已有权值节点

if val[0] < min_val and key not inself.used_node_list:

min_key=key

min_val=val[0]## 把最小的值加入到used_node_list

if min_key != -1:

self.used_node_list.append(min_key)for index1, weight_val inenumerate(self.node_map[min_key]):## 对刚加入到used_node_list中的节点的相邻点进行遍历比较

if weight_val > 0 and self.collected_node_dict[index1][0] > weight_val +min_val:

self.collected_node_dict[index1][0]= weight_val + min_val #update weight_val

self.collected_node_dict[index1][1] =min_keydef_format_path(self):

node_list=[]

temp_node=self.to_node

node_list.append((temp_node, self.collected_node_dict[temp_node][0]))while self.collected_node_dict[temp_node][1] != -1:

temp_node= self.collected_node_dict[temp_node][1]

node_list.append((temp_node, self.collected_node_dict[temp_node][0]))

node_list.reverse()returnnode_listdefset_node_map(node_map, node, node_list):for x, y, val innode_list:

node_map[node.index(x)][node.index(y)]= node_map[node.index(y)][node.index(x)] =valif __name__ == "__main__":

node= ['A', 'B', 'C', 'D', 'E', 'F', 'G']

node_list= [('A', 'F', 9), ('A', 'B', 10), ('A', 'G', 15), ('B', 'F', 2),

('G', 'F', 3), ('G', 'E', 12), ('G', 'C', 10), ('C', 'E', 1),

('E', 'D', 7)]## init node_map to 0

node_map = [[0 for val in xrange(len(node))] for val inxrange(len(node))]## set node_map

set_node_map(node_map, node, node_list)## select one node to obj node, e.g. A --> D(node[0] --> node[3])

from_node = node.index('A')

to_node= node.index('E')

dijkstrapath=Dijkstra_Path(node_map)

path=dijkstrapath(from_node, to_node)print path