From 23b172528b36a3efcad94d1cdf96ecde0a4b446c Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Mon, 17 Mar 2008 18:51:51 +0100
Subject: [PATCH] Bug fix.

---
 mst.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/mst.tex b/mst.tex
index 6e6310b..7c533c1 100644
--- a/mst.tex
+++ b/mst.tex
@@ -545,7 +545,7 @@ the identifier of the component. This takes $\O(m_i)$ time.
 
 Flattening is performed by first removing the loops and then bucket-sorting the edges
 (as ordered pairs of vertex identifiers) lexicographically, which brings parallel
-edges together. The bucket sort uses two passes with $n$~buckets, so it takes
+edges together. The bucket sort uses two passes with $n_i$~buckets, so it takes
 $\O(n_i+m_i)=\O(m)$.
 \qed
 
-- 
2.39.2