From 41b615829fcb2bd7f231ba8c4612604b5d678f64 Mon Sep 17 00:00:00 2001
From: yww <weeerrr720@qq.com>
Date: Tue, 27 Nov 2018 17:00:20 +0800
Subject: [PATCH] update min-circle.md

---
 docs/graph/min-circle.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/graph/min-circle.md b/docs/graph/min-circle.md
index 0e46149f..021512b6 100644
--- a/docs/graph/min-circle.md
+++ b/docs/graph/min-circle.md
@@ -14,7 +14,7 @@
 
 枚举所有边，每一次求删除一条边之后对这条边的起点跑一次 Dijkstra，道理同上。
 
-时间复杂度 $O(m(n+m)logn)$。
+时间复杂度 $O(m(n+m)\log n)$。
 
 ### Floyd
 
-- 
2.11.0