连通图
文章平均质量分 85
薄层
努力就有收获~
展开
-
HDU 6005 Pandaland(无向图最小环)
Mr. Panda lives in Pandaland. There are many cities in Pandaland. Each city can be treated as a point on a 2D plane. Different cities are located in different locations. There are also M bidirectional roads connecting those cities. There is no intersectio原创 2017-10-19 20:38:23 · 633 阅读 · 0 评论 -
Floyd算法求无向图最小环
There is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many other attractions, sightseeing the town. To earn as much as possible from this attraction, the agency has accepted a shrewd decision: it is neces原创 2017-07-13 01:19:02 · 6465 阅读 · 0 评论 -
HDU 4857(拓扑排序反向建边)
题意:有N个人,M个优先级a,b表示a优先于b,并且每个人有个编号,使编号越小的点尽可能在序列前部(不是字典序),输出顺序。思路:首先想的是正向建边的拓扑,但随之写了一组数据给否定了,然后尝试反向建边,发现每次先对序号大的进行处理,然后送入ans数组中得到的就是正确序列。其实可以想得通,因为每次都对序号大的进行处理,它肯定都会在当前所有可处理的点的后面的,所以一路贪心过去即可。Co原创 2017-06-20 17:42:16 · 434 阅读 · 0 评论 -
拓扑排序(Kahn算法和基于DFS求解法)
拓扑排序是对有向无环图(DAG)进行排序,从而找到一个序列。该序列满足对于任意一对不同的顶点u,v∈V,若G中存在一条从u->v的边,则在此序列中u在v前面。拓扑排序也可以用来判断一个有向图是否存在环。有两种算法可以求得该序列:1.Kahn算法。其实就是不断的寻找有向图中没有前驱(入度为0)的顶点,将之输出。然后从有向图中删除所有以此顶点为尾的弧。重复操作,直至图空,或者找原创 2017-06-07 16:26:22 · 4046 阅读 · 0 评论 -
Tarjan算法 模板
总是有大佬写的博客特别好!(Tarjan算法完全就是改版匈牙利啊!)http://www.cnblogs.com/uncle-lu/p/5876729.html总是想写出自己喜欢的模板格式。#include #include #include #include using namespace std;const int maxn = 5005;struct node原创 2017-05-15 18:46:13 · 602 阅读 · 0 评论 -
图的割点和割边
在一个无向连通图中,如果删除后某个顶点之后,图不再连通(即任意两点之间不能相互可达),这样的顶点叫做割点。由此,删去某个顶点之后,然后进行一次dfs搜索一遍判断图是否还连通,便能求出该点是不是割点。但是时间复杂度颇高。所以,基于dfs搜索树设计了求割点的算法。求割点可分为两种情况,1. 求根节点的是否为割点,只要其有两棵或两棵以上子树,则为割点。2. 叶节点都不是割原创 2017-03-07 22:52:23 · 2818 阅读 · 0 评论 -
UOJ-79 一般图的最大匹配(带花树模板求解)
#79. 一般图最大匹配从前一个和谐的班级,所有人都是搞OI的。有 nn 个是男生,有 00 个是女生。男生编号分别为 1,…,n1,…,n。现在老师想把他们分成若干个两人小组写动态仙人掌,一个人负责搬砖另一个人负责吐槽。每个人至多属于一个小组。有若干个这样的条件:第 vv 个男生和第 uu 个男生愿意组成小组。请问这个班级里最多产生多少个小组?输入格式原创 2017-10-09 17:19:26 · 366 阅读 · 0 评论 -
HDU-5556 Land of Farms(无向图的最大独立集)
2015ACM/ICPC亚洲区合肥站Farmer John and his brothers have found a new land. They are so excited and decide to build new farms on the land. The land is a rectangle and consists of N×MN×M grids. A farm consists of one or more connected grids. Two grids are adjace原创 2017-09-29 13:45:31 · 627 阅读 · 0 评论 -
LeetCode 202 Happy Number(floyd判圈算法(龟兔赛跑算法))
题目链接:https://leetcode.com/problems/happy-number/description/Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with原创 2017-10-20 20:10:29 · 659 阅读 · 0 评论 -
HDU-6038 Function - 2017 Multi-University Training Contest - Team 1(构造置换或强连通分量)
You are given a permutation aa from 00 to n−1n−1 and a permutation bb from 00 to m−1m−1. Define that the domain of function ff is the set of integers from 00 to n−1n−1, and the range of it is the set of integers from 00 to m−1m−1. Please calculate the quan原创 2017-07-26 00:45:32 · 389 阅读 · 0 评论 -
POJ-3352 Road Construction(边双连通分量+缩点)
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 Island would like to repair and upgrade the various roads that lead betwe原创 2017-08-05 16:33:32 · 407 阅读 · 0 评论 -
双连通分量模板以及对一些不好理解点的解释
概念:双连通分量有点双连通分量和边双连通分量两种。若一个无向图中的去掉任意一个节点(一条边)都不会改变此图的连通性,即不存在割点(桥),则称作点(边)双连通图。一个无向图中的每一个极大点(边)双连通子图称作此无向图的点(边)双连通分量。求双连通分量可用Tarjan算法。--百度百科原创 2017-06-09 18:32:29 · 3073 阅读 · 1 评论 -
HDU-6184 (无向图三元环计数)
Little A is an astronomy lover, and he has found that the sky was so beautiful! So he is counting stars now! There are n stars in the sky, and little A has connected them by m non-directional edges. It is guranteed that no edges connect one star with it原创 2017-09-06 17:19:53 · 1915 阅读 · 1 评论 -
HDU-3749 Financial Crisis(并查集+点双连通分量)
Because of the financial crisis, a large number of enterprises go bankrupt. In addition to this, other enterprises, which have trade relation with the bankrup enterprises, are also faced with closing down. Owing to the market collapse, profit decline and f原创 2017-07-24 22:22:41 · 540 阅读 · 0 评论 -
POJ-1637 Sightseeing tour(通过网络流判定混合图的欧拉回路)
The city executive board in Lund wants to construct a sightseeing tour by bus in Lund, so that tourists can see every corner of the beautiful city. They want to construct the tour so that every street in the city is visited exactly once. The bus should als原创 2017-08-02 19:31:34 · 429 阅读 · 0 评论 -
哈密顿图和欧拉图知识小结
哈密顿图的判定是世界级难题。设G是n阶无向简单图,若对于G中任意不相邻的顶点u、v,均有d(u)+d(v)>=n-1,则说明G中存在哈密顿通路。不过,这个条件只是充分条件,而不是必要条件。也就是说,满足该条件一定存在哈密顿通路,但不满足该条件不一定不存在哈密顿通路。如下图便不满足,但它存在哈密顿路。所以要判断哈密顿回路和哈密顿路径一般通过深搜回溯去判定,代码:#in原创 2017-08-02 20:56:46 · 12789 阅读 · 0 评论 -
HDU-4587 TWO NODES(割点变形或者求点双连通分量)
Suppose that G is an undirected graph, and the value of stab is defined as follows:Among the expression,G -i, -j is the remainder after removing node i, node j and all edges that are directly relevant to the previous two nodes. cntCompent is the number of原创 2017-10-01 20:23:45 · 421 阅读 · 0 评论 -
ZOJ-3732 Graph Reconstruction(判定无向图度数序列能否可图化)
Let there be a simple graph with N vertices but we just know the degree of each vertex. Is it possible to reconstruct the graph only by these information?A simple graph is an undirected graph that has no loops (edges connected at both ends to the same ver原创 2017-09-30 15:46:41 · 2456 阅读 · 0 评论 -
HDU-5934 Bomb(强连通分量缩点)
2016年中国大学生程序设计竞赛(杭州)There are NN bombs needing exploding. Each bomb has three attributes: exploding radius riri, position (xi,yi)(xi,yi) and lighting-cost cici which means you need to pay cici cost making it explode. If a un-lighting bomb is in or on th原创 2017-09-20 11:03:51 · 667 阅读 · 0 评论 -
计蒜客-2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛H题Skiing(拓扑序求DAG最长路)
题意:给定一个有向无环图,求该图的最长路。思路:由于是有向无环图,所以最长路肯定是一个入度为0到出度为0的路径,拓扑序在确定当前点之前能够考虑到所有到它的情况,所以最后取个最值即可。代码:#include using namespace std;const int inf = 0x3f3f3f3f;const int maxn = 1e4+5;const int max原创 2017-09-09 19:50:51 · 1331 阅读 · 2 评论 -
计蒜客-2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛F题Islands(有向图加最少的边变成强连通图)
题意:给一个有向图,求至少添加多少条边能够变成强连通图(任意两点互相可达)。思路:其实是DAG的一个性质:对于一个有向无环图,若想让它成为强连通图,至少需要添加max(a, b)条边,其中a为入度为0的点的数量,b为出度为0的点的数量。其实自己推一推也找不到反例,所以对有向图进行缩点后根据入度、出度直接判断即可。代码:#include #define ll long lo原创 2017-09-09 19:06:31 · 842 阅读 · 0 评论 -
FZU-2205 据说题目很水(思维、完全二分图性质避免三元环)
Sunday最近对图论特别感兴趣,什么欧拉回路什么哈密顿回路,又是环又是树。在看完一本书后,他对自己特别有信心,便找到大牛牛犇犇,希望他出一题来考考自己。在遥远的古代东方有N个城市,它们之间可以通过双向的道路相连。任意两个城市由不超过一条道路直接相连,而且没有城市的道路连向自身。但是牛犇犇是个纯情的小伙子,尽管他还没有女朋友,但他还是很讨厌第三者,以至于讨厌三这个数字。所以他希望Sunday能够构造一个N个城市的地图,这个地图中不能有任意三个城市能够相互直接到达,而且地图中的道路数目最多。牛犇犇考虑到S原创 2017-09-03 15:53:50 · 455 阅读 · 0 评论 -
Gym-100342J Triatrip(求有向图三元环个数+bitset应用)
The travel agency “Four Russians” is offering the new service for their clients. Unlike other agencies that only suggest one-way or roundtrip for airline tickets to their customers, “Four Russians” offers the brand new idea — triatrip. Triatrip traveler st原创 2017-09-03 15:39:25 · 980 阅读 · 0 评论 -
HDU-6165 FFF at Valentine - 2017 Multi-University Training Contest - Team 9(强连通分量缩点+拓扑)
At Valentine's eve, Shylock and Lucar were enjoying their time as any other couples. Suddenly, LSH, Boss of FFF Group caught both of them, and locked them into two separate cells of the jail randomly. But as the saying goes: There is always a way out , the原创 2017-08-22 19:39:05 · 353 阅读 · 0 评论 -
无向图的极大团、最大团(Bron-Kerbosch算法)
描述:团就是最大完全子图。(极大团)给定无向图G=(V,E)。如果U包含于V,且对任意u,v属于U且有(u,v)属于E,则称U是G的完全子图。G的完全子图U是G的团当且仅当U不包含在G的更大的完全子图中,即U就是最大完全子图。G的最大团是指G中所含顶点数最多的团。// 最大团: V中取K个顶点,两点间相互连接// 最大独立集: V中取K个顶点,两点间不连接// 最大...原创 2017-08-21 18:13:39 · 27881 阅读 · 8 评论 -
CodeForces - 839E Mother of Dragons(无向图最大团)
There are n castles in the Lannister's Kingdom and some walls connect two castles, no two castles are connected by more than one wall, no wall connects a castle to itself.Sir Jaime Lannister has discovered that Daenerys Targaryen is going to attack his k原创 2017-08-21 20:35:33 · 407 阅读 · 0 评论 -
2017CCPC网络赛 Friend-Graph(暴力、拉姆齐(Ramsey)定理)
It is well known that small groups are not conducive of the development of a team. Therefore, there shouldn’t be any small groups in a good team. In a team with n members,if there are three or more members are not friends with each other or there are thre原创 2017-08-21 01:09:13 · 597 阅读 · 0 评论 -
HDU-6073 Matching In Multiplication - 2017 Multi-University Training Contest - Team 4(拓扑+连通块处理)
In the mathematical discipline of graph theory, a bipartite graph is a graph whose vertices can be divided into two disjoint sets UU and VV (that is, UU and VV are each independent sets) such that every edge connects a vertex in UU to one in VV. Vertex set原创 2017-08-04 19:32:28 · 456 阅读 · 0 评论 -
SenseTime Ace Coder Challenge 暨 商汤在线编程挑战赛-白色相簿
题意:给定无向图,n个点,m条边,判断图中是否存在三元环。(n 思路:计数三元环的复杂度是mlogm,在这里1s跑不过。尝试通过bitset记录每个点的连边状态,再通过任意相连两点进行 & 操作判断,内存会爆掉。可以通过一次bfs,给遍历的到的每个点确定一个父亲节点,画图可知,三元环中任意一点作为父节点,都可以给其余两个点标上相同的父节点。然后遍历所有边,判断两个端点是否有共同的父原创 2018-04-15 14:13:03 · 395 阅读 · 0 评论