Archives/awesome-go
2
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Merge pull request #969 from agnivade/master

Browse Source 
Added levenshtein to Data Structures
This commit is contained in:
Kirill Danshin 2016-07-17 13:36:11 +03:00 committed by GitHub
commit 2bbbdf5372
1 changed files with 1 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
README.md
View File

@ -214,6 +214,7 @@ Please take a quick gander at the [contribution guidelines](https://github.com/a
* [gods](https://github.com/emirpasic/gods) - Go Data Structures. Containers, Sets, Lists, Stacks, Maps, BidiMaps, Trees, HashSet etc.
* [golang-set](https://github.com/deckarep/golang-set) - Thread-Safe and Non-Thread-Safe high-performance sets for Go.
* [goskiplist](https://github.com/ryszard/goskiplist) - A skip list implementation in Go.
* [levenshtein](https://github.com/agnivade/levenshtein) - Implmentation to calculate levenshtein distance in Go.
* [mafsa](https://github.com/smartystreets/mafsa) - MA-FSA implementation with Minimal Perfect Hashing
* [roaring](https://github.com/RoaringBitmap/roaring) - Go package implementing compressed bitsets.
* [skiplist](https://github.com/gansidui/skiplist) - Skiplist implementation in Go