Categories: None [Edit]
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: 8,507 of 180,518
Downloads: 293,779
Daily
Ranking: 22,826 of 180,507
Downloads: 10
Downloads Trends
Ranking Trends
Num of Versions Trends
Popular Versions (Major)
Popular Versions (Major.Minor)
Depended by
Rank | Downloads | Name |
---|---|---|
10,219 | 211,252 | lrucache |
31,156 | 35,571 | qrpc |
61,720 | 14,427 | ruck |
76,436 | 10,580 | gamelan |
98,193 | 7,115 | calabash-extras |
114,502 | 5,289 | mendel |
118,461 | 4,910 | huffman |
128,354 | 4,221 | dijkstra_graph |
132,223 | 4,027 | unified-queues |
142,550 | 3,522 | maca-gamelan |
142,550 | 3,522 | maca-gamelan |
147,245 | 3,334 | jvoorhis-gamelan |
148,040 | 3,307 | wonderland |
Depends on
Rank | Downloads | Name |
---|
Owners
# | Gravatar | Handle |
---|---|---|
1 | bschroed |