graph_adjacency_lists

# -*- mode: snippet -*-
# name: Graph (adjacency lists)
# key: graph
# --
int n, m;
cin >> n >> m;

vector<list<int>> ${1:adjacent};
$1.resize(n + 1);
for (int i = 0; i < m; ++i) {
  int u, v;
  cin >> u >> v;
  $1[u].push_back(v);
  ${2://}$1[v].push_back(u);
}