本文主要是介绍latex算法模板,对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
%!TEX encoding = UTF-8 Unicode
%!TEX TS-program = pdflatex
\def\SetClass{article}
\documentclass{\SetClass}
\usepackage[linesnumbered,lined,ruled,commentsnumbered]{algorithm2e}
\usepackage{CJKutf8}
\AtBeginDocument{\begin{CJK}{UTF8}{gbsn}}
\AtEndDocument{\end{CJK}}
\begin{document}
\IncMargin{1em}
\begin{algorithm}
\SetKwData{Left}{left}\SetKwData{This}{this}\SetKwData{Up}{up}
\SetKwFunction{SearchRouteByDriverID}{SearchRouteByDriverID}
\SetKwFunction{ComputeRouteDistance}{ComputeRouteDistance}
\SetKwFunction{GetAllInsertRoute}{GetAllInsertRoute}
\SetKwFunction{InsertFeasible}{InsertFeasible}
\SetKwInOut{Input}{input}\SetKwInOut{Output}{output}
\Input{待规划订单信息order}
\Output{接单司机及其更新后的路径}
\BlankLine
\emph{increaseDistance = MAX}\;
\emph{targetDriver}\;
\emph{updateRoute}\;
\For{$driver\leftarrow allDrivers$}{
\If{driverAbility $<$ orderQuantity}{nextDriver;}
$route\leftarrow$ \SearchRouteByDriverID{$driverID$}\;
$oldDistance\leftarrow$ \ComputeRouteDistance{$route,driver$}\;
$allInsertRoute\leftarrow$ \GetAllInsertRoute{$route,order$}\;
\For{$insertRoute\leftarrow allInsertRoute$}{
\If{\InsertFeasible{$insertRoute,driver$}}{
$newDistance\leftarrow$ \ComputeRouteDistance{$insertRoute,driver$}\;
\If{$newDistance-oldDistance < increaseDistance$}{
$increaseDistance \leftarrow newDistance-oldDistance$\;
$targetDriver \leftarrow driver$\;
$updateRoute \leftarrow insertRoute$\;}
}
}
}
\Return $targetDriver,updateRoute$
\caption{穷举法}\label{algo_disjdecomp}
\end{algorithm}\DecMargin{1em}
\end{document}
这篇关于latex算法模板的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!