![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM 拓扑排序
南极亚拉
这个作者很懒,什么都没留下…
展开
-
拓扑排序模板
邻接矩阵版 int vis[MAXN]; int topo[MAXN]; int graph[MAXN][MAXN];邻接矩阵 int index, n; bool dfs(int u) { vis[u] = -1;//表示这个点正在被访问 for (int v = 0; v < n; v++) { if (vis[graph[u][v]]) { if (vis[v] < 0原创 2017-08-26 17:10:02 · 137 阅读 · 0 评论 -
hdoj 2647 Reward(拓扑排序+队列)
Reward Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9919 Accepted Submission(s): 3166 Problem Description Dandelion's uncle i原创 2017-09-10 22:32:01 · 263 阅读 · 0 评论 -
HDOJ 3342 Legal or Not(拓扑排序)队列做法和DFS做法
Legal or Not Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9169 Accepted Submission(s): 4254 Problem Description ACM-DIY is a原创 2017-09-11 13:08:19 · 164 阅读 · 0 评论