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.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
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.