From 58888718b9a1666690d001d68bb085ab7c9de46b Mon Sep 17 00:00:00 2001 From: ouuan Date: Thu, 22 Aug 2019 20:29:42 +0800 Subject: [PATCH] =?utf8?q? =20=E2=86=92=20\qquad?= MIME-Version: 1.0 Content-Type: text/plain; charset=utf8 Content-Transfer-Encoding: 8bit --- docs/intro/htc.md | 28 ++++++++++++++-------------- 1 file changed, 14 insertions(+), 14 deletions(-) diff --git a/docs/intro/htc.md b/docs/intro/htc.md index a2a5fa69..70d02990 100644 --- a/docs/intro/htc.md +++ b/docs/intro/htc.md @@ -159,29 +159,29 @@ LaTeX 作为公式排版的首选,我们应当正确地使用它。因此对 伪码具体格式没有严格要求,请参考算法导论或学术论文。注意不要写成 Python,赋值使用 `$\gets$` 表示。 -在 Wiki 中,使用 Markdown 引用来书写伪代码,使用 `    ` 表示缩进。 +在 Wiki 中,使用 Markdown 引用来书写伪代码,使用 `$\qquad$` 表示缩进。 例如: -> **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$ . +> **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. +> **Output.** The edges of the MST of the input graph. > -> **Method.** +> **Method.** > -> $result \gets \varnothing$ +> $result \gets \varnothing$ > -> sort $e$ into nondecreasing order by weight $w$ +> sort $e$ into nondecreasing order by weight $w$ > -> **for** each $(u, v, w)$ in the sorted $e$ +> **for** each $(u, v, w)$ in the sorted $e$ > -> **if** $u$ and $v$ are not connected in the union-find set +> $\qquad$**if** $u$ and $v$ are not connected in the union-find set > -> connect $u$ and $v$ in the union-find set +> $\qquad\qquad$connect $u$ and $v$ in the union-find set > -> $result \gets result\ \bigcup\ \{(u, v, w)\}$ +> $\qquad\qquad result \gets result\ \bigcup\ \{(u, v, w)\}$ > -> **return** $result$ +> **return** $result$ ```markdown > **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$. @@ -196,11 +196,11 @@ LaTeX 作为公式排版的首选,我们应当正确地使用它。因此对 > > **for** each $(u, v, w)$ in the sorted $e$ > ->     **if** $u$ and $v$ are not connected in the union-find set +> $\qquad$**if** $u$ and $v$ are not connected in the union-find set > ->         connect $u$ and $v$ in the union-find set +> $\qquad\qquad$connect $u$ and $v$ in the union-find set > ->         $result \gets result\ \bigcup\ \{(u, v, w)\}$ +> $\qquad\qquad result \gets result\ \bigcup\ \{(u, v, w)\}$ > > **return** $result$ ``` -- 2.11.0