Categories: None [Edit]
lazy_priority_queue
A priority queue which implements a lazy binomial heap. It supports the change priority operation, being suitable for algorithms like Dijkstra's shortest path and Prim's minimum spanning tree. It can be instantiated as a min-priority queue as well as a max-priority queue.
Total
Ranking: 5,012 of 193,649
Downloads: 1,591,843
Daily
Ranking: 7,958 of 193,618
Downloads: 258
Downloads Trends
Ranking Trends
Num of Versions Trends
Popular Versions (Major)
Popular Versions (Major.Minor)
Depended by
| Rank | Downloads | Name |
|---|---|---|
| 46,568 | 25,964 | map-reduce-ruby |
Owners
| # | Gravatar | Handle |
|---|---|---|
| 1 | matias |