连通图
BYSora
这个作者很懒,什么都没留下…
展开
-
山东省第六届ACM省赛题——Circle of Friends(强连通分量+dfs)
题目描述 Nowadays, “Circle of Friends” is a very popular social networking platform in WeChat. We can share our life to friends through it or get other’s situation. Similarly, in real life, there is also原创 2016-05-24 20:13:51 · 1173 阅读 · 0 评论 -
poj2553——The Bottom of a Graph(强连通分量)
DescriptionWe will use the following (standard) definitions from graph theory. Let V be a nonempty and finite set, its elements being called vertices (or nodes). Let E be a subset of the Cartesian prod原创 2016-05-08 08:52:41 · 1181 阅读 · 0 评论 -
poj1236——Network of Schools(加最少边组成强连通分量)
DescriptionA number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list of schools to which it distributes software (the “re原创 2016-05-07 13:50:29 · 1135 阅读 · 0 评论 -
poj2186——Popular Cows(tarjan算法)
DescriptionEvery cow’s dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1 <= M <= 50,000) ordered pairs of the form (A, B) that tell y原创 2016-05-04 16:55:09 · 982 阅读 · 0 评论 -
HDU1269——迷宫城堡(有向图求强连通分量,Tarjan算法)
Description 为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N<=10000)和M条通道(M<=100000),每个通道都是单向的,就是说若称某通道连通了A房间和B房间,只说明可以通过这个通道由A房间到达B房间,但并不说明通过它可以由B房间到达A房间。Gardon需要请你写个程序确认一下是否任意两个房间都是相互连通的,即:对于任意的i和j,至少存在一条路径可以原创 2015-12-03 19:19:38 · 723 阅读 · 0 评论 -
poj3177——Redundant Paths(双连通分量)
DescriptionIn order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the Tree of Rotten App原创 2016-10-17 20:03:59 · 536 阅读 · 0 评论 -
poj3352——Road Construction(双连通分量)
DescriptionIt’s almost summer time, and that means that it’s almost summer construction time! This year, the good people who are in charge of the roads on the tropical island paradise of Remote Island原创 2017-04-28 20:19:47 · 1062 阅读 · 0 评论 -
poj3177——Redundant Paths(双连通分量)
DescriptionIn order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the Tree of Rotten App原创 2017-04-28 20:22:26 · 1149 阅读 · 0 评论