i
: S r SSKJr SS jrS r " S S\5 rg) zM
altgraph.GraphAlgo - Graph algorithms
=====================================
)
GraphErrorNc < 0 n0 n[ 5 nSXQ' U H nXV X6' Xb:X a X44$ U R U5 H[ nU R Xg5 nX6 U R U5 - n Xs; a XU : a [ S5 eMD Xu; d
XU : d MS XU' XdU' M] M X44$ )a
Dijkstra's algorithm for shortest paths
`David Eppstein, UC Irvine, 4 April 2002
`_
`Python Cookbook Recipe
`_
Find shortest paths from the start node to all nodes nearer than or
equal to the end node.
Dijkstra's algorithm is only guaranteed to work correctly when all edge
lengths are positive. This code does not verify this property for all
edges (only the edges examined until the end vertex is reached), but will
correctly compute shortest paths even for some graphs with negative edges,
and will raise an exception if it discovers that a negative edge has
caused it to make a mistake.
Adapted to altgraph by Istvan Albert, Pennsylvania State University -
June, 9 2004
r z3Dijkstra: found better path to already-final vertex)_priorityDictionaryout_nbrs edge_by_node edge_datar )
graphstartendDPQvwedge_idvwLengths
?C:\des-py\RoboSAPF\venv\Lib\site-packages\altgraph/GraphAlgo.pydijkstrar s . A
A AAH
t 8
6M "A((.Gteoog 66Hvd?$M # xA$ !! # "
6M c [ XU5 u p4/ n UR U5 X!:X a OXB nM UR 5 U$ )a
Find a single shortest path from the *start* node to the *end* node.
The input has the same conventions as dijkstra(). The output is a list of
the nodes in order along the shortest path.
**Note that the distances must be stored in the edge data as numeric data**
)r appendreverse)r r
r r r
Paths r
shortest_pathr 8 sJ E# &DA
D
C < f
LLN Kr c 6 \ rS rSrSrS rS rS rS rS r Sr
g )
r O a
Priority dictionary using binary heaps (internal use only)
David Eppstein, UC Irvine, 8 Mar 2002
Implements a data structure that acts almost like a dictionary, with
two modifications:
1. D.smallest() returns the value x minimizing D[x]. For this to
work correctly, all values D[x] stored in the dictionary must be
comparable.
2. iterating "for x in D" finds and removes the items from D in sorted
order. Each item is not removed until the next item is requested,
so D[x] will still return a useful value until the next iteration
of the for-loop. Each operation takes logarithmic amortized time.
c < / U l [ R U 5 g)z
Initialize priorityDictionary by creating binary heap of pairs
(value,key). Note that changing or removing a dict entry will not
remove the old pair from the heap until it is found by smallest()
or until the heap is rebuilt.
N)_priorityDictionary__heapdict__init__)selfs r r _priorityDictionary.__init__b s
dr c [ U 5 S:X a [ S5 eU R nUS S U ; d XS S US S :w a UR 5 nSn SU- S- nUS- [ U5 : a X XS- : a US-
nU[ U5 : d X!U :: a X!U' O
X X' UnMR US S U ; a Ms XS S US S :w a M US S $ )zE
Find smallest item after removing deleted items from front of heap.
r z$smallest of empty priorityDictionary )len
IndexErrorr pop)r! heaplastIteminsertionPoint
smallChilds r smallest _priorityDictionary.smallestl s
t9> CD D{{1gaj$!WQZ(8DGAJ(FxxzH N /! 3
NSY. (4Q+?? !OJ T*hz:J.J+3 ('+'7$!+ 1gaj$!WQZ(8DGAJ(F Awqzr c ^ U 4S jnU" 5 $ )z;
Create destructive sorted iterator of priorityDictionary.
c 3 ~ ># [ T5 S: a) TR 5 n U v TU [ T5 S: a M( g g 7f)Nr )r& r- )xr! s r iterfn,_priorityDictionary.__iter__..iterfn s5 d)a-MMOG d)a-s 6== )r! r2 s ` r __iter__ _priorityDictionary.__iter__ s
xr c [ R XU5 U R n[ U5 S[ U 5 - : aF U R 5 VVs/ s H u pEXT4PM
snnU l U R R 5 gX!4n[ U5 nUR
S5 US: a8 XcUS-
S- : a* X7S-
S- X7' US-
S- nUS: a XcUS-
S- : a M* XcU' gs snnf )z
Change value stored in dictionary and add corresponding pair to heap.
Rebuilds the heap if the number of deleted items gets large, to avoid
memory leakage.
r% Nr r$ )r __setitem__r r& itemssortr )r! keyvalr) kr newPairr+ s r r8 _priorityDictionary.__setitem__ s
C({{ t9q3t9} $.2jjl;ldaA6l;DK KK jG YN KK 1$ !9KPQ8Q3R)R'+a-?A,E'F$"01"4!: !1$ !9KPQ8Q3R)R $+ rK s( -`.\$ \r