OSDN Git Service

Update docs/graph/mst.md
authorzhouyuyang2002 <54274322+zhouyuyang2002@users.noreply.github.com>
Wed, 28 Aug 2019 14:15:36 +0000 (22:15 +0800)
committerGitHub <noreply@github.com>
Wed, 28 Aug 2019 14:15:36 +0000 (22:15 +0800)
Co-Authored-By: ouuan <y___o___u@126.com>
docs/graph/mst.md

index 58cc108..d8959a3 100644 (file)
@@ -696,4 +696,3 @@ int main() {
 
     时间复杂度 $O((n+m+Q) \log n)$
 
-??? note "[「LOJ 137」最小瓶颈路 加强版](https://loj.ac/problem/137)"