图的存储 邻接矩阵
作者:
Unkillable
,
2023-05-20 10:15:59
,
所有人可见
,
阅读 152
#include<bits/stdc++.h>
using namespace std;
const int N = 150;
int G[N][N];
const int oo = 0x7f;//很大的值
int n, m;
int i, j, w;
int main()
{
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
G[i][j] = oo;
printf("输入%d条边\n", m);
for(int k = 1; k <= m; k++)
{
scanf("%d %d %d", &i, &j, &w);
G[i][j] = G[j][i] = w;
}
printf("\n输出顶点和边权\n");
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(G[i][j] < oo)
printf("%d %d %d\n", i, j, G[i][j]);
return 0;
}