图论--拓扑排序
exmy
Less is more, and more is less.
展开
-
poj--3249 Test for Job(topsort + dp)
Test for Job题解DAG图上的单源最短路径。#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <vector> using namespace std;const int maxn = 100000 + 5; const int maxe = 1000000 + 5;原创 2016-09-23 20:48:29 · 410 阅读 · 0 评论 -
UVa--10305 Ordering Tasks(拓扑排序)
UVa 10305题解简单的拓扑排序。#include <bits/stdc++.h> using namespace std;const int maxn = 100 + 5; int graph[maxn][maxn]; int indegree[maxn]; int n, m;void topo() { queue<int> Q; vector<int> ans; for原创 2016-02-20 15:33:28 · 472 阅读 · 0 评论 -
hdoj 4109--Instrction Arrangement(topsort)
题解实际上就是按照拓扑序求关键路径。#include <cstdio> #include <queue> #include <vector> #include <cstring> using namespace std;const int maxn = 1000 + 10; int n, m;struct Edge{ int v, w, next; }edge[10010];int head原创 2017-09-16 17:25:01 · 466 阅读 · 0 评论