README
¶
Skeleton
A data structures and algorithms library written in Go.
Install
go get -u github.com/teleivo/skeleton
Examples
- frequency - word frequency counter using an ordered map based on a left-leaning red-black binary search tree. This problem does not need an ordered map, I just used it as an example of its API.
Disclaimer
I wrote this library for my personal projects. It is thus tailored to my needs. Feel free to use it! That being said, my intention is not to adjust it to someone elses liking.
Directories
¶
| Path | Synopsis |
|---|---|
|
examples
|
|
|
frequency
command
Frequency is a Go like version of https://algs4.cs.princeton.edu/31elementary/FrequencyCounter.java.html Try it with a data sample from https://introcs.cs.princeton.edu/java/data/ like dickens.txt
|
Frequency is a Go like version of https://algs4.cs.princeton.edu/31elementary/FrequencyCounter.java.html Try it with a data sample from https://introcs.cs.princeton.edu/java/data/ like dickens.txt |
|
Package order implements data structures that provide ordered operations like an ordered symbol table as described in the textbook Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.
|
Package order implements data structures that provide ordered operations like an ordered symbol table as described in the textbook Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne. |
Click to show internal directories.
Click to hide internal directories.