图论—强连通
发型睡姿决定
越努力,越幸运
展开
-
B - Proving Equivalences(强连通 加多少边使其强连通)
Consider the following exercise, found in a generic linear algebra textbook.Let A be an n × n matrix. Prove that the following statements are equivalent:A is invertible.Ax = b has exactly one solu...原创 2019-07-30 09:27:21 · 164 阅读 · 0 评论 -
D - Hawk-and-Chicken(强连通缩点+bfs反向建图)
题目链接Kids in kindergarten enjoy playing a game called Hawk-and-Chicken. But there always exists a big problem: every kid in this game want to play the role of Hawk.So the teacher came up with an idea...原创 2019-07-30 16:18:52 · 155 阅读 · 0 评论 -
C - Summer Holiday(强连通缩点)
To see a World in a Grain of SandAnd a Heaven in a Wild Flower,Hold Infinity in the palm of your handAnd Eternity in an hour.—— William Blake听说lcy帮大家预定了新马泰7日游,Wiskey真是高兴的夜不能寐啊,他想着得快点把这消息告诉大家,虽然他手...原创 2019-07-30 16:42:33 · 103 阅读 · 0 评论 -
F - Caocao's Bridges(Tarjan求最小割边,去重边)
题目链接Caocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn’t give up. Caocao’s army still was not good at water battles, so he came up with another idea. He built many i...原创 2019-07-30 16:55:20 · 111 阅读 · 0 评论 -
E - SPF(无向图连通分量求割点)
题目链接Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis, a failure of a single node, 3, in the network ...原创 2019-07-30 17:40:57 · 328 阅读 · 1 评论 -
【强连通分量】tarjan算法及kosaraju算法+例题
Tarjan算法一、算法简介 Tarjan算法是一种由Robert Tarjan提出的求有向图强连通分量的时间复杂度为O(n)的算法。首先我们要知道两个概念:时间戳(DFN),节点能追溯到的最早的栈中节点的时间戳(LOW)。顾名思义,DFN就是在搜索中某一节点被遍历到的次序号(dfs_num),LOW就是某一节点在栈中能追溯到的最早的父亲节点的搜索次序号。Tarjan算法是基于深度优先搜...原创 2019-07-26 15:17:54 · 930 阅读 · 0 评论 -
A - 迷宫城堡(强连通)
链接为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N<=10000)和M条通道(M<=100000),每个通道都是单向的,就是说若称某通道连通了A房间和B房间,只说明可以通过这个通道由A房间到达B房间,但并不说明通过它可以由B房间到达A房间。Gardon需要请你写个程序确认一下是否任意两个房间都是相互连通的,即:对于任意的i和j,至少存在一条路径可以从房间i到房...原创 2019-07-26 16:43:19 · 155 阅读 · 0 评论