qq_15054345的博客

原创 图的邻接链表的三种写法

const int N = 1e5+1; struct Edge { int to; int w; Edge(int t = 0, int w_ = 0) : to(t), w(w_) {} }; vector<Edge> H1[N]; vector<vector<Edge>> H2; vector<unordered_map<int, int>> H3; int main() { H2.resize(.