algorithm
\begin{
figure}[!t]
\vspace*{
\dimexpr\fboxsep+\fboxrule}
\fbox{
\parbox{
\dimexpr\linewidth-2\fboxsep-2\fboxrule}{
\raggedright
\begin{
algorithmic}[1]
\STATE $L(p) = -1$, $p = 1,\ldots,N$.
\STATE $D(p) = +\infty$, $p = 1,\ldots,N$.
\FOR{
$t=1$ to $T$}
\FOR{
$k=1$ to $K$}
\FOR{
$p \in S^t(k)$}
\IF{
$D(p,k) < D(p)$}
\STATE $D(p) = D(p,k)$
\STATE $L(p) = k$
\ENDIF
\ENDFOR
\ENDFOR
\STATE Update new cluster center.
\STATE Update new search space.
\ENDFOR
\end{
algorithmic}
}}
\caption{
caption.}
\label{
fig:lkm_algo}
\end{
figure}