From: Xiaodai Dai <diauweb@live.com>
Date: Sat, 2 Jan 2021 02:54:39 +0000 (+0800)
Subject: feat: add (future) pseudocodejs-version pseudocode
X-Git-Url: http://git.osdn.net/view?a=commitdiff_plain;h=643b379d72235231cd50e5e8650e32cb648fc51e;p=oi-wiki%2Fmain.git

feat: add (future) pseudocodejs-version pseudocode
---

diff --git a/docs/graph/mst.md b/docs/graph/mst.md
index eab0395c..5ed0977f 100644
--- a/docs/graph/mst.md
+++ b/docs/graph/mst.md
@@ -20,6 +20,26 @@ Kruskal 算法是一种常见并且好写的最小生成树算法，由 Kruskal
 ### 实现
 
 伪代码：
+<!--
+```pseudo
+\begin{algorithm}
+\caption{Kruskal}
+\begin{algorithmic}
+\INPUT{ The edges of the graph $e$ where each element in $e$ is $(u, v, w)$ denoting that there is an edge between $u$ and $v$ weighted $w$. }
+\OUTPUT The edges of the MST of the input graph
+\STATE $result \gets \varnothing$
+\STATE sort $e$ into nondecreasing order by weight $w$
+\FOR{each $(u, v, w)$ in the sorted $e$}
+    \IF{$u$ \AND $v$ are not connected in the union-find set}
+        \STATE connect $u$ \AND $v$ in the union-find set
+        \STATE $result \gets result \bigcup (u, v, w)$
+    \ENDIF
+\ENDFOR
+\RETURN $result$
+\end{algorithmic}
+\end{algorithm}
+```
+-->
 
 $$
 \begin{array}{ll}