代码搜索：Capacity
找到约 2,190 项符合「Capacity」的源代码
代码结果 2,190
www.eeworm.com/read/264397/11316442
cpp 背包问题扩展三.cpp
#define MAX 200
#include
#include
using namespace std;
struct Item{ //建立结构数组，包含两个数据：物品的重量以及其单位价值
double weight, value;
}item[
www.eeworm.com/read/264397/11316445
cpp 背包问题扩展二.cpp
#define MAX 100000
#include
using namespace std;
int Packet(int *Weight, int *Value, int n, int Capacity);
int main(){
int n;
cout
www.eeworm.com/read/408732/11375470
ltf tran.ltf
set default
set echoin 1
MODEL:
! A 3 Warehouse, 4 Customer
Transportation Problem;
SETS:
WAREHOUSE / WH1, WH2, WH3/ : CAPACITY;
CUSTOMER / C1, C2, C3, C4/ : DEMAND;
ROUTES( W
www.eeworm.com/read/405379/11464087
m rheesub.m
% Author: Zukang Shen and Ian C. Wong
% Copyright (C) 2004 Ian C. Wong
%
% This program is free software; you can redistribute it and/or
% modify it under the terms of the GNU General Public
www.eeworm.com/read/157453/11703460
cpp firstfit.cpp
// First fit bin packing
#include
#include "winner.h"
int winner(int a[], int b, int c)
{// For a max winner tree.
if (a[b] >= a[c]) return b;
return c;
}
void FirstFi
www.eeworm.com/read/157453/11704050
cpp load.cpp
// greedy container loading
#include
void IndirectSort(int w[], int t[], int n)
{// Cluge to test when weights already in order.
for (int i=1; i
www.eeworm.com/read/259580/11779708
output timelist.output
Best-case times in progress
50000 inserts took 3.95 ms when started with capacity 10
50000 gets took 1.0421 ms
50000 indexOfs took 2282 ms
Worst-case indexOf took 0.0906 ms
50000 erases took 2.00
www.eeworm.com/read/259580/11779875
cpp arraylistnostl.cpp
// test the class arrayListNoSTL
#include
#include "linearList.h"
#include "arrayListNoSTL.h"
using namespace std;
int main()
{
// test constructor
linearList *x =
www.eeworm.com/read/259580/11780162
cpp arraylist.cpp
// test the class arrayList that uses STL algorithms
#include
#include "linearList.h"
#include "arrayList.h"
using namespace std;
int main()
{
// test constructor
linearLis