最短路算法dijkstra–最小生成树算法prim 其实非常像。
代码只有两个地方不一样。
dijkstra算法
from pythonds.graphs import PriorityQueue, Graph, Vertex
import sys
def dijkstra(G, start):
"""最短路dijkstra算法"""
# 先设置所有顶点的距离是无穷大
for v in G:
v.setDistance(sys.maxsize)
start.setDistance(0)
start.setPred(None)
pq = PriorityQueue()
pq.buildHeap([(v.getDistance(), v) for v in G])
while not pq.isEmpty():
currentVert = pq.delMin()
for nbr in currentVert.getConnections():
newCost = currentVert.getDistance() + currentVert.getWeight(nbr)
if newCost < nbr.getDistance():
nbr.setDistance(newCost)
nbr.setPred(currentVert)
pq.decreaseKey(nbr, newCost)
# 注意:buildHeap中第一个元素应该是用来排序的值。
# 创建图
g = Graph()
g.addEdge('u', 'x', cost=1)
g.addEdge('u', 'v', 2)
g.addEdge('u', 'w', 5)
g.addEdge('x', 'y', 1)
g.addEdge('x', 'v', 2)
g.addEdge('x', 'w', 3)
g.addEdge('v', 'x', 2)
g.addEdge('v', 'w', 3)
g.addEdge('w', 'z', 5)
g.addEdge('w', 'y', 1)
g.addEdge('y', 'z', 1)
g.addEdge('y', 'w', 1)
for v in g:
v.setDistance(sys.maxsize)
dijkstra(g, g.getVertex('u'))
print(g.getVertex('z').getPred())
prim算法
注意:书上的代码竟然是错误的!!下面这张图也是有错的!prim算法里的距离保存的不是起始点到其他节点的累计路径距离。而是不在生成树里的点和生成树顶点(是一个集合)的距离。
书上的prim算法代码是dijkstra算法一模一样。官网上的代码是对的,但是图也是错的。
from pythonds import Graph, Vertex
from pythonds.graphs import PriorityQueue
import sys
def prim(aGraph, start):
# 初始节点的距离和前驱
start.setPred(None)
start.setDistance(0)
pq = PriorityQueue()
pq.buildHeap([(v.getDistance(), v) for v in aGraph])
for v in aGraph:
v.setDistance(sys.maxsize)
while not pq.isEmpty():
currentVert = pq.delMin()
for nbr in currentVert.getConnections():
if nbr in pq:
newCost = currentVert.getWeight(nbr)
if newCost < nbr.getDistance():
nbr.setDistance(newCost)
nbr.setPred(currentVert)
pq.decreaseKey(nbr, newCost)
# 创建图
g = Graph()
g.addEdge('A', 'B', 2)
g.addEdge('B', 'A', 2)
g.addEdge('A', 'C', 3)
g.addEdge('C', 'A', 3)
g.addEdge('B', 'C', 1)
g.addEdge('C', 'B', 1)
g.addEdge('B', 'D', 1)
g.addEdge('D', 'B', 1)
g.addEdge('B', 'E', 4)
g.addEdge('E', 'B', 4)
g.addEdge('C', 'F', 5)
g.addEdge('F', 'C', 5)
g.addEdge('D', 'E', 1)
g.addEdge('E', 'D', 1)
g.addEdge('E', 'F', 1)
g.addEdge('F', 'E', 1)
g.addEdge('F', 'G', 1)
g.addEdge('G', 'F', 1)
prim(g, g.getVertex('A'))
print(g.getVertex('G').getPred())