README
¶
go-tryalgo
Basic and (maybe) advanced algorithms and data structures.
Inspired from @jilljenn's tryalgo in Python.
License
MIT
Directories
¶
| Path | Synopsis |
|---|---|
|
Package arithm contains arithmetic functions.
|
Package arithm contains arithmetic functions. |
|
exptarget
Package exptarget provides a function to build an arithmetic expression to reach a target.
|
Package exptarget provides a function to build an arithmetic expression to reach a target. |
|
container
|
|
|
bintree
Package bintree implement binary trees.
|
Package bintree implement binary trees. |
|
heap
Package heap implements a priority queue.
|
Package heap implements a priority queue. |
|
unionfind
Package unionfind provides structures to handle disjoint sets.
|
Package unionfind provides structures to handle disjoint sets. |
|
Package graph provides functions to handle graphs.
|
Package graph provides functions to handle graphs. |
|
Package rope implements efficient []byte slicing and merging operations.
|
Package rope implements efficient []byte slicing and merging operations. |
|
Package sort implements various sorting algorithms.
|
Package sort implements various sorting algorithms. |
|
Package trie implements a radix/prefix tree.
|
Package trie implements a radix/prefix tree. |
Click to show internal directories.
Click to hide internal directories.