Merge branch 'master' of ssh://info.iut-bm.univ-fcomte.fr/canny

[canny.git] / stc.tex

diff --git a/stc.tex b/stc.tex
index e8c695cf1a3963369fa61f56df0c1abe0b4d369f..7ce100b8be84e7d3623b727a49ae7755b84b6e4f 100644 (file)
--- a/stc.tex
+++ b/stc.tex
@@ -77,6 +77,6 @@ Next, the  process of finding $y$ consists of a forward and a backward part:
 \item Backward determinization of $y$ which minimizes $D$ starting with 
 the complete path with minimal weight
 \end{enumerate} 
 \item Backward determinization of $y$ which minimizes $D$ starting with 
 the complete path with minimal weight
 \end{enumerate} 

-Let us now give some details about these two parts.
+