`Supimo` `Algorithm` 算法中自定义的术语缩写/概念

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

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

Bezout-Equation is the form a x + b y = c ax + by = c ax+by=c where a , b , c ∈ Z    ∧    ¬ ( a = b = 0 ) a,b,c \in Z \ \ \land \ \ \neg(a=b=0) a,b,c∈Z  ∧  ¬(a=b=0) are Constants, and x , y ∈ Z x,y \in Z x,y∈Z are Unknowns; . A pair ( x 0 , y 0 ) (x_0, y_0) (x0​,y0​) satisfying the above-equation is called a Solution;

EulerFunc: Euler-Function (欧拉函数)

--

MulInv: Multiplicative-Inverse (乘法逆元)

--

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

--

BinExp: Binary-Exponentiation (快速幂)

--

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

--

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

--

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