Special cases.

[saga.git] / mst.tex

diff --git a/mst.tex b/mst.tex
index 866bcc1270da224810c7db20e39b23a5e663bf94..857399a693a7f84294b0f92d436a48edfe7e6212 100644 (file)
--- a/mst.tex
+++ b/mst.tex
@@ -393,7 +393,7 @@ the remaining edges, since for a connected graph the algorithm always stops with
 number of blue edges.
 \qed
 
-\impl
+\impl\id{jarnimpl}%
 The most important part of the algorithm is finding \em{neighboring edges,} i.e., edges
 of the cut $\delta(T)$. In a~straightforward implementation,
 searching for the lightest neighboring edge takes $\Theta(m)$ time, so the whole