make2db.h

算法设计的分支限界法中的单源最短路径问题的实现

#include<iostream.h>
#ifndef Make2DArray_
#define Make2DArray_

template<class T>void Make1DArray(T *&x,int cols){
	x=new T [cols];
}

template<class T>void Make2DArray(T **&x,int rows,int cols){
	x=new T *[rows];   //先分配前面，再分配后面
	for(int i=0;i<rows;i++)
		x[i]=new T[cols];
}

template<class T>void remove1DArray(T *&x){
	delete [] x;
}

template<class T>void remove2DArray(T **&x,int rows){
	for(int i=0;i<rows;i++)
		delete [] x[i]; //先释放后面，再释放前面
	delete [] x;
}

template<class T>void remove3DArray(T ***&x,int plan,int rows){
	for(int i=0;i<plan;i++)
		for(int j=0;j<rows;j++)
			delete[] x[i][j];
		for(int i=0;i<rows;i++)
			delete[] x[i];
		delete [] x;
}
#endif