knapsack.h

来自「0/1背包问题的几种解法」· C头文件 代码 · 共 27 行

#define MAXSIZE 26
#define CAPACITY 500

static int BestValue[MAXSIZE+1][CAPACITY+1];
static int Xi[MAXSIZE+1];

typedef struct
{
	int Value[MAXSIZE+1];
	int Weight[MAXSIZE+1];
	int Capacity;
}KNAPSACK;

typedef struct{
	int weight;
	int value;
}ITEM;

void KnapsackByDp(int prmValue[], int prmWeight[], int prmCapacity, int (*prmBestValue)[CAPACITY+1]);
void TraceBack(int (*prmBestValue)[CAPACITY+1], int prmWeight[], int prmCapacity);
int Min(int prmA, int prmB);
int Max(int prmA, int prmB);
void InitKnapsack(KNAPSACK * prmKnapsack);
void PrintKnapsackInfo(KNAPSACK prmKnapsack);
void PrintSelect();
void PrintTitle(char *);