Update docs and content.yaml title to make them match

docs/FlowAndMatching.md

@@ -65,7 +65,7 @@ Fun Fact: Gomory-Hu Tree can be computed in almost linear time. (see [this](http
 ### Test Status
 Passed [CF 343E](https://codeforces.com/contest/343/submission/241516652).
 
-## Minimum Cost Max Flow
+## MCMF
 ### Description
 Successive Shortest Path Algorithm using SPFA (Bellman-Ford algorithm).
 ### Test Status
@@ -78,7 +78,7 @@ Successive Shortest Path Algorithm using Dijkstra's algorithm.
 ### Test Status
 Tested on [ARC122 F](https://atcoder.jp/contests/arc122/submissions/49632535) and [LibreOJ 102](https://loj.ac/s/1987935)
 
-## Minimum Cost Circulation
+## Min Cost Circulation
 ### Description
 Network simplex method. Exponential time complexity, but it runs not too slow in practice.
 ### Test Status
@@ -91,7 +91,7 @@ Tested on [UOJ #487](https://uoj.ac/submission/659272), [UOJ #680](https://uoj.a
 ### Test Status
 [min_cost_b_flow](https://judge.yosupo.jp/submission/183528)
 
-## General Graph Matching
+## General Matching
 ### Description
 Matching in $O(|V|^3)$.
 [ref-slide](https://jacky860226.github.io/general-graph-weighted-match-slides/#/22)

docs/Graph.md

@@ -44,6 +44,12 @@ Edge triconnected component.
 ### Test Status
 Passed [yosupo library checker](https://judge.yosupo.jp/submission/161793).
 
+## Bipolar Orientation
+### Description
+Bipolar orientation algo
+### Test Status
+Passed [1916F](https://codeforces.com/contest/1916/submission/244774734).
+
 ## DMST
 ### Description
 Directed Minimum Spanning Tree in $O(E\log ^2 E)$.
@@ -67,14 +73,14 @@ Runs in $O(NM)$
 ### Test Status
 Passed [NCPC 2018 G](https://codeforces.com/gym/101933/submission/233996239).
 
-## Centroid Decomposition
+## Centroid Decomp.
 ### Description
 Mark a vertex or query the sum of distance from a vertex to
 all marked vertices.
 ### Test Status
 Need rewrite or smt.
 
-## Lowbit Decomposition
+## Lowbit Decomp.
 ### Description
 Some chain decomposition of tree.
 ### Test Status
@@ -95,7 +101,7 @@ Some PRNG random hash.
 ### Test Status
 Passed [UOJ 763](https://uoj.ac/submission/672367) and [library checker](https://judge.yosupo.jp/submission/182721).
 
-## Mo's Algorithm on Tree
+## Mo's Algo on Tree
 ### Description
 Pseudo code of mo's algo on tree.
 `push` means XOR the contribution.
@@ -108,23 +114,24 @@ Count 3-cycle and 4-cycle in $O(M\sqrt{M})$.
 ### Test Status
 Passed [CCPC Guangzhou](https://codeforces.com/gym/104053/problem/K).
 
-## MaximalClique
+## Maximal Clique
 ### Description
 Enumerate maximal clique.
 Time complexity $O(n3^{n/3})$ or $O(nC)$ where $C$
 is the number of such cliques.
 ### Test Status
 Can run on $n=80$ on [TIOJ](https://tioj.ck.tp.edu.tw/submissions/357847).
 
-## Maximum Clique (Dyn)
+## Maximum Clique
 ### Description
+MaxCliqueDyn algo
 Get maximum clique with ?? time complexity.
 ### Test Status
 kactl says it can run on $n=155$.
 For $n=100$ on POJ, runs in 32ms.
 Passed [library checker](https://judge.yosupo.jp/submission/165918).
 
-## Minimum Mean Cycle
+## Min Mean Cycle
 ### Description
 $O(V(V+E))$ find min mean cycle.
 Too rare to use so needs shorten.

docs/Math.md

@@ -1,6 +1,6 @@
 # Math
 
-## Common bounds
+## Common Bounds
 ### Description
 Partition function, divisor function, catalan number,
 bell number
@@ -17,7 +17,7 @@ many equations.
 ### Test Status
 No test.
 
-## Extended Floor Sum
+## Extended FloorSum
 ### Description
 A recursion formula.
 ### Test Status
@@ -29,7 +29,7 @@ C++ integer division to normal integer division.
 ### Test Status
 Copied from 8BQube
 
-## Floor Sum
+## FloorSum
 ### Description
 Calculate $\sum _ {i=0} ^ {n-1} \lfloor \frac{ai + b}{m} \rfloor$.
 ### Test Status
@@ -51,7 +51,7 @@ https://judge.yosupo.jp/submission/185615
 https://www.luogu.com.cn/record/144016921
 https://loj.ac/s/1986411
 
-## ax + by = gcd
+## ax+by=gcd
 ### Description
 exgcd algorithm.
 ### Test Status
@@ -106,14 +106,14 @@ CRT for three-mod-NTT.
 ### Test Status
 Passed [yosupo judge](https://judge.yosupo.jp/submission/165178).
 
-## NTT
+## NTT / FFT
 ### Description
 NTT.
 Can be modified to FFT easily.
 ### Test Status
 Passed yosupo judge. See also "CRT for arbitrary mod".
 
-## FPS
+## Formal Power Series
 ### Description
 Common Formal Power Series operations.
 Exp and Pow are relatively slow at yosupo library checker.
@@ -173,19 +173,25 @@ Make RREF and solve system of linear equations.
 ### Test status
 [library checker](https://judge.yosupo.jp/submission/187171).
 
-## Charateristic Polynomial
+## CharPoly
 ### Description
 Calculate the charateristic polynomial of matrix in $O(N^3)$.
 ### Test Status
 Passed 2021 PTZ Korea and [library checker](https://judge.yosupo.jp/submission/187174).
 
-## Simplex / Simplex Construction
+## Simplex
 ### Description
 Linear programming.
 ### Test Status
 Passed [Red and Black Tree](https://codeforces.com/contest/375/submission/243194774).
 [long double](https://codeforces.com/contest/375/submission/243194767) runs 3 times slower.
 
+## Simplex Construction
+### Description
+Tips for simplex
+### Test Status
+See simplex.
+
 ## Adaptive Simpson
 ### Description
 Simpson integration method.

docs/String.md

@@ -1,11 +1,11 @@
 # Stringology
 
 ## Hash
-## Description
+### Description
 
 Rolling-hash algorithm
 
-## Test Status
+### Test Status
 Used in some contests.
 Passed [Z-algo](https://judge.yosupo.jp/submission/187168).
 

pdf/content.yaml

@@ -93,10 +93,10 @@
     - name: Count Cycles
       path: CountCycles.cpp
       verified: 871cd2e
-    - name: MaximalClique
+    - name: Maximal Clique
       path: MaxClique.cpp
       verified: 3646d07
-    - name: MaximumClique
+    - name: Maximum Clique
       path: MaxCliqueDyn.cpp
       verified: cb8ce66
     - name: Min Mean Cycle