算法 {算法术语,自定义算法术语}

图论

定义

某点的搜索图

A Search-Graph of a point $a$ (a点的搜索图) $(V,E)$ where $a$ can reach to any point $\forall x\in V$ and $E$ is the edges of the Induced-Sub-Graph $G[V]$.
. + When we perform a BFS/DFS from the start-point $a$, actually, we are traversing on the Search-Graph of $a$.

某点的极限路径

A Limited-Path of a point $s$ (s点的极限路径) is a path $s\to ...\to t$ where each time we traverse an edge $a\to b$ then delete this edge $a\to b$ (if in the Undirected-Graph, then delete its corresponding-edge $a-b$), until we arrive at the point $t$ which has no adjacent-point to traverse further.
. + Finally, in the new graph (all edges in the path has been deleted), the $Out[t]=0$ (if in the Undirected-Graph, then $Deg[t]=0$);
. + It can be got by DFS using the below method:

void DFS( int a){
	for( `(a-x)` : all adjacent-edges of `a`){
		path.push_back( `(a-x)`);
		delete this edge `a-x` from the graph;
		DFS( x);
	}
}

数论

线性同余方程
LCE: Linear-Congruence-Equation (线性同余方程) $ax\equiv b(\%M)$

@Delimiter

裴蜀方程

BezoutE: Bezout-Equation (裴蜀方程) is the form $ax+by=c$ where $a,b,c>0$ are Constants, and $x,y\in Z$ are Unknowns;
. A pair $(x_0,y_0)$ satisfying the equation is called a Solution;

算法术语缩写

数论

MatrixMul 矩阵乘法

CRT: 中国剩余定理

CRT_EX: 拓展中国剩余定理

@Delimiter

LCE_BezoutE: 使用裴蜀方程法 来求解 线性同余方程;

@Delimter

BezoutE: 求解 裴蜀方程;

@Delimiter

EulerFunc: Euler-Function (欧拉函数)

--

MulInv: Multiplicative-Inverse (乘法逆元)

--

BinExp: Binary-Exponentiation (快速幂)

--

GCD: Greatest-Common-Divisor (最大公约数)

--

GCD_EX: Extended-GCD (拓展GCD算法)

--

LCM: Least-Common-Multiple (最小公倍数)

@Delimiter(Old)

图论

DFS图

树Tree

@Todo: (all leaves are Degree[] = 1 without the choice of root) or (if you choose a root, the root maybe a leaf)

有向图DiG

有向无环图DAG

Directed-Acyclic-Graph (DAG) (有向无环图) is a Directed-Graph where has no Circuit.

--

(路径点覆盖) is a set of Simple-Paths such that all points occurs in exactly One path;
+ Let $V=(1,2,3)$, then $(1\to 2\to 3)$ is valid; $(1\to 2)(3)$ is valid; while $(1\to 3)(2\to 3)$ is not, $(1\to 2)$ is also not;

(最小路径点覆盖) is that with the minimal paths;

--

(路径重复点覆盖) is a set of Simple-Paths such that all points occurs in at least One-Path;
+ Any 路径点覆盖 is also 路径重复点覆盖;
+ Let $V=(1,2,3)$, then $(1\to 3)(2\to 3)$ is valid;

(最小路径重复点覆盖) is that with the minimal paths;

---

(路径独立集): in Directed-Graph, it is a set of points where any two points are not accessible to each other;
+ It differs from Independent-Set which applicated in Undirected-Graph and two points are not forms an Edge (not Path)

最大路径独立集

基础概念

A point $a$ is called Reachable (可达) for $b$ if there exists a Path $b\to ...\to a$ (also $b$ could Reach to $a$)

. As a lemma, any point is Reachable for itself.

---

Two points $a,b$ are called Weakly-Connected (弱连通) if replacing all directed-edges with undirected-edges produces a path between $a,b$.

. $(a\to b)(c\to b)$ where $a,c$ are Weakly-Connected.

---

Two points $a,b$ are called Unilaterally-Connected (Semi-Connected) (半连通/单向连通) if there exists a path $a\to ...\to b$ or $b\to ...\to a$ (another phrase, $a$ is Reachable for $b$ or $b$ is Reachable for $a$).

. $(a\to b)(b\to c)$ where $a,c$ are Semi-Connected.

---

Two points $a,b$ are called Strongly-Connected (强连通/双向连通) if they are Reachable for each other.

---

A graph $G=(V,E)$ is called Weakly-Connected (弱连通) if any two points $a,b$ are Weakly-Connected $\forall a,b\in V$ (another phrase, if transforming each edge in $E$ being Undirected, then the undirected-graph $G$ is Connected.)

