LaTex算法代码排版-algorithm2e

最新推荐文章于 2024-09-03 12:01:38 发布

叶非花

最新推荐文章于 2024-09-03 12:01:38 发布

阅读量5.4k

点赞数 4

分类专栏： Latex 文章标签：算法

本文链接：https://blog.csdn.net/u010072043/article/details/122050693

版权

Latex 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

LaTex算法代码排版-algorithm2e

1.使用如下宏包

\usepackage[ruled]{algorithm2e} %带竖线
%\usepackage[ruled,vlined]{algorithm2e} %带竖线和折线
%\usepackage[linesnumbered,boxed]{algorithm2e} %方框格式

2.示例代码

\begin{algorithm}
%\SetAlgoLined
%\SetAlgoNoLine %去掉竖线
\SetKwData{Left}{left}\SetKwData{This}{this}\SetKwData{Up}{up} \SetKwFunction{Union}{Union}\SetKwFunction{FindCompress}{FindCompress} \SetKwInOut{Input}{input}\SetKwInOut{Output}{output}
	
	\Input{A bitmap $Im$ of size $w\times l$}
	\Output{A partition of the bitmap}
	 \BlankLine
	
	 \emph{special treatment of the first line}\;
	 \For{$i\leftarrow 2$ \KwTo $l$}{
	 	\emph{special treatment of the first element of line $i$}\;
	 	\For{$j\leftarrow 2$ \KwTo $w$}{\label{forins} \Left$\leftarrow$\FindCompress{$Im[i,j-1]$}\;
	 	\Up$\leftarrow$ \FindCompress{$Im[i-1,]$}\;
	 	\This$\leftarrow$ \FindCompress{$Im[i,j]$}\;
	 	\If(\tcp*[h]{O(\Left,\This)==1})
	 		{\Left compatible with \This}{\label{lt}
	 			\lIf{\Left $<$ \This}{\Union{\Left,\This}}
	 			 \lElse{\Union{\This,\Left}} }
 	    \If(\tcp*[f]{O(\Up,\This)==1}){\Up compatible with
 			 	 \This}{\label{ut}
 			 	 \lIf{\Up $<$ \This}{\Union{\Up,\This}}
 			 	 \tcp{\This is put under \Up to keep tree as flat as possible}\label{cmt} \lElse{\Union{\This,\Up}}\tcp*[h]{\This linked to \Up}\label{lelse}
 		 	  }
 	 	   }
 		 \lForEach{element $e$ of the line $i$}{\FindCompress{p}}
 	 }
 	 	  \caption{disjoint decomposition}
 	 	  \label{algo_disjdecomp}
\end{algorithm}