priority-queue-rs
Priority Queue is more specialized data structure than Queue. Like ordinary queue, priority queue has same method but with a major difference. In Priority queue items are ordered by key value so that item with the lowest value of key is at front and item with the highest value of key is at rear or vice versa. So we're assigned priority to item based on its key value. Lower the value, higher the priority. Following are the principal methods of a Priority Queue.
Ecosystem
crates.io
crates.io
Latest Release
almost 5 years ago
0.1.26
almost 5 years ago
Versions
24
24
Downloads
28,510 total
28,510 total
Loading...
Readme
Loading...
Links
| Registry | crates.io |
| Source | Repository |
| Docs | Documentation |
| JSON API | View JSON |
| CodeMeta | codemeta.json |
Package Details
| PURL |
pkg:cargo/priority-queue-rs
spec |
| License | MIT |
| First Release | almost 5 years ago |
| Last Synced | 4 days ago |
Repository
| Stars | 0 on GitHub |
| Forks | 0 on GitHub |