weixin_52486257的博客

原创 ds-消除连通图多余的边/Huffman Tree

#include<iostream> #include<algorithm> #define INFINITY 65535 using namespace std; //Prim算法 int MiniSpanTree_Prim_CostSum(int** adnj,int n) { int sum = 0; int min, i, j , k ; int* adjvex = new int[n]; int* lowcost = new int[n]; l...