图论_连通
SCUT_Pein
这个作者很懒,什么都没留下…
展开
-
LA4287--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 so原创 2014-03-24 18:02:56 · 667 阅读 · 0 评论 -
CF DIV2 236E Strictly Positive Matrix(强连通)
You have matrix a of size n × n. Let's number the rows of the matrix from 1 to n from top to bottom, let's number the columns from 1 to nfrom left to right. Let's use aij to represent the elem原创 2014-03-18 18:36:31 · 1147 阅读 · 0 评论 -
POJ2942--Knights of the Round Table
Description Being a knight is a very attractive career: searching for the Holy Grail, saving damsels in distress, and drinking with the other knights are fun things to do. Therefore, it is not very原创 2013-07-24 12:58:09 · 828 阅读 · 0 评论 -
POJ3177--Redundant Paths
Description In 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 Rotte原创 2013-07-23 21:19:36 · 811 阅读 · 0 评论 -
POJ3352--Road Construction
Description It'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原创 2013-07-23 18:12:34 · 884 阅读 · 0 评论 -
POJ1330--Nearest Common Ancestors
Description A rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figure, each node is labeled with an integer from {1, 2,...,16原创 2013-07-22 16:29:22 · 655 阅读 · 0 评论 -
POJ2186--Popular Cows
Description Every 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 t原创 2013-07-21 02:09:00 · 757 阅读 · 0 评论 -
Tarjan应用:求割点/桥/缩点/强连通分量/双连通分量/LCA(最近公共祖先)
Tarjan应用:求割点/桥/缩点/强连通分量/双连通分量/LCA(最近公共祖先) 作者提示:在阅读本文之前,请确保您已经理解并掌握了基本的Tarjan算法,不会的请到http://hi.baidu.com/lydrainbowcat/blog/item/42a6862489c98820c89559f3.html阅读。 基本概念: 1.原创 2013-07-21 02:42:19 · 1229 阅读 · 0 评论 -
UVA11324 - The Largest Clique(强连通最大团)
Problem B: The Largest Clique Given a directed graph G, consider the following transformation. First, create a new graphT(G) to have the same vertex set as G. Create a directed edge between two ve原创 2014-03-25 19:55:58 · 699 阅读 · 0 评论