📄 minmeancycle.m
字号:
% MinMeanCycle -- Finding minimum mean cycle in an beamlet graph% Usage% [Path,MinMean] = MinMeanCycle(VE,n);% Inputs% VE weights of beams, same structure as beamlet coefficients% n n by n image% Outputs% Path path of the cycle with minimum mean % MinMean the minimum mean% Description% Implement the algorithm described in R. Karp, "A characterization of the% minimum cycle mean in a digraph", 1977.% %%% Part of BeamLab Version:200% Built:Friday,23-Aug-2002 00:00:00% This is Copyrighted Material% For Copying permissions see COPYING.m% Comments? e-mail beamlab@stat.stanford.edu%%% Part of BeamLab Version:200% Built:Saturday,14-Sep-2002 00:00:00% This is Copyrighted Material% For Copying permissions see COPYING.m% Comments? e-mail beamlab@stat.stanford.edu%
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -