题目描述
给你一个有 n 个节点的 有向带权 图,节点编号为 0 到 n - 1 。图中的初始边用数组 edges 表示,其中 edges[i] = [fromi, toi, edgeCosti] 表示从 fromi 到 toi 有一条代价为 edgeCosti 的边。
请你实现一个 Graph 类:
Graph(int n, int[][] edges) 初始化图有 n 个节点,并输入初始边。
addEdge(int[] edge) 向边集中添加一条边,其中 edge = [from, to, edgeCost] 。数据保证添加这条边之前对应的两个节点之间没有有向边。
int shortestPath(int node1, int node2) 返回从节点 node1 到 node2 的路径 最小 代价。如果路径不存在,返回 -1 。一条路径的代价是路径中所有边代价之和。
示例 1:
输入:
[“Graph”, “shortestPath”, “shortestPath”, “addEdge”, “shortestPath”]
[[4, [[0, 2, 5], [0, 1, 2], [1, 2, 1], [3, 0, 3]]], [3, 2], [0, 3], [[1, 3, 4]], [0, 3]]
输出:
[null, 6, -1, null, 6]
代码
普通dijkstra
class Graph:
def __init__(self, n: int, edges: List[List[int]]):
self.adj_hash = {}
self.n = n
for i in range(n): self.adj_hash[i] = {}
for edge in edges: self.addEdge(edge)
def addEdge(self, edge: List[int]) -> None:
self.adj_hash[edge[0]][edge[1]] = edge[2]
def shortestPath(self, node1: int, node2: int) -> int:
dis_map = {node1: 0}
visited_map = {}
while(True):
min_dis = float('inf')
min_node = -1
for node,dis in dis_map.items():
if(node in visited_map): continue
if(dis < min_dis):
min_dis = dis
min_node = node
visited_map[min_node] = True
if(min_node == node2): return dis_map[min_node]
if(min_node == -1): return -1
for adj_node,cost in self.adj_hash[min_node].items():
if(adj_node in visited_map): continue
if(adj_node not in dis_map): dis_map[adj_node] = float('inf')
dis_map[adj_node] = min(dis_map[adj_node],cost+dis_map[min_node])
堆优化的dijkstra:
class Graph:
def __init__(self, n: int, edges: List[List[int]]):
self.adj_hash = {}
self.n = n
for i in range(n): self.adj_hash[i] = {}
for edge in edges: self.addEdge(edge)
def addEdge(self, edge: List[int]) -> None:
self.adj_hash[edge[0]][edge[1]] = edge[2]
def shortestPath(self, node1: int, node2: int) -> int:
# dijkstra + 堆优化
dis_map = {node1:0}
q = []
heapq.heappush(q,(0,node1))
visited_map = {}
while(True):
#print(q)
if(not q): return -1
min_dis,min_node = heapq.heappop(q)
if(min_node in visited_map): continue
visited_map[min_node] = True
if(min_node == node2): return dis_map[min_node]
for adj_node,cost in self.adj_hash[min_node].items():
if(adj_node in visited_map): continue
if(adj_node not in dis_map): dis_map[adj_node] = float('inf')
if(cost+min_dis < dis_map[adj_node]):
dis_map[adj_node] = cost+min_dis
heapq.heappush(q,(cost+min_dis,adj_node))