It is implemented as binary heap. It can contain "unlimited" number of items.
- Dialect: ANSI C
- Compiler: any ANSI C-compatible
- Copyright (c) 2014 Martin Váňa
Use make to compile it and than run app using ./pq_example.
-
Notifications
You must be signed in to change notification settings - Fork 3
It is implemented as binary heap. It can contain "unlimited" number of items.
License
vanam/ANSI-C-Priority-Queue
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
It is implemented as binary heap. It can contain "unlimited" number of items.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published