@这篇文档是由C++代码实现的图然后进行最小生成树的实现
最小生成树算法分为普利姆算法和克鲁斯卡尔算法。普利姆算法是从给出的一个顶点开始,选出跟该顶点相连的所有的边中权值最小的边,然后将该边的另外一个顶点和该边加入到集合中去,然后递归寻找已遍历的所有顶点的最小的边,逐渐形成一个最小生成树。克鲁斯卡尔算法是首先将所有的边加入到一个集合中去,然后从这个集合中寻找权值最小的边并取出,并保证该边不与已经取出的边形成回路,这样最后得到一个最小生成树。
本文是以Visual Studio中新建的C++win32的控制台应用程序实现的,其中建立了头文件和源文件以及实现main()的demo文件,分别是Node.h和Node.cpp和Edge.h和Edge.cpp和Cmap.h和Cmap.cpp和demo.cpp文件。
其中edge.h文件定义了一个边所有的数据成员,包括两个顶点的序号和该边的权值。Node.h定义了结点的数据成员,包括储存数据的m_cData和该结点是否被访问过的布尔值,还有结点的构造函数。Cmap.h中定义了图元素所拥有的数据成员和成员函数。demo.h中以下图中的无向图为例,将图元素存入图中,并将图中的弧也存入一个数组中,相当于一个矩阵。![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/bb132443e1357dc4521c1626de645826.png)
![实现结果](https://i-blog.csdnimg.cn/blog_migrate/7f551782f70fcfaa67e0d2eaf2aaf7cc.png)
Node.h文件
#ifndef NODE_H
#define NODE_H
class Node
{
public:
Node(char data=0);
char m_cData;
bool m_bIsVisited;
};
#endif
Node.cpp文件
#include "Node.h"
Node::Node(char data)
{
m_cData = data;
m_bIsVisited = false;
}
Edge.h文件
#ifndef EDGE_H
#define EDGR_H
class Edge
{
public:
Edge(int nodeIndexA=0,int nodeIndexB=0,int weightValue=0);
int m_iNodeIndexA;
int m_iNodeIndexB;
int m_iWeightValue;
bool m_bSelected;
};
#endif
Edge.cpp文件
#include "Edge.h"
Edge::Edge(int nodeIndexA,int nodeIndexB,int weightValue)
{
m_iNodeIndexA = nodeIndexA;
m_iNodeIndexB = nodeIndexB;
m_iWeightValue = weightValue;
m_bSelected = false;
}
Cmap.h文件
#ifndef CMAP_H
#define CMAP_H
#include "Node.h"
#include "Edge.h"
#include <iostream>
#include <vector>
using namespace std;
class Cmap
{
public:
Cmap(int capacity);
~Cmap();
bool addNode(Node *pNode);
void resetNode();
bool setValueToMatrixForDirectedGraph(int row, int col, int val=1);
bool setValueToMatrixForUndirectedGraph(int row, int col, int val=1);
void printMatrix();
void depthFirstTraverse(int nodeIndex);
void breadthFirstTraverse(int nodeIndex);
void primTree(int nodeIndex);
void kruskalTree();
private:
bool getValueFromMatrix(int row,int col, int &val);
void breadthFirstTraverseImpl(vector<int> preVec);
int getMinEdge(vector<Edge> edgeVec);
bool isInSet(vector<int> nodeSet, int target);
void mergeNodeSet(vector<int> &nodeSetA, vector<int> nodeSetB);
int m_iCapacity;
int m_iNodeCount;
Node *m_pNodeArray;
int *m_pmatrix;
Edge *m_pEdge;
};
#endif
Camp.cpp文件
#include "Cmap.h"
#include <iostream>
#include <vector>
using namespace std;
Cmap::Cmap(int capacity)
{
m_iCapacity = capacity;
m_iNodeCount = 0;
m_pNodeArray = new Node[m_iCapacity];
m_pmatrix = new int[m_iCapacity*m_iCapacity];
for (int i=0;i<m_iCapacity*m_iCapacity;i++)
{
m_pmatrix[i] = 0;
}
m_pEdge = new Edge[m_iCapacity-1];
}
Cmap::~Cmap()
{
delete []m_pEdge;
delete []m_pNodeArray;
delete []m_pmatrix;
}
bool Cmap::addNode(Node *pNode)
{
if (pNode == NULL)
{
return false;
}
m_pNodeArray[m_iNodeCount].m_cData = pNode->m_cData;
m_iNodeCount++;
return true;
}
void Cmap::resetNode()
{
for (int i=0;i<m_iNodeCount;i++)
{
m_pNodeArray[i].m_bIsVisited = false;
}
}
bool Cmap::setValueToMatrixForDirectedGraph(int row, int col, int val)
{
if (row <0 || row >= m_iCapacity)
{
return false;
}
if (col <0 || col >= m_iCapacity)
{
return false;
}
m_pmatrix[row*m_iCapacity +col] = val;
return true;
}
bool Cmap::setValueToMatrixForUndirectedGraph(int row, int col, int val)
{
if (row <0 || row >= m_iCapacity)
{
return false;
}
if (col <0 || col >= m_iCapacity)
{
return false;
}
m_pmatrix[row*m_iCapacity +col] = val;
m_pmatrix[col *m_iCapacity + row] = val;
return true;
}
void Cmap::printMatrix()
{
for (int i=0;i<m_iCapacity;i++)
{
for (int j=0;j<m_iCapacity;j++)
{
cout << m_pmatrix[i*m_iCapacity+j] << " ";
}
cout << endl;
}
}
bool Cmap::getValueFromMatrix(int row,int col, int &val)
{
if (row <0 || row >= m_iCapacity)
{
return false;
}
if (col <0 || col >= m_iCapacity)
{
return false;
}
val = m_pmatrix[row*m_iCapacity + col];
return true;
}
void Cmap::depthFirstTraverse(int nodeIndex)
{
int value = 0;
cout << nodeIndex << ":" <<m_pNodeArray[nodeIndex].m_cData << " ";
m_pNodeArray[nodeIndex].m_bIsVisited = true;
for (int i=0;i<m_iCapacity;i++)
{
getValueFromMatrix(nodeIndex,i,value);
if (value == 1)
{
if (m_pNodeArray[i].m_bIsVisited)
{
continue;
}
else
{
depthFirstTraverse(i);
}
}
else
{
continue;
}
}
}
void Cmap::breadthFirstTraverse(int nodeIndex)
{
cout << nodeIndex << ":" << m_pNodeArray[nodeIndex].m_cData << " ";
m_pNodeArray[nodeIndex].m_bIsVisited = true;
vector<int> curVec;
curVec.push_back(nodeIndex);
breadthFirstTraverseImpl(curVec);
}
void Cmap::breadthFirstTraverseImpl(vector<int> preVec)
{
int value = 0;
vector<int> curVec;
for (int j =0; j<(int)preVec.size();j++)
{
for (int i=0; i<m_iCapacity;i++)
{
getValueFromMatrix(preVec[j],i,value);
if (value == 0)
{
continue;
}
else
{
if (!m_pNodeArray[i].m_bIsVisited)
{
cout << i << ":" << m_pNodeArray[i].m_cData << " ";
m_pNodeArray[i].m_bIsVisited = true;
curVec.push_back(i);
}
else
{
continue;
}
}
}
}
if (curVec.size() == 0)
{
return;
}
else
{
breadthFirstTraverseImpl(curVec);
}
}
void Cmap::primTree(int nodeIndex)
{
int value=0;
int edgeCount = 0;
vector<int> nodeVec;
vector<Edge> edgeVec;
cout << m_pNodeArray[nodeIndex].m_cData << endl;
nodeVec.push_back(nodeIndex);
m_pNodeArray[nodeIndex].m_bIsVisited = true;
while(edgeCount < m_iCapacity-1)
{
int temp = nodeVec.back();
for (int i=0; i<m_iCapacity;i++)
{
getValueFromMatrix(temp,i,value);
if (value != 0)
{
if (m_pNodeArray[i].m_bIsVisited)
{
continue;
}
else
{
Edge edge(temp,i,value);
edgeVec.push_back(edge);
}
}
}
int edgeIndex = getMinEdge(edgeVec);
edgeVec[edgeIndex].m_bSelected = true;
cout << edgeVec[edgeIndex].m_iNodeIndexA << "----" << edgeVec[edgeIndex].m_iNodeIndexB << ":";
cout << edgeVec[edgeIndex].m_iWeightValue << endl;
m_pEdge[edgeCount] = edgeVec[edgeIndex];
edgeCount++;
int nextNodeIndex = edgeVec[edgeIndex].m_iNodeIndexB;
nodeVec.push_back(nextNodeIndex);
m_pNodeArray[nextNodeIndex].m_bIsVisited = true;
cout << m_pNodeArray[nextNodeIndex].m_cData << endl;
}
}
int Cmap::getMinEdge(vector<Edge> edgeVec)
{
int minWeight = 0;
int edgeIndex = 0;
int i =0;
for (;i<edgeVec.size();i++)
{
if (!edgeVec[i].m_bSelected)
{
minWeight = edgeVec[i].m_iWeightValue;
edgeIndex = i;
}
}
if (minWeight == 0)
{
return -1;
}
int j=0;
for (;j<edgeVec.size();j++)
{
if (edgeVec[j].m_bSelected)
{
continue;
}
else
{
if (minWeight > edgeVec[j].m_iWeightValue)
{
minWeight = edgeVec[j].m_iWeightValue;
edgeIndex = j;
}
}
}
return edgeIndex;
}
void Cmap::kruskalTree()
{
int value = 0;
int edgeCount =0;
vector<vector<int>> nodeSets;
vector<Edge> edgeVec;
for (int i=0;i<m_iCapacity;i++)
{
for (int k=i+1;k<m_iCapacity;k++)
{
getValueFromMatrix(i,k,value);
if (value != 0)
{
Edge edge(i,k,value);
edgeVec.push_back(edge);
}
}
}
while (edgeCount < m_iNodeCount-1)
{
int minEdgeIndex = getMinEdge(edgeVec);
edgeVec[minEdgeIndex].m_bSelected = true;
int nodeAIndex = edgeVec[minEdgeIndex].m_iNodeIndexA;
int nodeBIndex = edgeVec[minEdgeIndex].m_iNodeIndexB;
bool nodeAIsInSet = false;
bool nodeBIsInSet = false;
int nodeAInSetLabel = -1;
int nodeBInSetLabel = -1;
for (int i=0;i<nodeSets.size();i++)
{
nodeAIsInSet = isInSet(nodeSets[i],nodeAIndex);
if (nodeAIsInSet)
{
nodeAInSetLabel = i;
}
}
for (int i=0;i<nodeSets.size();i++)
{
nodeBIsInSet = isInSet(nodeSets[i],nodeBIndex);
if (nodeBIsInSet)
{
nodeBInSetLabel = i;
}
}
if (nodeAInSetLabel == -1 && nodeBInSetLabel == -1)
{
vector<int> vec;
vec.push_back(nodeAIndex);
vec.push_back(nodeBIndex);
nodeSets.push_back(vec);
}
else if (nodeAInSetLabel == -1 && nodeBInSetLabel != -1)
{
nodeSets[nodeBInSetLabel].push_back(nodeAIndex);
}
else if (nodeAInSetLabel != -1 && nodeBInSetLabel == -1)
{
nodeSets[nodeAInSetLabel].push_back(nodeBIndex);
}
else if (nodeAInSetLabel != -1 && nodeBInSetLabel != -1 && nodeAInSetLabel != nodeBInSetLabel )
{
mergeNodeSet(nodeSets[nodeAInSetLabel],nodeSets[nodeBInSetLabel]);
for (int k=nodeBInSetLabel;k<(int)nodeSets.size()-1;k++)
{
nodeSets[k] = nodeSets[k+1];
}
}
else if (nodeAInSetLabel != -1 && nodeBInSetLabel != -1 && nodeAInSetLabel == nodeBInSetLabel )
{
continue;
}
m_pEdge[edgeCount] = edgeVec[minEdgeIndex];
edgeCount++;
cout << edgeVec[minEdgeIndex].m_iNodeIndexA << "--" <<edgeVec[minEdgeIndex].m_iNodeIndexB << ": ";
cout << edgeVec[minEdgeIndex].m_iWeightValue << endl;
}
}
bool Cmap::isInSet(vector<int> nodeSet, int target)
{
for (int i=0;i<nodeSet.size();i++)
{
if (nodeSet[i] == target)
{
return true;
}
}
return false;
}
void Cmap::mergeNodeSet(vector<int> &nodeSetA, vector<int> nodeSetB)
{
for (int i=0;i<nodeSetB.size();i++)
{
nodeSetA.push_back(nodeSetB[i]);
}
}
demo.cpp文件
#include "Cmap.h"
#include <iostream>
using namespace std;
int main()
{
Cmap *pMap = new Cmap(6);
Node *pNodeA = new Node('A');
Node *pNodeB = new Node('B');
Node *pNodeC = new Node('C');
Node *pNodeD = new Node('D');
Node *pNodeE = new Node('E');
Node *pNodeF = new Node('F');
pMap->addNode(pNodeA);
pMap->addNode(pNodeB);
pMap->addNode(pNodeC);
pMap->addNode(pNodeD);
pMap->addNode(pNodeE);
pMap->addNode(pNodeF);
pMap->setValueToMatrixForUndirectedGraph(0,1,6);
pMap->setValueToMatrixForUndirectedGraph(0,4,5);
pMap->setValueToMatrixForUndirectedGraph(0,5,1);
pMap->setValueToMatrixForUndirectedGraph(1,2,3);
pMap->setValueToMatrixForUndirectedGraph(1,5,2);
pMap->setValueToMatrixForUndirectedGraph(2,5,8);
pMap->setValueToMatrixForUndirectedGraph(2,3,7);
pMap->setValueToMatrixForUndirectedGraph(3,5,4);
pMap->setValueToMatrixForUndirectedGraph(3,4,2);
pMap->setValueToMatrixForUndirectedGraph(4,5,9);
pMap->printMatrix();
cout << "普利姆算法的结果:" <<endl;
pMap->primTree(0);
cout << "克鲁斯卡尔算法的结果:" <<endl;
pMap->kruskalTree();
delete pMap;
pMap = NULL;
system("pause");
return 0;
}