Commit 0b680cd

committed

Migrate more code

1 parent f5ea4b9 commit 0b680cdCopy full SHA for 0b680cd

File tree

+133

-0

lines changed

+133

-0

lines changed

Lines changed: 30 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,30 @@`
	`1`	`+/*`
	`2`	`+ * Dijkstra's shortest path algorithm`
	`3`	`+ */`
	`4`	`+`
	`5`	`+typedef pair<int, int> ipair;`
	`6`	`+`
	`7`	`+int V, E;`
	`8`	`+vector<pair<int, int>> graph[20001];`
	`9`	`+vector<int> dist;`
	`10`	`+const int INF = 987654321;`
	`11`	`+`
	`12`	`+void dijkstra(int s) {`
	`13`	`+ dist.assign(V + 1, INF);`
	`14`	`+ dist[s] = 0;`
	`15`	`+ priority_queue<ipair, vector<ipair>, greater<ipair>> pq;`
	`16`	`+ pq.push(make_pair(0, s));`
	`17`	`+ while (!pq.empty()) {`
	`18`	`+ auto front = pq.top();`
	`19`	`+ pq.pop();`
	`20`	`+ int d = front.first, u = front.second;`
	`21`	`+ if (d > dist[u]) continue;`
	`22`	`+ for (int j = 0; j < graph[u].size(); ++j) {`
	`23`	`+ auto v = graph[u][j];`
	`24`	`+ if (dist[u] + v.second < dist[v.first]) {`
	`25`	`+ dist[v.first] = dist[u] + v.second;`
	`26`	`+ pq.push(make_pair(dist[v.first], v.first));`
	`27`	`+ }`
	`28`	`+ }`
	`29`	`+ }`
	`30`	`+}`

Lines changed: 43 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,43 @@`
	`1`	`+/*`
	`2`	`+ * Edmonds-Karp algorithm`
	`3`	`+ */`
	`4`	`+`
	`5`	`+const int MAX_V = 111;`
	`6`	`+const int INF = 1 << 30;`
	`7`	`+`
	`8`	`+int graph[MAX_V][MAX_V], mf, f, s, t;`
	`9`	`+vector<int> parent;`
	`10`	`+`
	`11`	`+void augment(int v, int min_edge) {`
	`12`	`+ if (v == s)`
	`13`	`+ f = min_edge;`
	`14`	`+ else if (parent[v] != -1) {`
	`15`	`+ augment(parent[v], min(min_edge, graph[parent[v]][v]));`
	`16`	`+ graph[parent[v]][v] -= f;`
	`17`	`+ graph[v][p[v]] += f;`
	`18`	`+ }`
	`19`	`+}`
	`20`	`+`
	`21`	`+int maxflow() {`
	`22`	`+ mf = 0;`
	`23`	`+ while (true) {`
	`24`	`+ f = 0;`
	`25`	`+ vector<int> dist(MAX_V, INF);`
	`26`	`+ dist[s] = 0;`
	`27`	`+ queue<int> q;`
	`28`	`+ q.push(s);`
	`29`	`+ parent.assign(MAX_V, -1);`
	`30`	`+ while (!q.empty()) {`
	`31`	`+ int u = q.front();`
	`32`	`+ q.pop();`
	`33`	`+ if (u == t) break;`
	`34`	`+ for (int v = 0; v < MAX_V; ++v)`
	`35`	`+ if (graph[u][v] > 0 && dist[v] == INF)`
	`36`	`+ dist[v] = dist[u] + 1, q.push(v), parent[v] = u;`
	`37`	`+ }`
	`38`	`+ augment(t, INF);`
	`39`	`+ if (f == 0) break;`
	`40`	`+ mf += f;`
	`41`	`+ }`
	`42`	`+ return mf;`
	`43`	`+}`

Lines changed: 37 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,37 @@`
	`1`	`+/*`
	`2`	`+ * Floyd-Warshall algorithm & path reconstruction`
	`3`	`+ */`
	`4`	`+`
	`5`	`+const int MAX_V = 400, INF = 987654321;`
	`6`	`+int dist[MAX_V][MAX_V], next_edge[MAX_V][MAX_V], V;`
	`7`	`+`
	`8`	`+void init() {`
	`9`	`+ memset(next_edge, -1, sizeof next_edge);`
	`10`	`+ for (int i = 0; i < V; ++i)`
	`11`	`+ for (int j = 0; j < V; ++j)`
	`12`	`+ dist[i][j] = INF;`
	`13`	`+}`
	`14`	`+`
	`15`	`+void floyd_warshall() {`
	`16`	`+ for (int k = 0; k < V; ++k) {`
	`17`	`+ for (int i = 0; i < V; ++i) {`
	`18`	`+ for (int j = 0; j < V; ++j) {`
	`19`	`+ if (dist[i][j] > dist[i][k] + dist[k][j]) {`
	`20`	`+ dist[i][j] = dist[i][k] + dist[k][i];`
	`21`	`+ next_edge[i][j] = next_edge[i][k];`
	`22`	`+ }`
	`23`	`+ }`
	`24`	`+ }`
	`25`	`+ }`
	`26`	`+}`
	`27`	`+`
	`28`	`+vector<int> path(int u, int v) {`
	`29`	`+ vector<int> result;`
	`30`	`+ if (next_edge[u][v] == -1) return result;`
	`31`	`+ path.push_back(u);`
	`32`	`+ while (u != v) {`
	`33`	`+ u = next_edge[u][v];`
	`34`	`+ result.push_back(u);`
	`35`	`+ }`
	`36`	`+ return result;`
	`37`	`+}`

Lines changed: 8 additions & 0 deletions

Lines changed: 15 additions & 0 deletions

Comments

(0)