#include <stdio.h>
#include <stdlib.h>
#include <map>
#include <iostream>using namespace std;/* 实现一个并查集，可以用于判断网络连通性或者kruskal算法 */
template <class T>
class UnionFind {int m_size;std::map<T, int> m_hashMap;int *m_id;void initUnionFind(T *array) {for (int i = 0; i < m_size; i++) {m_hashMap.insert(std::pair<T, int>(array[i],i));m_id[i] = i;}};int find(T p) {int r = m_hashMap[p];while (m_id[r] != r)r = m_id[r];return r;}
public:UnionFind(T *array,int size) : m_size(size) {m_id = (int*)malloc(sizeof(int)*size);if (!m_id) {cout<<"OOM"<<endl; exit(-1);}initUnionFind(array);};~UnionFind() { if (m_id) { free(m_id); m_id = NULL; } };// 合并元素p和元素q所在的集合.void unionT(T p, T q) {int pId = find(p);int qId = find(q);if (pId == qId) { return ;}for (int i = 0; i < m_size; i++) {if (m_id[i] == pId) {m_id[i] = qId;}}};bool isConnected(T p, T q) {return find(p) == find(q);};};

template<class T,class edgeType>
void Graph<T,edgeType>::kruskal() {// Initlist<edgeType*> edgeSet;// 这里用优先队列效率更高sortEdge(edgeSet);list<edgeType*> treeEdgeSet;//最小生成树边集int vertexArraySize = m_vertexNodeSet.size();T *vertexArray = (T*)malloc(sizeof(T*)*vertexArraySize);typename std::list<VertexNodeType*>::iterator iter;int i = 0;for (iter = m_vertexNodeSet.begin(); iter != m_vertexNodeSet.end(); ++iter) {vertexArray[i] = iter->getVertex();i++;}UnionFind<T*> vertexUnion(vertexArray,vertexArraySize);typename std::list<edgeType*>::iterator it;for (it = edgeSet.begin(); it != edgeSet.end(); ++it) {// Find Min dis edge.edgeType *edgeMin = it->front();it->pop_front();// Is the ori node and des node in same set?T *ori = edgeMin->getOri();T *des = edgeMin->getOri();// If in same set,Ignore.If not,combain the set and add this edge.if (vertexUnion.isConnected(ori, des)) {continue;} else {vertexUnion.unionT(ori, des);treeEdgeSet->push_back(edgeMin);}}#ifdef _DEBUG_typename std::list<edgeType*>::iterator itera;for (itera = treeEdgeSet.begin(); itera != treeEdgeSet.end(); itera++) {cout<<itera->getWeight()<<endl;}
#endif// Free vertexArray.if (vertexArray) {free(vertexArray);vertexArray = NULL;}return ;
}

#ifndef ___00_alg_tests__minimal_spanning_tree__
#define ___00_alg_tests__minimal_spanning_tree__#include <stdio.h>
#include <string.h>
#include <list>
#include <vector>#include "union_find.h"#define _DEBUG_
#ifdef _DEBUG_
#include <iostream>
using namespace std;#endif#define MAX_DISTENCE 0xfffffff// Vertex value
template<class T,class keyType = long>
class Vertex {
public:typedef T valueType;Vertex(keyType key, T value) : m_key(key), m_value(value) {m_dis = MAX_DISTENCE;m_known = false;m_isVisited = false;};~Vertex(){};int getDis() { return m_dis;};void setDis(int dis) { m_dis = dis; return ;};bool isknown() { return m_known;};keyType getKey() { return m_key;};void init() { m_known = false; m_isVisited = false;};void setKnown() { m_known = true; return ;};bool isVisited() { return m_isVisited;};void setVisited() { m_isVisited = true; return ;};
private:keyType m_key;          /* 顶点关键字. */valueType m_value;      /* 顶点值. */int m_dis;              /* 距离. */bool m_known;           /* 是否已被遍历(prim算法). */bool m_isVisited;       /* 标识是否被访问过(DFS算法). */
};// Edge
template<class T,class weightType = int>
class Edge {
public:typedef T nodeType;Edge(T *ori, T *des, weightType weight) : \m_ori(ori), m_des(des), m_weight(weight) { };~Edge() { };T *getOri() { return m_ori;};T *getDes() { return m_des;};weightType getWeight() { return m_weight;}bool operator< (const Edge<T,weightType> *M) const {return m_weight < M->getWeight();};
private:nodeType *m_ori;            /* 边的起始点. */nodeType *m_des;            /* 边的终止点. */weightType m_weight;        /* 边的权值. */
};template<class T, class edgeType>
class VertexNode {
public:typedef T nodeType;VertexNode(T *node) : m_vertex(node) { m_iter = m_adj.begin();};~VertexNode() { };/* 清除算法对顶点的副作用. */void init() { if (m_vertex){ m_vertex->init(); } return ;};/* 添加边到图. */void addEdge(edgeType *edge) { m_adj.push_back(edge);};/* 获取顶点的临接边. */edgeType *getAdj() { m_iter = m_adj.begin();return *m_iter;};/* 获取该顶点的下一条临接边 .*/edgeType *getNext() { m_iter++; return (m_iter != m_adj.end()) ? *m_iter : NULL;};/* 获取顶点元素. */T *getVertex() { return m_vertex;};/* 标识此顶点是否被访问过(prim算法). */bool isKnown() { return (m_vertex) ? m_vertex->isknown() : false;};/* 设置此顶点已经被访问过(prim算法). */void setKnown() { if (m_vertex) {m_vertex->setKnown();} return ;};/* 获取距离--prim算法*/int getDis() { if (m_vertex) { return m_vertex->getDis();} exit(-1);}/* 设置距离. */void setDis(int dis) { if (m_vertex) { m_vertex->setDis(dis);} return ;};/* 标识此顶点是否被访问过(dfs算法). */bool isVisited() { return (m_vertex) ? m_vertex->isVisited() : false ;};/* 设置此顶点已经被访问过(dfs算法). */void setVisited() { if (m_vertex) {m_vertex->setVisited();} return ;};private:nodeType *m_vertex;                             /* 顶点元素 */std::list<edgeType*> m_adj;                     /* 顶点的邻接表. */typename std::list<edgeType*>::iterator m_iter; /* 用于遍历邻接点. */
};template<class T,class edgeType>
class Graph {
public:Graph(){};~Graph(){};typedef VertexNode<T,edgeType> VertexNodeType;/* 清除算法对图的副作用. */void init();/* Prim算法. */void prim();/* 深度优先遍历. */void dfs(VertexNodeType* src);/* 向图中增加一个顶点. */void addNode(VertexNode<T,edgeType> *node) { m_vertexNodeSet.push_back(node);};void kruskal();
private:/* 顶点集. */std::list<VertexNodeType*> m_vertexNodeSet;/* 找到最短的边集--用于prim算法 */VertexNodeType* findMindis();void sortEdge(list<edgeType*> &edgeSet);
};template<class T,class edgeType>
void Graph<T,edgeType>::init() {typename std::list<VertexNodeType*>::iterator it;for (it = m_vertexNodeSet.begin(); it != m_vertexNodeSet.end(); ++it) {it->init();}return ;
}template<class T,class edgeType>
VertexNode<T,edgeType>* Graph<T,edgeType>::findMindis() {int min = MAX_DISTENCE;VertexNodeType* minDisNode = NULL;// for_each node.typename std::list<VertexNodeType*>::iterator iter;for (iter = m_vertexNodeSet.begin(); \iter != m_vertexNodeSet.end(); ++iter) {VertexNodeType* tmp = *iter;if (tmp->isKnown()) {continue;}if (min > tmp->getDis()){min = tmp->getDis();minDisNode = tmp;}}return minDisNode;
}template<class T,class edgeType>
void Graph<T,edgeType>::prim() {VertexNodeType *nodeTmp = m_vertexNodeSet.front();if (!nodeTmp) {//cout<<"No Node exist in this Graph."<<endl;return ;}nodeTmp->setDis(0);nodeTmp->setKnown();#ifdef _DEBUG_cout<<"Node's key = "<<nodeTmp->getVertex()->getKey();cout<<",Distence = "<<nodeTmp->getVertex()->getDis()<<endl;
#endif// For_each node.for (; ;) {edgeType* edgeTmp = nodeTmp->getAdj();// For_each adj node.while (edgeTmp) {T * Vtmp = edgeTmp->getDes();
#ifdef _DEBUG_cout<<"Node("<<Vtmp->getKey()<<") "<<endl;;
#endifif (Vtmp->isknown()) {edgeTmp = nodeTmp->getNext();continue;}// Update dis.if (edgeTmp->getWeight() < Vtmp->getDis()) {Vtmp->setDis((int)edgeTmp->getWeight());}edgeTmp = nodeTmp->getNext();}// Find the node which has min dis.nodeTmp = findMindis();if (!nodeTmp) {break;}nodeTmp->setKnown();
#ifdef _DEBUG_cout<<"Node's key = "<<nodeTmp->getVertex()->getKey();cout<<",Distence = "<<nodeTmp->getVertex()->getDis()<<endl;
#endif}return ;
}template<class T,class edgeType>
void Graph<T,edgeType>::sortEdge(list<edgeType*> &edgeSet) {typename std::list<VertexNodeType*>::iterator it;for (it = m_vertexNodeSet.begin(); it != m_vertexNodeSet.end(); ++it) {edgeType *edgeTmp = it->getAdj();while (edgeTmp) {edgeSet->push_back(edgeTmp);edgeTmp = it->getNext();}}sort(edgeSet.begin(), edgeSet.end(), less<edgeType>());return ;
}template<class T,class edgeType>
void Graph<T,edgeType>::kruskal() {// Initlist<edgeType*> edgeSet;// 这里用优先队列效率更高sortEdge(edgeSet);list<edgeType*> treeEdgeSet;//最小生成树边集int vertexArraySize = m_vertexNodeSet.size();T *vertexArray = (T*)malloc(sizeof(T*)*vertexArraySize);typename std::list<VertexNodeType*>::iterator iter;int i = 0;for (iter = m_vertexNodeSet.begin(); iter != m_vertexNodeSet.end(); ++iter) {vertexArray[i] = iter->getVertex();i++;}UnionFind<T*> vertexUnion(vertexArray,vertexArraySize);typename std::list<edgeType*>::iterator it;for (it = edgeSet.begin(); it != edgeSet.end(); ++it) {// Find Min dis edge.edgeType *edgeMin = it->front();it->pop_front();// Is the ori node and des node in same set?T *ori = edgeMin->getOri();T *des = edgeMin->getOri();// If in same set,Ignore.If not,combain the set and add this edge.if (vertexUnion.isConnected(ori, des)) {continue;} else {vertexUnion.unionT(ori, des);treeEdgeSet->push_back(edgeMin);}}#ifdef _DEBUG_typename std::list<edgeType*>::iterator itera;for (itera = treeEdgeSet.begin(); itera != treeEdgeSet.end(); itera++) {cout<<itera->getWeight()<<endl;}
#endif// Free vertexArray.if (vertexArray) {free(vertexArray);vertexArray = NULL;}return ;
}/* 深度优先遍历. */
template<class T,class edgeType>
void Graph<T,edgeType>::dfs(VertexNodeType *src) {// Set node Visited.VertexNodeType *V = src;V->setVisited();// For each W adj to V.edgeType *edgeTmp = V->getAdj();while (edgeTmp) {T *Vtmp = edgeTmp->getDes();if (!Vtmp->isKnown()) {dfs(Vtmp);}edgeTmp = V->getNext();}return ;
}int testGraphPrim();
int testGraphKruskal();#endif /* defined(___00_alg_tests__minimal_spanning_tree__) */

单元测试程序源码：