Implementations of common algorithms and data structures in Go.
These implementations are for educational purposes only and are probably not suitable for production use.
- Circular queue
- Binary tree (with Day-Stout-West balancing algorithm)
- Binary heap
- Path finding
- Breadth-first
- Greedy breadth-first
- Djikstra
- A*