#include <iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<string.h>
#define N 6
#define MAX_INT 999999
using namespace std;// 边的结构体
typedef struct{int x;int y;int cost;
} Tpath;//连通图的邻接矩阵
int g [N][N] = {{-1,6,1,5,-1,-1},{6,-1,5,-1,3,-1},{1,5,-1,5,6,4},{5,-1,5,-1,-1,2},{-1,3,6,-1,-1,6},{-1,-1,4,2,6,-1}};void gprim(); //main
int main(int argc, char** argv) {gprim();return 0;
}
//运行prim算法
void gprim(){vector<Tpath> p;   //记录边vector<int>u;      //集合Su.push_back(0);    //将V0加入到S中int node1= 0,node2 = 0,cost = 0;int i = 0;vector<int>::iterator  it;for(u.size(); u.size() < N ;){// get the lowcost pathnode1 = -1;node2 = -1;cost = MAX_INT ;for(it = u.begin() ;it != u.end() ; it++){      // 从V-S集合里面寻找到离S集合最lowcost的节点和对应的边。将其记录下来为 为cost,node1,node2 int k = (*it);for(i = 0; i < N ;i++){if(i == (*it))continue;if(g[k][i] >= 0 && (find(u.begin(),u.end(),i) == u.end()) && g[k][i] < cost){node1 = k;node2 = i;cost = g[k][i];}}}// 将该节点加入到S中 并记录下路径pathTpath path;path.cost = cost;path.x = node1;path.y = node2;p.push_back(path);u.push_back(node2);     }//输出vector<Tpath>::iterator itO;for(itO = p.begin() ; itO != p.end() ;itO++){printf("(%d ,%d) cost: %d\n",itO->x+1,itO->y+1,itO->cost);}
}

#include <iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<string.h>
#define N 6
#define MAX_INT 999999
using namespace std;// 边的结构体
typedef struct{int x;int y;int cost;
} Tpath;//连通图的邻接矩阵
int g [N][N] = {{-1,6,1,5,-1,-1},{6,-1,5,-1,3,-1},{1,5,-1,5,6,4},{5,-1,5,-1,-1,2},{-1,3,6,-1,-1,6},{-1,-1,4,2,6,-1}};
//increase sort
bool cmp(const Tpath &p1, const Tpath &p2){return p1.cost < p2.cost;
}void gkruskal();//main
int main(int argc, char** argv) {gkruskal();return 0;
}void gkruskal(){vector<Tpath> t;int i = 0 ,j = 0;
//将所有的边生成一个一个的结构体节点for(i ; i < N ; i++){for(j = i+1;j <N ;j++){if(g[i][j] < 0) continue;Tpath p ;p.x = i;p.y = j;p.cost = g[i][j];t.push_back(p);}}
//按边的距离升序排序sort(t.begin(),t.end() ,cmp);vector<Tpath>::iterator it;//为每个节点Vi设置连通分量vector< set<int> > sets;for(i = 0; i < N ;i++){set<int> v;v.insert(i);sets.push_back(v);}vector<Tpath> p;i = 0;
//执行算法，扫描升序边集合for(;p.size() < N -1 ; ){set<int> x  = sets[t[i].x];set<int> y =  sets[t[i].y];set<int>::iterator it;//如果该边的两个顶点Vi ,Vj 各自的连通分量不包含对方，就将改变加入到路径集合SE中if(x.find(t[i].y) == x.end()){p.push_back(t[i]);set<int>::iterator xi ;//同时将Vj的连通分量加入到Vi的连通分量重for(xi = sets[t[i].x].begin() ; xi != sets[t[i].x].end(); xi++){if((*xi) == t[i].x)continue;sets[(*xi)].insert(y.begin(),y.end());}//同时将Vi的连通分量加入到Vj的连通分量重for(xi = sets[t[i].y].begin() ; xi != sets[t[i].y].end(); xi++){if((*xi) == t[i].y)continue;sets[(*xi)].insert(x.begin(),x.end());}sets[t[i].x].insert(y.begin(),y.end());sets[t[i].y].insert(x.begin(),x.end());}++i;   //扫描下一条边}//输出最小生成树的 边对for(it = p.begin() ; it != p.end();it++){cout<<"("<< it->x +1 <<","<<it->y + 1<<")"<<"cost :"<<it->cost<<endl;}}