代码搜索：minimum
找到约 5,594 项符合「minimum」的源代码
代码结果 5,594
www.eeworm.com/read/343492/11944326
m minimum_nonspanning_tree_edges.m
function [A,weightsum] = minimum_nonspanning_tree_edges(C1, C2, maxedges)
%
% Find the minimum spanning tree using Prim's algorithm.
% C1(i,j) is the primary cost of connecting i to j.
% C2(i,j) is th
www.eeworm.com/read/482889/1282042
hpp prim_minimum_spanning_tree.hpp
//=======================================================================
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
//
www.eeworm.com/read/300587/13904137
cpp 1394 minimum inversion number.cpp
#include
using namespace std;
int num[5001];
int imin,n;
int main()
{
int i,j,t;
while( scanf("%d",&n)!=EOF )//输入的数字范围 0 ~ n-1
{
for(i=0;i
www.eeworm.com/read/433114/8544650
m s_convert2minimum_phase.m
function seismic=s_convert2minimum_phase(seismic,wlength)
% Create the minimum-phase equivalent of the input data set (usually a wavelet).
% The output data set starts at time 0 and ends at time "wlen
www.eeworm.com/read/245849/12777368
m s_convert2minimum_phase.m
function seismic=s_convert2minimum_phase(seismic,wlength)
% Create the minimum-phase equivalent of the input data set (usually a wavelet).
% The output data set starts at time 0 and ends at time "wlen
www.eeworm.com/read/263085/11376754
ppt lect14_minimum_spanning_trees.ppt
www.eeworm.com/read/259565/11781847
m s_convert2minimum_phase.m
function seismic=s_convert2minimum_phase(seismic,wlength)
% Create the minimum-phase equivalent of the input data set (usually a wavelet).
% The output data set starts at time 0 and ends at time "wlen