![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
强连通
左眼皮跳跳~
这个作者很懒,什么都没留下…
展开
-
hdu 1269 迷宫城堡(强连通 tarjan )
Problem Description 为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N Input 输入包含多组数据,输入的第一行有两个数:N和M,接下来的M行每行有两个数a和b,表示了一条通道可以从A房间来到B房间。文件最后以两个0结束。 Output 对于输入的每组数据,如果任意两个房间都是相互连接的,输出"Yes",否则输出"No原创 2015-03-01 22:33:50 · 541 阅读 · 0 评论 -
poj Popular Cows(tarjan +缩点)
Language: Default Popular Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 24384 Accepted: 10007 Description Every cow's dream is to become the mos原创 2015-03-02 23:20:49 · 493 阅读 · 0 评论 -
POJ 1904 King's Quest(强连通)
Language: Default King's Quest Time Limit: 15000MS Memory Limit: 65536K Total Submissions: 7635 Accepted: 2769 Case Time Limit: 2000MS Description Once upon原创 2015-03-20 11:02:11 · 727 阅读 · 0 评论 -
HDU 4685 Prince and Princess(二分图 + 强连通)
Problem Description There are n princes and m princesses. Princess can marry any prince. But prince can only marry the princess they DO love. For all princes,give all the princesses that they love.原创 2015-03-20 22:38:23 · 687 阅读 · 0 评论 -
poj 3352 Road Construction(双联通)
Road Construction Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10191 Accepted: 5061 Description It's almost summer time, and that means that it's al原创 2015-11-21 19:11:33 · 297 阅读 · 0 评论 -
poj2186 Popular Cows(强连通缩点)
Popular Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 28016 Accepted: 11294 Description Every cow's dream is to become the most popular cow in the h原创 2015-11-22 21:11:02 · 320 阅读 · 0 评论 -
poj 3177 Redundant Paths(求最少加几条边将图变为边双连通图)
Redundant Paths Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11145 Accepted: 4774 Description In order to get from one of the F (1 <= F <= 5,000) grazin原创 2015-11-21 11:34:17 · 391 阅读 · 0 评论