chaideyipi

http://acm.hdu.edu.cn/showproblem.php?pid=3861The King’s ProblemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1828    Accepted Submission(s):

Kosaraju的主要步骤：对G求伪拓扑排序对G进行转置得到GT (这里的GT是在输入的时候就确定的了)按照第一步得到的集合中顶点出现的顺序，对GT调用DFS得到若干颗搜索树每一颗搜索树就代表了一个强连通分量代码如下：vector G[maxn],G2[maxn];vectorS;int vis[maxn],sccno[maxn],scc_cnt;void dfs1(int u){ if(vis[

http://poj.org/problem?id=2186Popular CowsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 24347Accepted: 9992DescriptionEvery cow's dream is to become the most popular cow in the herd. In a h

http://poj.org/problem?id=2553The Bottom of a GraphTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 9130Accepted: 3789DescriptionWe will use the following (standard) definitions from graph the

http://poj.org/problem?id=1236 Network of SchoolsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 11919Accepted: 4750DescriptionA number of schools are connected to a computer network. Agr

Tarjan算法用于求有向图的强连通分量（强连通分支）。(1)”强连通分量“的概念： 有向图强连通分量在有向图G中，如果两个顶点vi,vj间（vi>vj）有一条从vi到vj的有向路径，同时还有一条从vj到vi的有向路径，则称两个顶点强连通(strongly connected)。如果有向图G的每两个顶点都强连通，称G是一个强连通图。有向图的极大强连通子图，称为强连通分量(strongly conn