旅行售货程序.docVIP

void Traveler(){?? ??? int i,j;?? ??? int temp_x[MAX_CITY_NUMBER];?? ??? Node* pNode = NULL;?? ??? int miniSum;??????????????????? //所有结点最小出边的费用和?? ??? int miniOut[MAX_CITY_NUMBER];?? ??????????????????????????????????? //保存每个结点的最小出边的索引?? ??? MiniHeap* heap = new MiniHeap;? //分配堆?? ??? InitMiniHeap(heap);???????????? //初始化堆?? ?????????????????????????????????????? ??? miniSum = 0;?? ??? for (i=0;iCity_Size;i++){?? ??????? miniOut[i] = MAX_COST;????? //初始化时每一个结点都不可达?? ??????? for(j=0;jCity_Size;j++){?? ??????????? if (City_Graph[i][j]0 City_Graph[i][j]miniOut[i]){?? ??????????????????????????????????? //从i到j可达，且更小?? ??????????????? miniOut[i] = City_Graph[i][j];?? ??????????? }?? ??????? }?? ??????? if (miniOut[i] == MAX_COST){// i 城市没有出边?? ??????????? Best_Cost = -1;?? ??????????? return ;?? ??????? }?? ??????? miniSum += miniOut[i];????? ??? }?? ??? for(i=0;iCity_Size;i++){?????? //初始化的最优路径就是把所有结点依次走一遍?? ??????? Best_Cost_Path[i] = i;?? ??? }?? ??? Best_Cost = MAX_COST;?????????? //初始化的最优费用是一个很大的数?? ??? pNode = new Node;?????????????? //初始化第一个结点并入堆?? ??? pNode-lcost = 0;?????????????? //当前结点的优先权为0 也就是最优?? ??? pNode-cc = 0;????????????????? //当前费用为0（还没有开始旅行）?? ??? pNode-rcost = miniSum;???????? //剩余所有结点的最小出边费用和就是初始化的miniSum?? ??? pNode-s = 0;?????????????????? //层次为0?? ??? pNode-pNext = NULL;?? ??? for(int k=0;kCity_Size;k++){?? ??????? pNode-x[k] = Best_Cost_Path[k];????? //第一个结点所保存的路径也就是初始化的路径?? ??? }?? ??? put(heap,*pNode);?????????????? //入堆?? ??? while(pNode != NULL (pNode-s) City_Size-1){?? ??????????????????????????????????? //堆不空 不是叶子?? ??????? for(int k=0;kCity_Size;k++){?? ??????????? Best_Cost_Path[k] = pNode-x[k] ;????? //将最优路径置换为当前结点本身所保存的?? ??????? }?? /*? * *? pNode 结点保存的路径中的含有这条路径上所有结点的索引? * *? x路径中保存的这一层结点的编号就是x[City_Size-2]? * *? 下一层结点的编号就是x[City_Size-1]? */? ??????? if ((pNode-s) == City_Size-2){ //是叶子的父亲?? ??????????? int edge1 = City_Graph[(pNode-x)[City_Size-2]][(pNode-x)[City_Size-1]];?? ??