algzjh的博客

拓扑排序复习1、偏序：自反、反对称、传递 全序：偏序且∀a,b∈A\forall a,b \in A必有aRb或bRa 2、若以图中的顶点来表示活动，有向边表示活动之间的优先关系，则这种用顶点表示活动的有向图成为AOV网（activity on vertex network）. 3、树的存储： （1）树的顺序存储（先序序列+每个结点的度数） （2）双亲链表表示法 （3）孩子表示

1、从树根到任意顶点vv的路径长度（即路径的边数）称作vv的层数，所有顶点的最大层数称作树高。

1、最小支配集中顶点的个数称作GG的支配数，记作γ0(G)\gamma_0(G)，简记为γ0\gamma_02、最大独立集的顶点数称作GG的点独立数，记作β0(G)\beta_0(G)，简记为β0\beta_03、无向简单图的极大点独立集都是极小支配集。4、最小点覆盖中的顶点个数称作GG的点覆盖数，记作α0(G)\alpha_0(G)，简记为α0\alpha_05、设无向简单图G=<V,E>,V∗⊆

1、欧拉公式： 顶点数-边数+面数=2

RXD and dividingTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 65 Accepted Submission(s): 15Problem Description RXD has a tree T, with t

奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 9907 Accepted Submission(s): 4382Problem Description 传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改

Colorful TreeTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1575 Accepted Submission(s): 636Problem Description There is a tree with n n

LXX的图论题Description由于lxx的图论和数据结构太弱了，大佬Z决定为lxx补一补。于是大佬Z为lxx出了一道题目，题目如下：给出一张有向图，图中有n个点，m条边，每条边上都有一个权值w，问图中是否存在满足以下条件的点i,j,…p使得不等式w[i][j] * w[j][k] * …. * w[p][i]<1成立。奈何lxx太弱了，他决定寻求你的帮助。 Input多组输入，以文件结尾。第

D - Transit Tree PathTime limit : 2sec / Memory limit : 256MBScore : 400 points Problem StatementYou are given a tree with N vertices. Here, a tree is a kind of graph, and more specifically, a connec

C. Misha and Foresttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's define a forest as a non-directed acyclic gr

对于在图GG上运行深度优先搜索算法所生成的深度优先森林GπG_{\pi}，我们可以定义4种边的类型： 1、树边 2、后向边 3、前向边 4、横向边

测试题目： POJ3255///求次短路///使用优先队列Dijkstra算法///复杂度O(ElogV)///注意初始化///dist2[v]=min(dist[u]+e(u,v),dist2[u]+e(u,v))#include<iostream>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>

Two PathsTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 153428/153428 K (Java/Others) Total Submission(s): 190 Accepted Submission(s): 113Problem Description You are given a undirected gr

Flow ProblemTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 16692 Accepted Submission(s): 7867Problem Description Network flow is a well-kn

1、含平行边的图称作多重图，既不含平行边也不含环的图称作简单图。 2、称度数为1的顶点为悬挂顶点，与它关联的边称为悬挂边 3、握手定理：在任何无向图中，所有顶点的度数之和等于边数的2倍。 4、在任何有向图中，所有顶点的度数之和等于边数的2倍，所有顶点的入度之和等于所有顶点的出度之和，都等于边数。 5、任何图（无向的或有向的）中，奇度顶点的个数是偶数。 6、非负整数列d=(d1,d2,…,d

1、通路的始点和终点相同则为回路，若有边重复出现，则为复杂通路（回路） 所有边各异，则为简单通路，若又始点终点相同，则为简单回路 所有顶点（除始点终点）各异，所有边也各异，则为初级通路或路径，若始点终点相同，则为初级回路或圈。 在简单图中，可以只用顶点序列表示通路（回路） 2、长度相同的圈都是同构的，因此在同构意义下给定长度的圈只有一个。在标定图中，圈表示成顶点和边的标记序列。只要两个标记序

注意：支配集、覆盖集、独立集和匹配都是对无向简单图而言的，而点的着色和边着色是对无环图而言的定义1设无向简单图G=(V,E),V∗⊆VG=(V,E),V^*\subseteq V，若∀vi∈V−V∗,∃vj∈V∗\forall v_i\in V-V^*,\exists v_j \in V^*使得(vi,vj)∈E(v_i,v_j)\in E，则称V∗V^*为G的一个支配集。V∗V^*的任何真子集都不

图的表示方法#define E 1000000#define V 100000struct Edge{ int v;//终止点 int c;//边权点 int next;//下一个结点}p[E];int head[V];//链表头int e;//边总数void init()//初始化{ memset(head,-1,sizeof(head)); e

#include<cstdio>#include<cstring>#include<queue>#include<cmath>#include<algorithm>using namespace std;const int Ni=205;const int MAXN=1000005;struct Edge{ int u,v,c; int next;}edge[20*

Page 1 of 2 ACM-ICPC Asia Thailand National On-Site Programming Contest 2015 Problem C Far Far Away ACM-ICPC Asia Thailand National On-Site Programming Contest 2015 Thai University lecturers often

1834: Oil Submit Status Time Limit: 2 Sec Memory Limit: 128 Mb Submitted: 45 Solved: 15 Description Mr. Mike owns many houses. Every day wakes up in one of his houses and drives

E(1017): Jump Submit Status Time Limit: 1 Sec Memory Limit: 128 Mb Submitted: 25 Solved: 5 Description In ACM city, there are N tiles staying in two-dimensional Cartesian coordin

无向图1、连通分量 方法一：并查集，O(|E|) 方法二：深搜, O(|E|)2、欧拉回路/通路 欧拉回路： 无向图连通，任意点的度为偶数 欧拉通路： 无向图连通，点度数为奇数的个数为0个或2个3、哈密顿通路的充分条件：任意两结点的度之和>=顶点个数n有向图1、弱连通分量：去掉边的方向以后形成的无向图是连通图2、欧拉回路/通路 欧拉回路： 有向图弱连通，任意点的出度等于入度 欧拉通

#include <iostream>#include <cstring>#include <cstdio>using namespace std;const int MAXE=100;const int MAXV=1000;int head[MAXV];int cnt;struct Edge{ int next; int to; int w;}edge[M

1930: roadsSubmit Page Summary Time Limit: 1 Sec Memory Limit: 128 Mb Submitted: 35 Solved: 12 Description Once upon a time there was a strange kingdom, the kingdom had n cities wh

Dirt— Hello, may I speak to Petrov, please? Hello, my darling… You know, there was a little accident at our home… No, no, don’t worry, your computer was not damaged. It is only a bit dirty there now. W

Transferring SyllaAfter recapturing Sylla, the Company plans to establish a new secure system, a transferring net! The new system is designed as follows:The Company staff choose N cities around the nat

D - Fennec VS. SnukeTime limit : 2sec / Memory limit : 256MBScore : 400 pointsProblem Statement Fennec and Snuke are playing a board game.On the board, there are N cells numbered 1 through N, and N−1

C - Cat Snuke and a VoyageTime limit : 2sec / Memory limit : 256MBScore : 300 pointsProblem Statement In Takahashi Kingdom, there is an archipelago of N islands, called Takahashi Islands. For convenie

Drainage DitchesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18375 Accepted Submission(s): 8677Problem Description Every time it ra...