数据结构实验-无向图-通信网络的建立
内容：
项目名称：通信网构建 项目内容：
在 n 个城市之间建立通信联络网，则连通 n 个城市只需要 n-1 条线路。
要求在 最节省经费的前提下建立这个通信网。
（1） 完成城市信息的输入。
（2） 完成城市信息的编辑，包括城市以及城市间距离的增加，删除，信息修改等。
（3） 允许用户指定下列两种策略进行通信网的构建
1.采用 Prim 算法进行通信网的构建；
2.采用 Kruskal 算法进行通信网的构建；
代码实现：
main函数：
#include图的头文件声明Graph.h：
#pragma once
#define numMAX 20
#define StrMAX 100
#define MAX 1000
#include头文件的实现Graph.cpp
#include"Graph.h"
Graph::Graph(){
for (int i = 0; i < numMAX; i++) {
for (int j = 0; j < numMAX; j++) {
if (i == j)
this->AdjMatrix[i][j] = 0;
else
this->AdjMatrix[i][j] = 10000;
}
}
this->VexNum = 0;
}
Graph::~Graph() {
}
bool Graph::InsertVex(Vex svex) {
for (int i = 0; i < this->Vexs.GetLength(); i++) {
Vex a;
this->Vexs.GetElem(i, a);
if (a.code == svex.code && a.Name == svex.Name)
cout << "顶点存在" << endl;
}
if (this->VexNum < numMAX) {
this->Vexs.InsertElem(svex);
this->VexNum++;
return 1;
}
else {
cout << "顶点达到最大容量" << endl;
return 0;
}
}
bool Graph::DeleteVex(Vex svex) {
int sign = 0;
Vex a;
for (int i = 0; i < this->Vexs.GetLength(); i++) {
this->Vexs.GetElem(i, a);
if (a.code._Equal(svex.code)) {
this->Vexs.DeleteElem(i, a);
this->VexNum--;
sign = 1;
break;
}
}
for (int m = 0; m < this->Edges.GetLength(); m++) {
Edge e;
this->Edges.GetElem(m, e);
if (e.vex1.code._Equal(a.code) | a.code._Equal(e.vex2.code)) {
Edges.DeleteElem(m, e);
m--;
int p = (int)(e.vex1.code[1] - '0');
int n = (int)(e.vex2.code[1] - '0');
this->AdjMatrix[p][n] = 1000;
this->AdjMatrix[n][p] = 1000;
}
}
if (sign == 0)
return 0;
else
return 1;
}
bool Graph::UpdateVex(Vex svex) {
int sign = 0;
Vex a;
for (int i = 0; i < this->Vexs.GetLength(); i++) {
this->Vexs.GetElem(i, a);
if (a.code == svex.code) {
this->Vexs.SetElem(i, svex);
sign = 1;
break;
}
}
if (sign == 0)
return 0;
else
return 1;
}
bool Graph::InsertEdges(Edge sedge) {
int sign = 0;
Edge a;
for (int i = 0; i < this->Edges.GetLength(); i++) {
this->Edges.GetElem(i, a);
if (a.vex1.code == sedge.vex1.code && a.vex2.code == sedge.vex2.code)
sign = 1;
if (a.vex1.code == sedge.vex2.code && a.vex2.code == sedge.vex2.code)
sign = 1;
}
if (sign == 0) {
this->Edges.InsertElem(sedge);
int m = (int)(sedge.vex1.code[1] - '0');
int n = (int)(sedge.vex2.code[1] - '0');
this->AdjMatrix[m][n] = sedge.weight;
this->AdjMatrix[n][m] = sedge.weight;
return 1;
}
else {
cout << "这条边已经存在" << endl;
return 0;
}
}
bool Graph::DeleteEdges(Edge sedge) {
int sign = 0;
Edge a;
for (int i = 0; i < this->Edges.GetLength(); i++) {
this->Edges.GetElem(i, a);
if ((a.vex1.code == sedge.vex1.code && a.vex2.code == sedge.vex2.code)
|| (a.vex1.code == sedge.vex2.code && a.vex2.code == sedge.vex2.code)) {
Edges.DeleteElem(i, a);
sign = 1;
}
}
if (sign == 1) {
int m = (int)(sedge.vex1.code[1] - '0');
int n = (int)(sedge.vex2.code[1] - '0');
this->AdjMatrix[m][n] = 1000;
this->AdjMatrix[n][m] = 1000;
cout << "删除成功" << endl;
return 1;
}
else {
cout << "这条边不存在" << endl;
return 0;
}
}
bool Graph::UpdateEdges(Edge sedge) {
int sign = 0;
Edge a;
for (int i = 0; i < this->Edges.GetLength(); i++) {
this->Edges.GetElem(i, a);
if ((a.vex1.code == sedge.vex1.code && a.vex2.code == sedge.vex2.code)
|| (a.vex1.code == sedge.vex2.code && a.vex2.code == sedge.vex2.code)) {
Edges.SetElem(i, sedge);
sign = 1;
}
}
if (sign == 1) {
cout << "更新成功" << endl;
return 1;
}
else {
cout << "更新失败" << endl;
return 0;
}
}
Edge Graph::GetEdge(char* vex1Code, char* vex2Code) {
int sign = 0;
Edge a;
for (int i = 0; i < this->Edges.GetLength(); i++) {
this->Edges.GetElem(i, a);
if ((a.vex1.code[1] ==*vex1Code && a.vex2.code[1] ==*vex2Code)
|| (a.vex1.code[1] == *vex2Code && a.vex2.code[1] == *vex2Code)) {
Edges.GetElem(i, a);
sign = 1;
}
}
if (sign == 0) {
return a;
}
else {
cout << "查找失败" << endl;
return a;
}
}
Vex Graph::GetVex(char* vex1Code) {
int sign = 0;
Vex a;
for (int i = 0; i < this->Vexs.GetLength(); i++) {
this->Vexs.GetElem(i, a);
if (a.code[1] == *vex1Code) {
Vexs.GetElem(i, a);
sign = 1;
}
}
if (sign == 0) {
return a;
}
else {
cout << "查找失败" << endl;
return a;
}
}
void Graph::SetVexNum(int) {
this->VexNum = Vexs.GetLength();
}
int Graph::PrimMinTree(Edge aPath[]) {
cout << "prim算法实现最小生成树" << endl;
//从第一个点出发
int x = 1;
//记录他的链接顶点
int closest[numMAX];
//记录最短边
int min;
//记录链接点上的权值
int lowcost[numMAX];
//数组初始化
for (int i = 1; i <= this->VexNum; i++) {
lowcost[i] = AdjMatrix[x][i];
closest[i] = x;
}
int i = 1;
int j;
int k;
for (j = 2; j <= this->VexNum; j++) {
min = 10000;
for (k = 1; k <= this->VexNum; k++) {
if ((lowcost[k] < min) && (lowcost[k] != 0)) {
min = lowcost[k];
i = k;
}
}
lowcost[i] = 0;
for (k = 1; k <= this->VexNum; k++) {
if (lowcost[k] > AdjMatrix[k][i]) {
lowcost[k] = AdjMatrix[k][i];
closest[k] = i;
}
}
}
for (j = 2; j <= this->VexNum; j++) {
cout << "v"<<j << "-" << "v"<<closest[j] << endl;
}
return 0;
}
int Graph::KruskalMinTree(Edge aPath[]) {
cout << "Kruskal算法实现最小生成树" << endl;
//取出边
Edge mEdges[MAX];
int numEdges = this->Edges.GetLength();
for (int i = 0; i < numEdges; i++) {
Edges.GetElem(i, mEdges[i]);
}
//把边按从小到大排列
for (int i = 0; i < numEdges; i++) {
for (int j = 0; j < numEdges - 1; j++) {
Edge a;
if (mEdges[j].weight > mEdges[j + 1].weight) {
a = mEdges[j];
mEdges[j] = mEdges[j + 1];
mEdges[j + 1] = a;
}
}
}
//定义一个边数组
Edge outEdges[MAX];
//记录合格的边
int outNumber = 0;
int numberEdges = 0;
//循环判断合格边并加入
while (outNumber < this->VexNum-1&&numberEdges<=this->Edges.GetLength()) {
outEdges[outNumber] = mEdges[numberEdges];
outNumber++;
if (isConnect(mEdges[numberEdges], outEdges,outNumber)) {
outNumber--;
}
numberEdges++;
}
//达标输出，不达标则不输出
if (outNumber == this->Vexs.GetLength() - 1) {
for (int i = 0; i < outNumber; i++) {
cout<<outEdges[i].vex1.code << "-" << outEdges[i].vex2.code << "权值：" << outEdges[i].weight << endl;
}
}
else {
cout << "这些边构不成一颗最小生成树" << endl;
}
return 0;
}
bool Graph::isConnect(Edge b, Edge outEdges[], int n) {
typedef struct d {
Vex a;
int num=0;
}D;
D d[MAX];
int sumD = 0;
//统计顶点和度
for (int i = 0; i < n; i++) {
int sign = 0;
int sign2 = 0;
for (int j = 0; j < sumD; j++) {
if (d[j].a.code == outEdges[i].vex1.code) {
d[j].num++;
sign = 1;
}
if (d[j].a.code == outEdges[i].vex2.code) {
d[j].num++;
sign2 = 1;
}
}
if (sign == 0) {
d[sumD].a.code = outEdges[i].vex1.code;
d[sumD].a.Name = outEdges[i].vex1.Name;
d[sumD].num++;
sumD++;
}
if (sign2 == 0) {
d[sumD].a.code = outEdges[i].vex2.code;
d[sumD].a.Name = outEdges[i].vex2.Name;
d[sumD].num++;
sumD++;
}
}
//利用拓扑排序判断是否有环路
while (1) {
//判断是否结束循环
int sign = 0;
for (int i = 0; i < sumD; i++) {
if (d[i].num == 1)
sign = 1;
}
if (sign == 0) {
if (sumD == 0||sumD==1)
return 0;
else
return 1;
}
else {
for (int j = 0; j < sumD; j++) {
if (d[j].num == 1) {
for (int m = 0; m < n; m++) {
if (outEdges[m].vex1.code == d[j].a.code) {
for (int p = 0; p < sumD; p++) {
if (d[p].a.code == outEdges[m].vex2.code)
d[p].num--;
}
}
if (outEdges[m].vex2.code == d[j].a.code) {
for (int p = 0; p < sumD; p++) {
if (d[p].a.code == outEdges[m].vex1.code)
d[p].num--;
}
}
}
for (int p = j; p < sumD-1; p++) {
d[p] = d[p + 1];
}
sumD--;
}
}
//去掉度为0的顶点
for (int q = 0; q < sumD; q++) {
if (d[q].num == 0) {
for (int k = q; k < sumD - 1; k++) {
d[k] = d[k + 1];
}
sumD--;
}
}
}
}
}
void Graph::showMassage() {
cout << "顶点信息：" << endl;
for (int i = 0; i < this->Vexs.GetLength(); i++) {
Vex a;
this->Vexs.GetElem(i, a);
cout << a.code << "--" << a.Name << endl;
}
cout << "边信息：" << endl;
for (int j = 0; j < this->Edges.GetLength(); j++) {
Edge b;
this->Edges.GetElem(j, b);
cout << b.vex1.code << "--" << b.vex2.code << "权值：" << b.weight << endl;
}
}栈的实现SqList.hpp
#pragma once
#ifndef __SQ_LIST_H__
#endif
#define __SQ_LIST_H__
// ANSI C++标准库头文件
#include