[Tex/LaTex] Algorithm / algorithmicx horizontal lines in booktabs style

algorithmicxalgorithmsbooktabs

I am using packages algorithm, algorithmicx and booktabs.

There are horizontal lines for both algorithms and tables. As you can see, the lines have different line strength and spacing.

I would like the horizontal lines and the spacing surrounding the algorithm and its caption to match exactly the beautiful design from booktabs.

\documentclass{scrreprt}

\usepackage[utf8]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{lmodern}

\usepackage{algorithm}
\usepackage{algpseudocode}
\usepackage{booktabs}

\begin{document}

\begin{algorithm}
\caption{Euclid}
\begin{algorithmic}[1]
\Procedure{Euclid}{$a,b$}\Comment{The g.c.d. of a and b}
\State $r\gets a\bmod b$
\While{$r\not=0$}\Comment{We have the answer if r is 0}
\State $a\gets b$
\State $b\gets r$
\State $r\gets a\bmod b$
\EndWhile\label{euclidendwhile}
\State \textbf{return} $b$\Comment{The gcd is b}
\EndProcedure
\end{algorithmic}
\end{algorithm}

\begin{table}
\centering
\begin{tabular}{ccc}
\toprule
First name & Last Name & Age \\
\midrule
John & Doe & 30 \\
John & Doe & 30 \\
\bottomrule
\end{tabular}
\end{table}

\end{document}

Best Answer

Nice idea!

We can create a new float style by modifying ruled:

\documentclass{scrreprt}

\usepackage[utf8]{inputenc}
\usepackage[T1]{fontenc}
\usepackage{lmodern}

\usepackage{algorithm}
\usepackage{algpseudocode}
\usepackage{booktabs}

\makeatletter
\newcommand\fs@booktabsruled{%
  \def\@fs@cfont{\bfseries\strut}\let\@fs@capt\floatc@ruled
  \def\@fs@pre{\hrule height\heavyrulewidth depth0pt \kern\belowrulesep}%
  \def\@fs@mid{\kern\aboverulesep\hrule height\lightrulewidth\kern\belowrulesep}%
  \def\@fs@post{\kern\aboverulesep\hrule height\heavyrulewidth\relax}%
  \let\@fs@iftopcapt\iftrue
}
\makeatother

\floatstyle{booktabsruled}
\restylefloat{algorithm}

\begin{document}

\begin{algorithm}
\caption{Euclid}
\begin{algorithmic}[1]
\Procedure{Euclid}{$a,b$}\Comment{The g.c.d. of a and b}
\State $r\gets a\bmod b$
\While{$r\not=0$}\Comment{We have the answer if r is 0}
\State $a\gets b$
\State $b\gets r$
\State $r\gets a\bmod b$
\EndWhile\label{euclidendwhile}
\State \textbf{return} $b$\Comment{The gcd is b}
\EndProcedure
\end{algorithmic}
\end{algorithm}

\begin{table}
\centering
\begin{tabular}{ccc}
\toprule
First name & Last Name & Age \\
\midrule
John & Doe & 30 \\
John & Doe & 30 \\
\bottomrule
\end{tabular}
\end{table}

\end{document}

Related Solutions

[Tex/LaTex] algorithmicx: shorten algorithm

Essentially, it's a matter of page geometry. \usepackage{fullpage} works, for instance, but you can probably also fool around with the geometry package to get a more customizable effect.

Also, see One inch margins and the geometry package.

As for the second point about removing the ends, section 4 of algorithmicx's documentation describes customizing blocks.

Edit: Here's an example.

If you add \algnotext{EndFor}, For blocks will print no end. You can then apply this to EndIf and anything else you need.

\documentclass{article}
\usepackage{algorithm}
\usepackage{algpseudocode}
\usepackage{amsmath,fullpage}
\algnotext{EndFor}
\algnotext{EndIf}
\begin{document}

\begin{algorithm}

\begin{algorithmic}[1]

\Function {NMS3D}{$T : array[1..w, 1..h, 1..d], n: int$}
    \State \Comment $(2 n +1) \times (2 n +1) \times (2 n +1)$ szomsz\'eds\'gban keress\"uk a lok\'alis maximumokat 
    \State label \textbf{mainloop:}
    \ForAll {$(i, j, k) \in \{ n, 2n+1, ... \}^3 \cap [1..w - n] \times [1..h - n] \times [1..d - n] $}
        \State \textbf{initialize:} $(i_{max}, j_{max}, k_{max}) \gets (i, j, k)$
        \ForAll {$(i_2, j_2, k_2) \in [i, i+n] \times [j, j+n] times [k, k+n]$}
            \If {$T[i_2, j_2, k_2] > T[i_{max}, j_{max}, k_{max}]$}
                \State $(i_{max}, j_{max}, k_{max}) \gets (i_2, j_2, k_2)$
            \EndIf
        \EndFor
        \ForAll {$(i_2, j_2, k_2) \in [i_{max}-n, i_{max}+n] \times [j_{max}-n, j_{max}+n] \times [k_{max}-n, k_{max}+n] 
        - [i, i+n] \times [j, j+n] \times [k, k+n]$}
            \If {$T[i_2, j_2, k_2] > T[i_{max}, j_{max}, k_{max}]$}
                \State \textbf{continue} mainloop
                \State \Comment a maximum jel\"olt t\'ul k\"ozel van egy m\'asik maximumhoz, elvetj\"uk
            \EndIf
        \EndFor         
        \State $list_{max} \stackrel{add}{\longleftarrow} (i_{max}, j_{max}, k_{max})$
    \EndFor
    \State \textbf{return} $list_{max}$
\EndFunction


\end{algorithmic}
\end{algorithm}
\end{document}

[Tex/LaTex] Algorithm with Latex ( Package algorithmicx)

You could simply do this:

\documentclass{article}
\usepackage{algorithm} %ctan.org\pkg\algorithms
\usepackage{algpseudocode}
\begin{document}

\begin{algorithm}
 \begin{algorithmic}[1]
 \Procedure{Euclid}{$a,b$}
 \State $r\gets a\bmod b$
 \While{$r\not=0$}
 \State $a\gets b$
 \State $b\gets r$
 \State $r\gets a\bmod b$
 \EndWhile
 \State \textbf{return} $b$ \Comment{The gcd is b}
 \EndProcedure
 \end{algorithmic}
 \caption{Euclid's algorithm}
 \label{euclid}
\end{algorithm}

\end{document}

Some packages define these kinds of floating environments, like alg, but that conflicted also.

Best Answer

Related Solutions

[Tex/LaTex] algorithmicx: shorten algorithm

[Tex/LaTex] Algorithm with Latex ( Package algorithmicx)

Related Question