图的几种存储方式

邻接矩阵

#include <iostream>
#include <cstring>
using namespace std;

const int MAXN = 1e3 + 10;

int g[MAXN][MAXN], n;

int main() {
    memset(g, 0x3f, sizeof(g));
    cin >> n;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++)
           cin >> g[i][j];
    return 0;
}