avatar
fireworks99
keep hungry keep foolish
HDU 4685 Prince and Princess(bipartite graph match and shrink nodes)

Description

N个王子M个公主,王子只能匹配自己喜欢的公主,公主随意。给出王子对于公主的喜爱信息,求在保证最大配对数的前提下,每个王子分别可以匹配哪些公主。

Read more -->
HDU 4635 Strongly connected(shrink nodes)

Description

给出一个含有N个点M条有向边的简单图(无自环无重边),求:在保证图是简单图且非强连通的前提下,最多可以再添加几条边?

Read more -->
HDU 4612 Warm up(Bridges + Diameter of tree)

Description

N个点M条无向边(可含重边),再添加一条边,最后的桥最少有多少?

Read more -->
POJ 3177 Redundant Paths(shrink nodes and bridges)

Description

N个点M条无向边,原图是连通的,现要添加一些边,使得每两点之间的路至少有两条。求最少连接几条边。

Read more -->
POJ 3694 Network(Bridges and LCA)

Description

给出可能含有重边的无向图,求桥的初始数目。Q次添边,每次输出添边后桥的数目。题目保证初始时刻图是连通的。

Read more -->
UVA 796 Critical Links(Connected graph Bridge)

Description

给出无向图求桥,可能含有重边

Read more -->
HDU 4408 Minimun Spanning Tree (Count)

Description

最小生成树 + 生成树计数

Read more -->
HDU 4305 Lightning(Count spanning trees)

Description

求生成树有几种形状?

Read more -->
SPOJ Highways and Find the Determinant lll(Count the spanning trees)

Description of Highways

给出原图(无向图),求裸的生成树计数

Description of Find the Determinant III

求方阵A的行列式的值模P的值

Read more -->
UVA 10766 Organising the Organisation(Count spanning tree)

Description

给出N个点的无向图的补图,求原图最小生成树的数目

Read more -->
Site by Baole Zhao | Powered by Hexo | theme PreciousJoy