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