C++ 图论：邻接表存储和遍历示例

#include #include using namespace std;

int main() { int n, m; cin >> n >> m; vector<vector> g(n+1); for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; g[x].push_back(y); g[y].push_back(x); } for (int i = 1; i < g[1].size(); i++) { cout << g[1][i]; } return 0; }