A Weakly-Connected-Sub-Graph (弱连通子图) $G1$ of $G$ is Weakly-Connected and $G1\subset G$.

---

A graph $(V,E)$ is called Semi-Connected if any two points $a,b$ are Semi-Connected $\forall a,b\in V$

A Semi-Connected-Sub-Graph (强连通子图) $G1$ of $G$ is Semi-Connected and $G1\subset G$.

---

A graph $(V,E)$ is called Strongly-Connected if any two points $a,b$ are Strongly-Connected $\forall a,b\in V$

A Strongly-Connected-Sub-Graph (强连通子图) $G1$ of $G$ is Strongly-Connected and $G1\subset G$.

. Strongly-Connected, always implies that is also Semi-Connected; Semi-Connected, always implies that is also Weakly-Connected;

---

A Weakly-Connected-Component (弱连通分量/极大弱连通子图) $G1$ is a Weakly-Connected-Sub-Graph of $G$ such that there not exists another Weakly-Connected-Sub-Graph $G2$ satisfying $G1\subset G2$

. e.g., $G=(1\to 2)(2\to 3)(1\to 3)(4)$, then $(1\to 2)(2\to 3)(1\to 3)$ is Weakly-Connected-Component (which is also a Closed-Sub-Graph, but the converse is not), while $(1\to 2)(2\to 3)$ is not.

These WCC (Weakly-Connected-Component) of any graph are unique, let them be $WCC1,...,WCCk$, there are some properties:
+ Every point and edge must belong to exact one $WCCi$ (this can be proved according to the corresponding $CC$ of Un-G).
+ $k$ is called the number of $WCC$ of $G$. If we shrinking all SCC, then $k$ equals to the number of DAGs.

--

A Semi-Connected-Component (半连通分量/极大半连通子图) $G1$ is a Semi-Connected-Sub-Graph of $G$ such that there not exists another Semi-Connected-Sub-Graph $G2$ satisfying $G1\subset G2$

