Skip to content

Commit

Permalink
Update README.md
Browse files Browse the repository at this point in the history
  • Loading branch information
baratgabor authored Apr 23, 2019
1 parent ea1e7c2 commit b2d01f2
Showing 1 changed file with 2 additions and 0 deletions.
2 changes: 2 additions & 0 deletions .github/README.md
Original file line number Diff line number Diff line change
@@ -1,5 +1,7 @@
# Suffix Tree implementation in C# based on Ukkonen's linear time construction algorithm

[![Build Status](https://travis-ci.com/baratgabor/SuffixTree.svg?branch=master)](https://travis-ci.com/baratgabor/SuffixTree)

If you're here you probably know what this is, so I won't waste your time by stating the obvious.

There is nothing revolutionary here. My assumption is that this repo – and especially the **[detailed description below](#plain-plain-english-explanation-of-ukkonens-algorithm)** – is mostly useful for people who are learning this algorithm the first time.
Expand Down

0 comments on commit b2d01f2

Please sign in to comment.