summaryrefslogtreecommitdiff
path: root/cross
diff options
context:
space:
mode:
authorminskim <minskim>2006-05-03 05:17:48 +0000
committerminskim <minskim>2006-05-03 05:17:48 +0000
commit32e2fa101163393a464f60bf372026782ba8ed19 (patch)
tree3f282d42395bf6910da3b3c33cb6872117243949 /cross
parentd3e1f30f2f3b068589bee4d3fc5cbadb17dadb95 (diff)
downloadpkgsrc-32e2fa101163393a464f60bf372026782ba8ed19.tar.gz
Import ruby-priority-queue.
This is a fibonacci-heap priority-queue implementation. This project is different from K. Kodamas PQueue in that it allows a decrease key operation. That makes PriorityQueue usable for algorithms like dijkstras shortest path algorithm, while PQueue is more suitable for Heapsort and the like.
Diffstat (limited to 'cross')
0 files changed, 0 insertions, 0 deletions