![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
【图论基础】
riba2534
没有谁生来就是神牛,而千里之行,始于足下!
展开
-
Havel-Hakimi定理(判断一个序列是否可图)
Havel定理描述给定一个非负整数序列{d1,d2,...dn},若存在一个无向图使得图中各点的度与此序列一一对应,则称此序列可图化。进一步,若图为简单图,则称此序列可简单图化。可图化的判定比较简单:d1+d2+...dn=0(mod2)。关于具体图的构造,我们可以简单地把奇数度的点配对,剩下的全部搞成自环。可简单图化的判定,有一个Havel定理,是说: 我们把序列排成转载 2017-07-10 16:05:23 · 6931 阅读 · 0 评论 -
POJ1659 Frogs' Neighborhood(Havel定理)
题目:Frogs' NeighborhoodTime Limit: 5000MS Memory Limit: 10000KTotal Submissions: 9932 Accepted: 4152 Special JudgeDescription未名湖附近共有N个大小湖泊L1, L2,原创 2017-07-10 16:11:33 · 411 阅读 · 0 评论 -
HDU2732 Leapin' Lizards(网络流,最大流,拆点,ISAP算法)
Problem Description Your platoon of wandering lizards has entered a strange room in the labyrinth you are exploring. As you are looking around for hidden treasures, one of the rookies steps原创 2018-01-11 10:50:49 · 356 阅读 · 0 评论