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: 10,204 of 198,774
Downloads: 347,739
Daily
Ranking: 14,887 of 198,739
Downloads: 53
Downloads Trends
Ranking Trends
Num of Versions Trends
Popular Versions (Major)
Popular Versions (Major.Minor)
Depended by
| Rank | Downloads | Name |
|---|---|---|
| 11,788 | 254,127 | lrucache |
| 34,301 | 41,164 | qrpc |
| 66,834 | 16,528 | ruck |
| 81,106 | 12,381 | gamelan |
| 101,463 | 8,647 | calabash-extras |
| 120,279 | 6,287 | mendel |
| 127,914 | 5,507 | huffman |
| 128,861 | 5,427 | dijkstra_graph |
| 137,073 | 4,883 | unified-queues |
| 142,250 | 4,584 | maca-gamelan |
| 142,250 | 4,584 | maca-gamelan |
| 149,284 | 4,199 | jvoorhis-gamelan |
| 151,567 | 4,086 | wonderland |
Depends on
| Rank | Downloads | Name |
|---|
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | bschroed |