lazy_priority_queue

rubygemsv0.1.1

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.

License FreeBSD3 versions0 deps1,578,731 weekly dl
matiasbattocchia/lazy_priority_queue
45
/ 100
Health
safe to use

[email protected] is safe to use (health: 45/100)

Health breakdown0 – 100
0/25
maintenance
17/20
popularity
25/25
security
3/15
maturity
0/15
community
Vulnerabilities
0
none known

Health History

Dependency Tree

License Audit

API access

Get this data programmatically — free, no authentication.

curl https://depscope.dev/api/check/rubygems/lazy_priority_queue

Last updated · 2016-04-06T04:53:14.681Z

lazy_priority_queue — Health Score 45/100 | DepScope