连接矩阵的简单创建
#include<iostream>
#define max 100
#define num 10
using namespace std;
class Mgraph
{
public:
char a[num];//矩阵的顶点集合
int b[num][num]; //矩阵的边的集合
int num_v;//矩阵的顶点的数量
int num_e;// 矩阵的边的数量
};
void great(Mgraph& s)
{
int i, j, k, l;
cout << "输入顶点数:";
cin >> s.num_v;
cout << "输入顶点信息:";
for (i = 0; i < s.num_v; i++)
cin >> s.a[i];
cout << "输入边的个数";
cin >> s.num_e;
for (i = 0; i < s.num_v; i++)
{
for (j = 0; j < s.num_v; j++)
{
cout << "输入" << i << "," << j << "边:"; cin >> s.b[i][j];
}
}
}
int main(void)
{
Mgraph s;
great(s);
for (int i = 0; i < s.num_v; i++)
{
for (int j = 0; j < s.num_v; j++)
cout << s.b[i][j] << " ";
cout << endl;
}
return 0;
}