圖由三種表示方式：鄰接列表丽啡，鄰接矩陣顽分，邊列表确虱。這道題考察前兩種編程實(shí)現(xiàn)觅彰。
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n, m;
vector<int> adjlist[1001];
int adjmatrix[1001][1001];
int main() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int u, v;
cin >> u >> v;
adjlist[u].push_back(v);
adjlist[v].push_back(u);
adjmatrix[u][v] = 1;
adjmatrix[v][u] = 1;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cout << adjmatrix[i][j] << ' ';
}
cout << endl;
}
for (int i = 1; i <= n; i++) {
sort(adjlist[i].begin(),adjlist[i].end());
cout << adjlist[i].size() << ' ';
for (auto e : adjlist[i]) {
cout << e << ' ';
}
cout << endl;
}
return 0;
}
