Categories: None [Edit]

PriorityQueue

https://rubygems.org/gems/PriorityQueue
This is a fibonacci-heap priority-queue implementation. That means insert: O(1) decrease_priority: Amortized O(1) delete_min: Amortized O(log n) 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.

Total

Ranking: 10,204 of 198,774
Downloads: 347,739

Daily

Ranking: 14,887 of 198,739
Downloads: 53

Depended by

RankDownloadsName
11,788254,127lrucache
34,30141,164qrpc
66,83416,528ruck
81,10612,381gamelan
101,4638,647calabash-extras
120,2796,287mendel
127,9145,507huffman
128,8615,427dijkstra_graph
137,0734,883unified-queues
142,2504,584maca-gamelan
142,2504,584maca-gamelan
149,2844,199jvoorhis-gamelan
151,5674,086wonderland

Depends on

RankDownloadsName

Owners

#GravatarHandle
1iconbschroed