#include "MGraph.h"
#include <iostream>
using namespace std;
int main()
{
int i;
char ch[] = { 'A','B','C','D'};
cout << "【依次输入每一条边的两个顶点的编号】：\n";
MGraph<char> MG{ch, 4, 4}; // 建立具有4个顶点 4条边的无向图
for (i = 0; i < MaxSize; i++) {
visited[i] = 0;
}
cout << "\n【深度优先遍历序列】：";
MG.DFTraveres(0); // 从顶点0出发进行深度优先遍历
for (i = 0; i < MaxSize; i++) {
visited[i] = 0;
}
cout << "\n【广度优先遍历序列】：";
MG.BFTraveres(0); // 从顶点0出发进行广度优先遍历
cout << endl;
for (i = 0; i < MaxSize; i++) {
visited[i] = 0;
}
cout << "\n【判断图的连通性】：";
MG.isConnected();
for (i = 0; i < MaxSize; i++) {
visited[i] = 0;
}
cout << "\n【各顶点的度】：\n";
MG.calculateDegree();
for (i = 0; i < MaxSize; i++) {
visited[i] = 0;
}
cout << "\n【Prim算法的最小生成树】：(起点-终点 权重)\n";
MG.Prim(0); // 从顶点0出发进行Prim算法
return 0;
}
