From 53d83644c3bf9c37152aadee500e5e9bdb0514e1 Mon Sep 17 00:00:00 2001
From: Paul Jungeblut <paul.jungeblut@gmail.com>
Date: Sat, 15 Oct 2016 00:58:10 +0200
Subject: Adding code for a suffix automaton doing longest common substring
 queries in linear time.

---
 string/string.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to 'string/string.tex')

diff --git a/string/string.tex b/string/string.tex
index 16ad30a..854b05a 100644
--- a/string/string.tex
+++ b/string/string.tex
@@ -12,8 +12,8 @@
 \subsection{Suffix-Array}
 \lstinputlisting{string/suffixArray.cpp}
 
-\subsection{Longest Common Substring}
-\lstinputlisting{string/LCSubstring.cpp}
+\subsection{Suffix-Automaton}
+\lstinputlisting{string/suffixAutomaton.cpp}
 
 \subsection{Longest Common Subsequence}
 \lstinputlisting{string/longestCommonSubsequence.cpp}
-- 
cgit v1.2.3