The highest tagged major version is
README
¶
go-qulia
Go data structures, helpers library
Directories
¶
| Path | Synopsis |
|---|---|
|
concurrency
|
|
|
graph
Package graph provides graph implementation Interface methods GetNodes, Add, AddBidirectional are the ways to interact with graph data structure.
|
Package graph provides graph implementation Interface methods GetNodes, Add, AddBidirectional are the ways to interact with graph data structure. |
|
heap
Package heap provides easy to use MinHeap and MaxHeap implementations https://en.wikipedia.org/wiki/Heap_(data_structure) Interface methods Insert, Extract, IsEmpty, Size are the ways to interact with heap data structure.
|
Package heap provides easy to use MinHeap and MaxHeap implementations https://en.wikipedia.org/wiki/Heap_(data_structure) Interface methods Insert, Extract, IsEmpty, Size are the ways to interact with heap data structure. |
|
queue
Package queue provides implementation for Queue data structure https://en.wikipedia.org/wiki/Queue_(abstract_data_type) Interface methods Enqueue,Dequeue, IsEmpty, Length are the ways to interact with queue data structure.
|
Package queue provides implementation for Queue data structure https://en.wikipedia.org/wiki/Queue_(abstract_data_type) Interface methods Enqueue,Dequeue, IsEmpty, Length are the ways to interact with queue data structure. |
|
stack
Package stack provides implementation for Stack data structure https://simple.wikipedia.org/wiki/Stack_(data_structure) Interface methods Push,Pop, Peek,IsEmpty,Size are the ways to interact with stack data structure.
|
Package stack provides implementation for Stack data structure https://simple.wikipedia.org/wiki/Stack_(data_structure) Interface methods Push,Pop, Peek,IsEmpty,Size are the ways to interact with stack data structure. |
Click to show internal directories.
Click to hide internal directories.