用python找图_python – 在大图中有效找到最短路径

python-graph

添加：

评论让我很好奇,pypi的表现如何在OP的顺序上出现问题,所以我做了一个玩具程序来找出来.以下是该问题略小版本的输出：

$python2.6 biggraph.py 4 6

biggraph generate 10000 nodes 00:00:00

biggraph generate 1000000 edges 00:00:00

biggraph add edges 00:00:05

biggraph Dijkstra 00:01:32

biggraph shortest_path done 00:04:15

step: 1915 2

step: 0 1

biggraph walk done 00:04:15

path: [9999, 1915, 0]

对于10k个节点和1M个边缘来说,这不是太糟糕.重要的是要注意,Dijkstra通过pygraph计算的方式为每个节点相对于一个目标(这是任意的节点0,并且在图中没有特权位置)产生一个所有生成树的字典.因此,实际计算3.75分钟的解决方案产生了“从所有节点到目标的最短路径是什么”的答案.事实上,一旦最短路径完成,走路的答案只是字典查找,基本上没有时间.还值得注意的是,在约1.5分钟内将预先计算的边添加到图表中是相当昂贵的.这些时间在多个运行中是一致的.

我想说,这个过程很好,但是我仍然在等待五分之一的电脑(Athlon 64,4800 BogoMIPS每个处理器,全部是核心),它已经运行了四分之一个小时.至少内存使用稳定在0.5GB左右.结果是：

biggraph generate 100000 nodes 00:00:00

biggraph generate 1000000 edges 00:00:00

biggraph add edges 00:00:07

biggraph Dijkstra 00:01:27

biggraph shortest_path done 00:23:44

step: 48437 4

step: 66200 3

step: 83824 2

step: 0 1

biggraph walk done 00:23:44

path: [99999, 48437, 66200, 83824, 0]

那是很长的时间,但也是一个沉重的计算(我真的希望我会腌制的结果).这是好奇的代码：

#!/usr/bin/python

import pygraph.classes.graph

import pygraph.algorithms

import pygraph.algorithms.minmax

import time

import random

import sys

if len(sys.argv) != 3:

print ('usage %s: node_exponent edge_exponent' % sys.argv[0])

sys.exit(1)

nnodes = 10**int(sys.argv[1])

nedges = 10**int(sys.argv[2])

start_time = time.clock()

def timestamp(s):

t = time.gmtime(time.clock() - start_time)

print 'biggraph', s.ljust(24), time.strftime('%H:%M:%S', t)

timestamp('generate %d nodes' % nnodes)

bg = pygraph.classes.graph.graph()

bg.add_nodes(xrange(nnodes))

timestamp('generate %d edges' % nedges)

edges = set()

while len(edges) < nedges:

left, right = random.randrange(nnodes), random.randrange(nnodes)

if left == right:

continue

elif left > right:

left, right = right, left

edges.add((left, right))

timestamp('add edges')

for edge in edges:

bg.add_edge(edge)

timestamp("Dijkstra")

target = 0

span, dist = pygraph.algorithms.minmax.shortest_path(bg, target)

timestamp('shortest_path done')

# the paths from any node to target is in dict span, let's

# pick any arbitrary node (the last one) and walk to the

# target from there, the associated distance will decrease

# monotonically

lastnode = nnodes - 1

path = []

while lastnode != target:

nextnode = span[lastnode]

print 'step:', nextnode, dist[lastnode]

assert nextnode in bg.neighbors(lastnode)

path.append(lastnode)

lastnode = nextnode

path.append(target)

timestamp('walk done')

print 'path:', path