Fix overflowing lines.

[saga.git] / appl.tex

diff --git a/appl.tex b/appl.tex
index 1b3b3da86058f8a3487de91bdb58eaf81419e364..13455b1426830dc7fe66b1e55bce17c22950b53a 100644 (file)
--- a/appl.tex
+++ b/appl.tex
@@ -11,7 +11,7 @@ on various special cases of our problem and also to several related problems tha
 frequently arise in practice.
 
 \paran{Graphs with sorted edges}
-When the edges are already sorted by their weights, we can use the Kruskal's
+When the edges of the given graph are already sorted by their weights, we can use the Kruskal's
 algorithm to find the MST in time $\O(m\timesalpha(n))$ (Theorem \ref{kruskal}).
 We however can do better: As the minimality of a~spanning tree depends only on the
 order of weights and not on the actual values (The Minimality Theorem, \ref{mstthm}), we can