ACM常用模板合集

// 深度優先遍歷框架 void dfs(int x) {v[x] = 1;for (int i = head[x]; i; i = next[i]) {int y = ver[i];if (v[y]) continue;dfs(y);} }// DFS序 void dfs(int x) {a[++m] = x;v[x] = 1;for (int i = head[x]; i; i = next[i]) {int y = ver[i];if (v[y]) continue;dfs(y);}a[++m] = x; }// 求樹中各點的深度 void dfs(int x) {v[x] = 1;for (int i = head[x]; i; i = next[i]) {int y = ver[i];if (v[y]) continue; // 點y已經被訪問過了d[y] = d[x] + 1;dfs(y);} }// 求樹的重心 void dfs(int x) {v[x] = 1; size[x] = 1; // 子樹x的大小int max_part = 0; // 刪掉x后分成的最大子樹的大小for (int i = head[x]; i; i = next[i]) {int y = ver[i];if (v[y]) continue; // 點y已經被訪問過了dfs(y);size[x] += size[y];max_part = max(max_part, size[y]);}max_part = max(max_part, n - size[x]);if (max_part < ans) {ans = max_part;pos = x;} }// 劃分圖的連通塊 void dfs(int x) {v[x] = cnt;for (int i = head[x]; i; i = next[i]) {int y = ver[i];if (v[y]) continue;dfs(y);} } for (int i = 1; i <= n; i++)if (!v[i]) {cnt++;dfs(i);}// 廣度優先遍歷框架 void bfs() {memset(d, 0, sizeof(d));queue<int> q;q.push(1); d[1] = 1;while (q.size()) {int x = q.front(); q.pop();for (int i = head[x]; i; i = next[i]) {int y = ver[i];if (d[y]) continue;d[y] = d[x] + 1;q.push(y);}} }// 拓撲排序 void add(int x, int y) { // 在鄰接表中添加一條有向邊ver[++tot] = y, next[tot] = head[x], head[x] = tot;deg[y]++; } void topsort() {queue<int> q;for (int i = 1; i <= n; i++)if (deg[i] == 0) q.push(i);while (q.size()) {int x = q.front(); q.pop();a[++cnt] = x;for (int i = head[x]; i; i = next[i]) {int y = ver[i];if (--deg[y] == 0) q.push(y);}} } int main() {cin >> n >> m; // 點數、邊數for (int i = 1; i <= m; i++) {int x, y;scanf("%d%d", &x, &y);add(x, y);}topsort();for (int i = 1; i <= cnt; i++)printf("%d ", a[i]);cout << endl; }

總結

以上是生活随笔為你收集整理的信息竞赛进阶指南--搜索相关（模板）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。