From e30efb42e839bec506caff3d7b24bd7fbf0d2b72 Mon Sep 17 00:00:00 2001
From: 24OI-bot <15963390+24OI-bot@users.noreply.github.com>
Date: Wed, 28 Aug 2019 03:22:39 -0400
Subject: [PATCH] style: format markdown files with remark-lint

---
 docs/graph/mst.md | 1 -
 1 file changed, 1 deletion(-)

diff --git a/docs/graph/mst.md b/docs/graph/mst.md
index c42a5576..f6b59755 100644
--- a/docs/graph/mst.md
+++ b/docs/graph/mst.md
@@ -699,6 +699,5 @@ int main() {
     询问的根节点可以使用 kruskal 重构树上倍增的方式求出。
 
     时间复杂度 $O((n+m+Q) \log n)$
-    
 
 ??? note "[「LOJ 137」最小瓶颈路 加强版](https://loj.ac/problem/137)"
-- 
2.11.0