题目描述:
假设图用邻接矩阵存储。输入图的顶点信息和边信息,完成邻接矩阵的设置,并计算各顶点的入度、出度和度,并输出图中的孤立点(度为0的顶点)
输入:
测试次数T,每组测试数据格式如下:
图类型 顶点数 (D—有向图,U—无向图)
顶点信息
边数
每行一条边(顶点1 顶点2)或弧(弧尾 弧头)信息
输出:
每组测试数据输出如下信息(具体输出格式见样例):
图的邻接矩阵
按顶点信息输出各顶点的度(无向图)或各顶点的出度 入度 度(有向图)。孤立点的度信息不输出。
图的孤立点。若没有孤立点,不输出任何信息。
输入样例1:
2
D 5
V1 V2 V3 V4 V5
7
V1 V2
V1 V4
V2 V3
V3 V1
V3 V5
V4 V3
V4 V5
U 5
A B C D E
5
A B
A C
B D
D C
A D
输出样例1:
0 1 0 1 0
0 0 1 0 0
1 0 0 0 1
0 0 1 0 1
0 0 0 0 0
V1: 2 1 3
V2: 1 1 2
V3: 2 2 4
V4: 2 1 3
V5: 0 2 2
0 1 1 1 0
1 0 0 1 0
1 0 0 1 0
1 1 1 0 0
0 0 0 0 0
A: 3
B: 2
C: 2
D: 3
E
代码如下:
#include<iostream>
using namespace std;
const int MAX = 100;
class AMGraph
{
private:
int vexnum;
char type;
string* vexs;
int** arcs;
public:
AMGraph()
{
}
// 创建图
void CreatGraph(char ch, int vnum)
{
vexnum = vnum;
type = ch;
// 顶点信息
vexs = new string[vexnum];
for (int i = 0; i < vexnum; i++)
{
cin >> vexs[i];
}
// 邻接矩阵创建
arcs = new int* [vexnum];
for (int i = 0; i < vexnum; i++)
{
arcs[i] = new int[vexnum];
}
// 邻接矩阵初始化
for (int i = 0; i < vexnum; i++)
{
for (int j = 0; j < vexnum; j++)
{
arcs[i][j] = 0;
}
}
//边的数量
int arcnum;
cin >> arcnum;
//邻接矩阵填边
for (int i = 0; i < arcnum; i++)
{
string c1, c2;
cin >> c1 >> c2;
int index_i = 0;
int index_j = 0;
//在顶点信息中找两个顶点的下标
for (int j = 0; j < vexnum; j++)
{
if (c1 == vexs[j])
{
index_i = j;
break;
}
}
for (int j = 0; j < vexnum; j++)
{
if (c2 == vexs[j])
{
index_j = j;
break;
}
}
//邻接矩阵里按照两顶点坐标分别做一个行标一个列标来填1
//先看是有向图还是无向图,D-有向,U-无向
if (ch == 'D')
{
arcs[index_i][index_j] = 1;
}
else if (ch == 'U')
{
arcs[index_i][index_j] = 1;
arcs[index_j][index_i] = 1;
}
}
}
//计算入度,出度,度并输出
void du()
{
int rudu, chudu, sumdu;
if (type == 'D')
{
for (int i = 0; i < vexnum; i++)
{
chudu = 0;
rudu = 0;
for (int j = 0; j < vexnum; j++)
{
if (arcs[i][j] == 1)
{
chudu++;
}
if (arcs[j][i] == 1)
{
rudu++;
}
}
if (chudu != 0 || rudu != 0)
{
cout << vexs[i] << ": " << chudu << " " << rudu << " " << chudu + rudu << endl;
}
else
{
cout << vexs[i] << endl;
}
}
}
else if (type == 'U')
{
for (int i = 0; i < vexnum; i++)
{
sumdu = 0;
for (int j = 0; j < vexnum; j++)
{
if (arcs[i][j] == 1)
{
sumdu++;
}
}
if (sumdu != 0)
{
cout << vexs[i] << ": " << sumdu << endl;
}
else
{
cout << vexs[i] << endl;
}
}
}
}
//邻接矩阵输出
void display()
{
for (int i = 0; i < vexnum; i++)
{
for (int j = 0; j < vexnum; j++)
{
if (j< vexnum-1)
{
cout << arcs[i][j] << ' ';
}
else
{
cout << arcs[i][j] << endl;
}
}
}
}
};
int main()
{
int n;
cin >> n;
while (n--)
{
char ch;
int vnum;
cin >> ch >> vnum;
AMGraph a;
a.CreatGraph(ch, vnum);
a.display();
a.du();
}
return 0;
}