图论
胡十八
这个作者很懒,什么都没留下…
展开
-
0-1MST(缩点dfs)
B. 0-1 MSTtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputUjan has a lot of useless stuff in his drawers, a considerable part of which are his...原创 2019-11-15 20:11:15 · 240 阅读 · 0 评论 -
判断最小生成树是否唯一
The Unique MSTGiven a connected undirected graph, tell if its minimum spanning tree is unique.Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is...原创 2019-11-03 12:00:16 · 257 阅读 · 0 评论 -
拓扑排序
拓扑排序类似于a<b,c<b,d<c,可以找到一个关系是a<d<c<b。意思就是有好几件事ABCD,B要在A后面做,C要在B后面做等等,然后对每个事件的先后顺序进行排序。做法就是每次删除一个入度为零的点,而这个点指向的点的入度就减一,循环下去直到所有结点被找出来。如果排序失败,表示有环。#include<iostream>#include&l...原创 2019-09-13 15:59:21 · 143 阅读 · 0 评论