These SECC (Semi-Connected-Component) of any graph are unique, let them be $SECC1,...,SECCk$, there are some properties:
+ For the view of DAG (shrinking all DAGs), $SECCi$ is a path from $s\to ...\to e$ where $s$ is a start-point of DAG and $e$ is a end-point of this DAG.
+ Every edge must belong to exact one $WCCi$.
+ Every point belongs to multiple ($\ge 1$) $WCC$ (e.g., $a\to b,c\to b$ there are two SECC $G[a,b]$ and $G[b,c]$ (the denotation of Induced-Sub-Graph)

--

A Strongly-Connected-Component (强连通分量/极大强连通子图) $G1$ is a Strongly-Connected-Sub-Graph of $G$ such that there not exists another Strongly-Connected-Sub-Graph $G2$ satisfying $G1\subset G2$

. e.g., $G=(1\to 2)(2\to 1)(2\to 3)(3\to 2)(4)$, then $(1\to 2)(2\to 1)(2\to 3)(3\to 2)$ is Strongly-Connected-Component , while $(1\to 2)(2\to 1)$ is not.

These SCC (Strongly-Connected-Component) of any graph are unique, let them be $SCC1,...,SCCk$, there are some properties:
+ Every point must belong to exact one $SCCi$.
+ Any edge either belong to exact one $SCCi$ or none (e.g., $G=(a\to b)$ and two $SCC1=(a),SCC2=(b)$ where the only edge do not belongs to any $SCC$.

--

The (Weakly/Semi/Strongly)-Connected-Component is also a Induced-Sub-Graph (i.e., WCC, SECC, SCC can be specified just by its points), but the converse is not (cuz a Induced-Sub-Graph maybe not Connected; e.g., $G=(a)(b)$ where $G$ is a Inducted-Sub-Graph of $G$ but not connected)

----

A Sub-Graph (子图) $G1=(V1,E1)$ of $G=(V,E)$ denoted $G1\in G$ and satisfying that $V1\in V,E1\in E$.

. A sub-graph may be somewhat strange, e.g., $V1$ is empty-set and $E1$ is not empty.

---

A Spanning-Sub-Graph (生成子图) $G1=(V1,E1)$ is a Sub-Graph of $G=(V,E)$ such that $V1=V$.

---

A Induced-Sub-Graph (导出子图) $G1=(V1,E1)$ is a Sub-Graph of $G=(V,E)$ such that for every pair points $a,b$ in $V1$, any edge $(a\to b)\in E$ must also within $E1$. (another phrase, for every edge $(a\to b)\in E$, if $a,b\in V1$ then this edge must within $E1$)
__. It shows that, a Induced-Sub-Graph would only be determined by $V1$ (i.e., once $V1$ is fixed, then $E1$ is unique), so $G1$ also be denoted by $G[V1]$.
__. e.g., $G=(1\to 2)(3\to 4)(4\to 5)(6\to 7)$, the sub-graph $(1\to 2)(3\to 4)$ is Induced-Sub-Graph (and also for $(3)(5)$), while $(1)(2)$ is not.
__. Any two ISG may contain the same points; e.g., $G=(a\to c)(b\to c)$, then G [ { a , b } ] G[ \{a,b\}] G[{a,b}] and G [ { b , c } ] G[ \{b,c\}] G[{b,c}] are both ISG;

---

A Closed-Sub-Graph (闭合子图) $G1=(V1,E1)$ is a Induced-Sub-Graph of $G=(V,E)$ such that for every edge $(v1\to x)or(x\to v1)\in E$ where $v1\in V1$, satisfying $x\in V1$.

. e.g., $G=(1\to 2)(3\to 4)(4\to 5)(6\to 7)$, the sub-graph $(1\to 2)(3\to 4)(4\to 5)$ is Closed-Sub-Graph, while $(3\to 4)$ is not.

---

A Path (路径) $(V,E)$ where $V$ is a sequence of points and $E$ is a sequence of edges, such that $|V|=|E|-1\ge 1$ and $e_i=(v_i\to v_{i+1})$;
+ ( { a } , { } ) ( \{a\}, \{\}) ({a},{}) which just contains one-point, is also a Path;

---

A Trail (迹) is a Path such that $e1,e2,...,ek$ are pairwise distinct.

---

A Simple-Path (简单路径) is a Path whose $v1,v2,...,vk,v_{k+1}$ are pairwise distinct.

---

A Circuit (回路) is a Trail (not Path) whose $v1=v_{k+1}$
+ A Loop is also a Circuit.

---

A Simple-Circuit (简单回路) is a Circuit such that $v2,...,vk$ are pairwise distinct.

---

A Loop (自环) is a edge whose Head is the same as Tail (i.e., $a\to a$)

---

A edge is called Multiple-Edge (重边) ($a\to b$), if there exists another edge which is also in the form $a\to b$

---

A graph is called Simple-Graph (简单图) if it has no Loop and Multiple-Edge

---

A directed-edge $a\to b$ where $a$ is called Tail (起点) (source-point) and $b$ is Head (终点) (destiny-point)

---

The Out-Degree (出度) of a point $a$ denoted $dout(a)$ is the edges-count whose Tail is $a$ (i.e., the form $a\to ?$)

The In-Degree (入度) of a point $a$ denoted $din(a)$ is the edges-count whose Head is $a$ (i.e., the form $?\to a$)

A property: ${\sum }_{v\in V}dout(v)={\sum }_{v\in V}din(v)=|E|$

无向图UnG

二分图BipartiteGraph

Terms: 最大匹配, 最小点覆盖, 最大独立集

Detailed-Contents-Link

点割集,割点,K点连通,点连通度

A Vertex-Cut (点割集) (or Separating-Set) of connected-graph $G$ is a set of vertices whose removal makes $G$ disconnected; (removal means deleting these points and its Adjacent-Edges)
__. If you define on a undirected-graph, and the term disconnected means that making the number of Connected-Component greater; this has some ambiguity, e.g., $(a-b)(b-c)(d)$, then Is the set $b,d$ a Vertex-Cut? (the number of CC is always equals $2$ before or after the Vertex-Cut); so we talk about the Vertex-Cut when $G$ is connected.
+ $G=(a-b)(b-c)(a-d)(d-c)$ where $(b,d)$ is a Vertex-Cut;
+ A connected-graph consists of $\le 2$ vertex would never be disconnected, so a graph maybe not exists a Vertex-Cut, (e.g., $(a-b)$ has not Vertex-Cut), and moreover, the size of any Vertex-Cut is always $[1,|V|-2]$;
__. Property: if there is a Vertex-Cut whose size is $x$, then there must exist Vertex-Cuts whose size are $[x+1,x+2,...,|V|-2]$
+ A Vertex-Cut with size $1$ (i.e., { a } \{ a \} {a}), where $a$ is also called Cut-Point (割点)
__. distinguish the notions (a graph has multiple Cut-Point) between (a Vertex-Cut consists of multiple points)

Cuz a graph may not has a Vertex-Cut, we introduce a notion of K-Vertex-Connected;
A connected-graph is said K-Vertex-Connected if $G$ does not contain any Vertex-Cut whose size is $K-1$; (stipulation, $K\in [0,|V|-1]$) (e.g., $(a-b)(a-c)(b-d)(c-d)$, $|V|=4$ so $K\in [2,3]$ there are Vertex-Cuts { b , c } , { a , d } \{ b, c \}, \{ a, d\} {b,c},{a,d}, so $G$ is called 3-Vertex-Connected.
+ If a graph is K-Vertex-Connected (K点连通的), then it is also $[0,1,2,3,...,K]$-Vertex-Connected, from the property of Vertex-Cut mentioned above. In other words, for the range $[0,...,|V|-1]$ and there always (e.g., $i=0$) exists a number $i$ in this range where $[l,...,i]$ are True and $[i+1,...,r]$ are False (it has the property of Dichotomy); that is, the graph is said to be $K$-Vertex-Connected for any number $K\in [l,...,i]$. The Vertex-Connectivity (点连通度) of $G$ is the number $i$.
+ A connected-graph is K-Vertex-Connected where $K$ maybe not unique (discussed above), not implies that $G$ has a Vertex-Cut whose size if $K-1$, even it has no Vertex-Cut (e.g., a Complete-Graph has no Vertex-Cut).
__. More precisely, ($G$ is Complete-Graph $\iff$ the Vertex-Connectivity of $G$ is $|V|-1$); in this case ($G$ is Complete-Graph), it has no Vertex-Cut; otherwise (once $G$ is not Complete-Graph), ($G$ is not Complete-Graph $\iff$ the Vertex-Connectivity of $G$ is the minimal-size of all its Vertex-Cuts)

边割集,割边/桥,K边连通,边连通度

Similar the above notions of Vertex-Cut, Cut-Point, K-Vertex-Connected, Vertex-Connectivity which are based on Vertices, there are Edge-Cut, Bridge, K-Edge-Connected, Edge-Connectivity which are based on Edges.

A Edge-Cut (边割集) of connected-graph $G$ is a set of edges whose removal makes $G$ disconnected; (removal means deleting these edges)
+ A Edge-Cut with size $1$ (i.e., { a } \{ a \} {a}), where $a$ is also called Bridge (Cut-Point) (桥/割边)

A co-graph is called K-Edge-Connected such that there is not a Edge-Cut whose size if $K-1$.
+ for the range $[0,...,|E|]$, there must exist a $i$ where $[0,i]$ are True and $[i+1,|E|]$ are False (i.e., G is call $K$-Edge-Connected where $K$ must $\in [0,i]$), the Edge-Connectivity (边连通度) of G equals $i$.
+ a connected-graph $G$ whose Edge-Connectivity is $K$ shows that there must has a Edge-Cut whose size is $K$ (if $|E|>0$), also the minimal-size of all Edge-Cut is $K$. (cuz, if $|E|>0$ then we can let the Edge-Cut be $E$, G must be disconnected, which differs from the case of Vertex-Cut)

--

In summary, A co-graph whose Vertex-Connectivity is $K$ shows that either there is a minimal Vertex-Cut whose size is $K$ (if G is not Complete-Graph), or there is no Vertex-Cut (G is Complete-Graph)
A co-graph whose Edge-Connectivity is $K$ shows that either there is a minimal Edge-Cut whose size is $K$ (if $|E|>0$), or there is no Edge-Cut (if $|E|=0$)

点双连通分量,边双连通分量 @NeedFinish( removed to the next)

A connected-graph is called Point-Biconnected (biconnected) (点双连通的) that is nearly the same as 2-Vertex-Connected (K点连通) except for the case $|V|\le 2$ which is not 2-Vertex-Connected but Point-Biconnected;
__. a same situation for Edge-Biconnected (边双连通的);
More precisely (or a formal definition), a connected-graph is Point-Biconnected if and only if it has no Cut-Point; a connected-graph is Edge-Biconnected if and only if it has no Cut-Edge

More precisely, Point-Biconnected-Component (点的双连通分量) (PBCC) $G1$ is a Sub-Graph of $G$ such that $G1$ has no Cut-Point and there is no $G2$ satisfying without Cut-Point and $G1\subset G2$.

Also, Edge-Biconnected-Component (边的双连通分量) (EBCC) $G1$ is a Sub-Graph of $G$ such that $G1$ has no Cut-Edge and there is no $G2$ satisfying without Cut-Edge and $G1\subset G2$.

Two points $a,b$ are called Point-Biconnected if there has at least two paths $a\to S1\to b$ and $a\to S2\to b$ where $Si$ is the set of points on the path except the endpoints $a,b$, such that $S1\wedge S2=\varnothing$;
__. (of course, the premise is $a,b$ must be connected so that there has path between $a,b$; $a,a$ (maybe no loop on it) are always PB; an edge $a-b$ shows that $a,b$ are always PB; due to $\varnothing \wedge \varnothing =\varnothing$)
+ In a PBCC of $G$, any two points are Point-Biconnected; (if not, there is a point $c$ such that all paths $a\to b$ must passes it, then $c$ is a Cut-Point, which contradicts that a PBCC has no Cut-Point); in other words, for a $PBCC$, after remove any one point (and its adjacent-edges), this $PBCC$ would still be connected;

Two points $a,b$ are called Edge-Biconnected if there has at least two paths $aS1b$ and $aS2b$ where $Si$ is the set of edges on the path, such that $S1\wedge S2=\varnothing$;
__. note that, though EB focuses on the Edge-Check, the term EB is acted on two points not two edges, i.e., $a,b$ are EB where $a,b$ must be points)
__. (of course, the premise is $a,b$ must be connected so that there has path between $a,b$; $a,a$ (maybe no loop on it) are always EB; due to $\varnothing \wedge \varnothing =\varnothing$)
+ In a EBCC of $G$, any two points are Edge-Biconnected; (if not, there is a edge$c$ such that all paths $a\to b$ must passes it, then $c$ is a Cut-Edge, which contradicts that a EBCC has no Cut-Edge)

--

Every EBCC and PBCC of a graph, is also a Induced-Sub-Graph. (In fact, all Connected-Component with different types are ISG, due to the requirement of Maximal-Sub-Graph; or you can think in this way that for a CC, we add a new edge between $a,b\in CC$, which would not affect the connectivity of that CC)

--

The EBCCs of a [unconnected] graph $G$ are unique and possesses some properties which resemble to SCC; (e.g., $G=(a-b)(b-c)(c-d)(d-b)(e)$, all EBCCs are [ { a } ] , [ { b , c , d } ] , [ { e } ] [\{a\}], [\{b,c,d\}], [\{e\}] [{a}],[{b,c,d}],[{e}] where $[]$ denotes Induced-Sub-Graph.
+ There has no point whose degree is $1$ in a $EBCC$;
__. Even the degree of all points are $>1$, it also maybe $EBCC$; (e.g., $(a-b)(b-c)(c-a)(b-d)(d-e)(e-f)(f-d)$)
+ Every point must belongs to one $EBCCi$; (so we can distinguish every EBCC by its points)
+ Every edge $e$ either belongs to one $EBCCi$, or not contained by any EBCC which implies that $e$ is a Cut-Edge. (all Cut-Edges join two distinct EBCCs; the number of edges that joins two distinct EBCC must $\le 1$, otherwise these edges are not Cut-Edge)
+ If we Shrinking-EBCC for $G$ then it would forms a Tree (forest) $T$; cuz any two EBCCs has at most one path due to all edges in $T$ are Cut-Edges; in other words, a graph whose all edges are Cut-Edges, then this graph is a Forest.
__. there are some properties: (all edges are the Cut-Edges of $G$ and $T$ simultaneously) (at most one edge between two points in $T$)
+ All $CC$ of the remaining graph $G1$ whose all Cut-Edges were removed, are all $EBCC$s of $G$
+ The intersection of edges and points between two $EBCC$s are both empty.

--

The PBCCs of a (unconnected) graph $G$ are unique and possess some properties which are very strange/unfamiliar differs from the normal type-CC; (e.g., $G=(a-b)(b-c)(c-d)(d-a)(a-e)(b-f)(c-g)(c-h)(g-h)(d-i)(d-j)$, all EBCCs are [ { a , e } ] , [ { b , f } ] , [ { c , g , h } ] , [ { d , i } ] , [ { d , j } ] , [ { a , b , c , d } ] [\{a,e\}], [\{b,f\}], [\{c,g,h\}], [\{d,i\}], [\{d,j\}], [\{a,b,c,d\}] [{a,e}],[{b,f}],[{c,g,h}],[{d,i}],[{d,j}],[{a,b,c,d}] where $[]$ denotes Induced-Sub-Graph.
+ Note that, for a PBCC $G1$, the requirement is $G1$ has no Cut-Point, do not confused with $G1$ not contains any Cut-Point of $G$; these two notions are totally different; e.g., $G=(a-b)(b-c)$ where $b$ is a Cut-Point of $G$; the PBCCs of $G$ are [ { a , b } ] , [ { b , c } ] [\{a,b\}], [\{b,c\}] [{a,b}],[{b,c}] where although $b$ is a Cut-Point for $G$, it is not Cut-Point for the PBCC [ { a , b } ] [\{a,b\}] [{a,b}].
__. In other words, do not think that the PBCCs are the CCs of the remaining graph whose all Cut-Points were removed (also its adjacent edges); e.g., $G=(a-b)(b-c)(c-d)(d-a)(a-e)$ where $a$ is the only Cut-Point of $G$, but the remaining graph after deleting $a$ is $G1=(b-c)(c-d)(e)$ where the C C [ { b , c , d } ] CC[\{b, c, d\}] CC[{b,c,d}] contains a new Cut-Point $c$ and this CC is neither PBCC nor EBCC.
+ Every edge must belongs to one $PBCC$ (so we can distinguish every $PBCC$ by its edges)
+ Every point $a$ either belongs to only one $PBCC$ (if and only if $a$ is not a Cut-Point of $G$), or belongs to $\ge 2$ $PBCC$s (if and only if $a$ is a Cut-Point of $G$) (e.g., $(a-b)(a-c)(a-d)(a-e)$ where $a$ belongs to the all $4$ $PBCC$s.)
+ Any $PBCC$ must contains $\ge 1$ Cut-Points (of course, Cut-Points refers to the Cut-Points of $G$; cuz $PBCC$ has no Cut-Point)
+ The intersection of edges between two $PBCC$s must be empty;
__. The intersection of points between two $PBCC$s maybe empty, or only one point which must be a Cut-Point of $G$ (this differs to the case of $EBCC$ which has no intersection whichever for point or edge)
+ $PBCC$ can also be Shrunk which is very different to $EPCC$; let all $PBCC$s indexed by $[1,...,k]$, for any two $PBCC$s $i,j$, connect a edge $i-j$ if the intersection of points between $i,j$ is not empty (actually, must be just one point), finally (let it be $G1$) it is just a connected-graph (maybe not a Tree as usual); every edge of $G1$ denotes exactly one Cut-Point (the intersection of two $PBCC$)
__. e.g., $G=(a-b)(b-c)(b-d)$, after shrunk we get $G1=(x-y)(y-z)(z-x)$ which is not a Tree;
__. e.g., $G=(a-b)(b-c)(c-d)$, after shrunk we get $G1=(x-y)(y-z)$ which contains Cut-Point $y$;
__. Therefore, $G1$ is just a normal connected-graph, unlike $EBCC/SCC$ which building the Shrunk-Graph, in $PBCC$, we usually just use the structure vector<int> pbcc[ N] where pbcc[i] = {a1,a2,...} means that the PBCC with id $i$ consists of these points {a1,a2,...} (a Cut-Point must belongs to $\ge 2$ PBCC).
+ If a $PBCC$ consists of only one point $a$, then the sole $a$ is a $CC$ of $G$.

--

The properties between PBCC and EBCC:
+ A EBCC maybe not a PBCC; (e.g., $(a-b)(a-c)(b-c)(d-e)(d-c)(e-c)$ is a EBCC, while not a PBCC where $c$ is Cut-Point); the converse is also satisfied; (e.g., an edge $(a-b)$ is a PBCC, while is not a EBCC;) cuz there maybe multiple edges between $a,b$, edges are distinct not shows the points are distinct.
__. But a PBCC whose $|V|\ne 2$ is always a EBCC; Proof: two paths $a-S1-b$ and $a-S2-b$ where $Si$ is the set of points in the middle, cuz $S1\wedge S2=\varnothing$, all points in the middle are distinct, thus the edges must be also distinct.
+ The endpoints of a Cut-Edge, maybe not Cut-Point; (e.g., $(a-b)$ is a Cut-Edge while $a,b$ are not Cut-Point; $a-b-c$ where $a-b$ is Cut-Edge while $a$ is not Cut-Point while $b$ is ;
__. More generally, for a Cut-Edge $(a-b)$, $a$ is Cut-Point if the adjacent-points of $a$ is not only $b$; $b$ is Cut-Point if the adjacent-points of $b$ is not only $a$;
+ All edges of a graph may be all Cut-Edges (e.g., $(a-b)(b-c)(c-d)$;
__. There must exists one point that is not Cut-Point; (all points are Cut-Point is impossible)
+ The maximum of $EBCC$s of graph is $\le |V|$ (from definition) (e.g., all points are isolated);
__. The maximum of $PBCC$s of graph is $\le |E|$ (from definition), and also $\le |V|$ (according to the Shrinking-PBCC Tree. @NeedProof)

PBCC

*PBCC-Leaf* := A PBCC is called a `PBCC-Leaf` if it contains `<= 1` Cut-Point;
*CC* := the Connected-Component of a Undirected-Graph
*Delete(x,y)* :=  delete the point `x` and all its adjacent edges from the graph `y`, return the new graph;
*PBCC-Connected* := If there is a path `a1,a2,...,an` where `ai` is PBCC, such that `ai` intersect with `a_{i+1}`, then two PBCCs `a1, an` is call **PBCC-Connected**;
*Block-Cut-Tree* := @NeedFinish
//--
ASSERT( [the PBCCs of a undirected graph]_<->_[the union of the PBCCs of all its *CC*]);
G := a Connected-Undirected-Graph
ASSERT( every edge in `G` belongs to exact one PBCC (i.e, the edges of two distinct PBCC has no intersection);
vector cut := all Cut-Points of `G`
ASSERT( cut.size() < pbcc.size() <= G.points_count());
vector< vector> pbcc := the PBCCs of `G` 
//< + `pbcc[i] = {a1,a2,...}` means the PBCC whose `id` is `i` consists of those points `a1,a2,...`;
//  + pbcc.size() is the number of PBCCs of `G1; 
//  + cuz a PBCC is also a Induced-SubGraph so that we can just use all points within in PBCC to specify it, but you should also know that a PBCC also contains all edge between these points within it (i.e., you can say that `a edge is within a PBCC`;
vector cover := `cover[i] = a` means there are `a` PBCCs that contains the point `i`;
ASSERT( `cover[i] >= 2` if `i` is a Cut-Point);
ASSERT( `cover[i] == 1` if `i` is not a Cut-Point);
vector cut_count := `cut_count[i] = a` means there are `a` points which belongs to `pbcc[i]` and belongs to `cut` simultaneously;
ASSERT( [pbcc[i] is *PBCC-Leaf*]_<->_[cut_count[i] == 1]);
leaf_count := the number of PBCCs whose `cut_count` equals `1`;
if( cut.empty()){
    ASSERT( [pbcc.size() == 1]_<->_[pbcc[0] == G]);
    ASSERT( cover[i] == 1);
    ASSERT( [G.points_count >= 2]_->_[*Delete(i,G)* is still connected]);
}
else{
    ASSERT( pbcc.size() >= 2);
    ASSERT( pbcc[i].size() >= 2);
    ASSERT( G.poins_count >= 3]);
    ASSERT( leaf_count >= 2);
    ASSERT( [`i` is not a Cut-Point]_->_[*Delete(i,G)* is still connected]);
    ASSERT( [`i` is a Cut-Point]_->_[*Delete(i,G)* has `cover[i]` *CC*, so no longer connected]);
    ASSERT( max( cover[i]) <= leaf_count);
    ASSERT( let `x` be the intersection of points of two distinct PBCC, then [`x` maybe empty]_or_[`x` is just one Cut-Point]);
    ASSERT( any two PBCCs are *PBCC-Connected*);
    {
        T := the Block-Cut-Tree of `G`
        G1 := *Delete(a,G)* (where `a` is a Cut-Point);
        vector cc_g1 := be the CCs of `G1`;
        ASSERT( `cc_g1.size()` == cover[a]);
        ASSERT( [all Block-Cut-Trees of `cc_g1`]_<->_[all Sub-Trees rooted by `a` in `T`]
    }
}

EBCC

基础概念

Two points $a,b$ are called Connected (连通的) if there exists a Path $a-...-b$ (also Bidirectional-Reachable, i.e., $a$ is Reachable for $b$, and $b$ is also Reachable for $a$)

. As a lemma, any point is Connected with itself;

G is a Connected-Graph (连通图) if any two points are Connected.

---

A Connected-Sub-Graph (连通子图) $G1=(V1,E1)$ is connected ($a,b$ is connected $\forall a,b\in V1$) and $G1\subset G$

. e.g., $G=(1-2)(2-3)(1-3)(4)$, then $(1-2)(2-3)$ is Connected-Sub-Graph (which is not a Induced-Sub-Graph, let alone a Closed-Sub-Graph), while $(1-2)(4)$ is not.

---

A Connected-Component (连通分量/连通块/极大连通子图) $G1$ is a Connected-Sub-Graph of $G$ such that there not exists another Connected-Sub-Graph $G2$ satisfying $G1\subset G2$ (i.e., Connected-Component is a maximal connected sub-graph).

These CC (Connected-Component) for any Graph are unique; suppose $G$ could be divided into $CC1,....CCk$, there are some properties:
+ Every point and edge must belongs to exact one $CCi$.
+ $k$ is called the number of CC of a graph.
+ A Connected-Component is also a Closed-Sub-Graph, but the converse is not (cuz a Closed-Sub-Graph maybe not Connected, e.g., $G=(a-b)(c-d)$ and $G$ is also a Closed-Sub-Graph, while it is not connected)
+ For instance, $G=(1-2)(2-3)(1-3)(4)$, then $(1-2)(2-3)(1-3)$ is Connected-Component (which is also a Closed-Sub-Graph), while $(1-2)(2-3)$ is not.

---

A Sub-Graph (子图) $G1=(V1,E1)$ of $G=(V,E)$ denoted $G1\in G$ and satisfying that $V1\in V,E1\in E$.

. A sub-graph may be somewhat strange, e.g., $V1$ is empty-set and $E1$ is not empty.

---

A Spanning-Sub-Graph (生成子图) $G1=(V1,E1)$ is a Sub-Graph of $G=(V,E)$ such that $V1=V$.

---

A Induced-Sub-Graph (导出子图) $G1=(V1,E1)$ is a Sub-Graph of $G=(V,E)$ such that for every pair points $a,b$ in $V1$, any edge $(a-b)\in E$ must also within $E1$. (another phrase, for every edge $(a-b)\in E$, if $a,b\in V1$ then this edge must within $E1$)

. It shows that, a Induced-Sub-Graph would only be determined by $V1$ (i.e., once $V1$ is fixed, then $E1$ is unique), so $G1$ also be denoted by $G[V1]$.

. e.g., $G=(1-2)(3-4)(4-5)(6-7)$, the sub-graph $(1-2)(3-4)$ is Induced-Sub-Graph (and also for $(3)(5)$), while $(1)(2)$ is not.

---

A Closed-Sub-Graph (闭合子图) $G1=(V1,E1)$ is a Induced-Sub-Graph of $G=(V,E)$ such that for every edge $(v1,x)\in E$ where $v1\in V1$, satisfying $x\in V1$.

. e.g., $G=(1-2)(3-4)(4-5)(6-7)$, the sub-graph $(1-2)(3-4)(4-5)$ is Closed-Sub-Graph, while $(1-2)(3-4)$ is not.

A Path (路径) is a sequence of edges (imagine that you’re traversing along the graph from a source-point) $e1,e2,...,ek$ such that there exists a sequence of points $v1,v2,...,vk,v_{k+1}$ and the endpoints of $ei$ is $vi,v_{i+1}$

---

A Trail (迹) is a Path such that $e1,e2,...,ek$ are pairwise distinct.

---

A Simple-Path (简单路径) is a Path whose points $v1,v2,...,vk,v_{k+1}$ are pairwise distinct.

---

A Circuit (回路) is a Trail (not Path) whose $v1=v_{k+1}$

. A Loop is also a Circuit.

---

A Simple-Circuit (简单回路) is a Circuit such that $v2,...,vk$ are pairwise distinct.

---

A Loop (自环) is a edge whose endpoints $a,b$ are the same (i.e., $a=b$)

---

A edge is Multiple-Edge (重边) (its endpoints $a,b$) if there exists another edge whose endpoints are also also $a,b$

---

A graph is called Simple-Graph (简单图) if it has no Loop and Multiple-Edge

---

The Degree (度数) of a point $a$ denoted $d(a)$ is the edges-count whose one (or two) endpoint is $a$;

For every edge $a-b$, it will cause d(a)+=1, d(b)+=1 (i.e., one edge always contributes two on the array $d()$ )
. As a lemma from this property, we have ${\sum }_{vinV}d(v)=2\ast |E|$ (图论基本定理, 握手定理)
. . As a lemma for the above, the number of points whose $d(x)$ is Odd, is always an Even number;

If the graph is Simple (i.e., no self-edge, no multiple-edges), then we have $d(a)=|N(a)|$

---

If $d(x)=0$, then $x$ is called Isolated-Point;
If $d(x)=1$, then $x$ is called Leaf-Point;

---

A graph is called K-Regular-Graph (正则图) is $d(v)=K\forall v\in V$

---

Two points $a,b$ are called Adjacent (相邻) if there exists an edge $a-b$

---

The Neighborhood (邻域) of a point $a$ denoted $N(a)$, is the set of all Adjacent-points of $a$ (i.e., the set of points $x$ such that there exists an edge $a-x$)

Redirect-ID 1