Heap Map (also known as a Priority Map) is a data structure that has both Heap (Priority Queue) and Map functionality. This is a simple and lightweight implementation of HeapMap in Go.
For examples, take a look at here.
-
Notifications
You must be signed in to change notification settings - Fork 0
HeapMap/PriorityMap in Go
License
nemars/heapmap
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
HeapMap/PriorityMap in Go
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published