proteus.StupidHeap module¶
A stupid implementation of a heap for fast marching methods
-
class
proteus.StupidHeap.
StupidHeap
[source]¶ Bases:
object
Min Heap
heap = [(key,val), …] such that heap[i][1] <= heap[2*i+1][1], heap[2*i+2][1] heapPos= {key:i} heap[heapPos[key]]=val
-
updateNode
(key, newval, debugLevel=0)[source]¶ modify value associated with key and restore heap property requires that key exist in heap
-
updateNodeWithMin
(key, newval, debugLevel=0)[source]¶ modify value associated with key and restore heap property requires that key exist in heap
this version only updates value if new value is less
-
upHeap
(pos, debugLevel=0)[source]¶ recursively move node at pos up the heap while it is less than its parent
-