@@ -20,10 +20,8 @@ theme:
20
20
icon :
21
21
repo : fontawesome/brands/github
22
22
features :
23
- # - navigation.instant
24
23
- navigation.tracking
25
- # - navigation.tabs
26
- # - navigation.sections
24
+ - navigation.tabs
27
25
repo_url : https://github.com/e-maxx-eng/e-maxx-eng
28
26
edit_uri : edit/master/src/
29
27
copyright : Text is available under the <a href="https://github.com/e-maxx-eng/e-maxx-eng/blob/master/LICENSE">Creative Commons Attribution Share Alike 4.0 International</a> License<br/>Copyright © 2014 - 2022 by https://github.com/e-maxx-eng
@@ -51,3 +49,207 @@ extra:
51
49
analytics :
52
50
provider : google
53
51
property : UA-85220282-1
52
+ nav :
53
+ - ' Home ' :
54
+ - ' index.md'
55
+ - ' contrib.md'
56
+ - ' preview.md'
57
+ - ' Algebra ' :
58
+ - ' Fundamentals ' :
59
+ - ' algebra/binary-exp.md'
60
+ - ' algebra/factoring-exp.md'
61
+ - ' algebra/euclid-algorithm.md'
62
+ - ' algebra/extended-euclid-algorithm.md'
63
+ - ' algebra/linear-diophantine-equation.md'
64
+ - ' algebra/fibonacci-numbers.md'
65
+ - ' Prime numbers ' :
66
+ - ' algebra/sieve-of-eratosthenes.md'
67
+ - ' algebra/prime-sieve-linear.md'
68
+ - ' algebra/primality_tests.md'
69
+ - ' algebra/factorization.md'
70
+ - ' Number-theoretic functions ' :
71
+ - ' algebra/phi-function.md'
72
+ - ' algebra/divisors.md'
73
+ - ' Modular arithmetic ' :
74
+ - ' algebra/module-inverse.md'
75
+ - ' algebra/linear_congruence_equation.md'
76
+ - ' algebra/chinese-remainder-theorem.md'
77
+ - ' algebra/factorial-modulo.md'
78
+ - ' algebra/discrete-log.md'
79
+ - ' algebra/primitive-root.md'
80
+ - ' algebra/discrete-root.md'
81
+ - ' algebra/montgomery_multiplication.md'
82
+ - ' Number systems ' :
83
+ - ' algebra/balanced-ternary.md'
84
+ - ' algebra/gray-code.md'
85
+ - ' Miscellaneous ' :
86
+ - ' algebra/all-submasks.md'
87
+ - ' algebra/big-integer.md'
88
+ - ' algebra/fft.md'
89
+ - ' algebra/polynomial.md'
90
+ - ' algebra/continued-fractions.md'
91
+ - ' Data Structures ' :
92
+ - ' Fundamentals ' :
93
+ - ' data_structures/stack_queue_modification.md'
94
+ - ' data_structures/sparse-table.md'
95
+ - ' Trees ' :
96
+ - ' data_structures/disjoint_set_union.md'
97
+ - ' data_structures/fenwick.md'
98
+ - ' data_structures/sqrt_decomposition.md'
99
+ - ' data_structures/segment_tree.md'
100
+ - ' data_structures/treap.md'
101
+ - ' data_structures/sqrt-tree.md'
102
+ - ' data_structures/randomized_heap.md'
103
+ - ' Advanced ' :
104
+ - ' data_structures/deleting_in_log_n.md'
105
+ - ' Dynamic Programming ' :
106
+ - ' DP optimizations ' :
107
+ - ' dynamic_programming/divide-and-conquer-dp.md'
108
+ - ' dynamic_programming/knuth-optimization.md'
109
+ - ' Tasks ' :
110
+ - ' dynamic_programming/profile-dynamics.md'
111
+ - ' dynamic_programming/zero_matrix.md'
112
+ - ' String Processing ' :
113
+ - ' Fundamentals ' :
114
+ - ' string/string-hashing.md'
115
+ - ' string/rabin-karp.md'
116
+ - ' string/prefix-function.md'
117
+ - ' string/z-function.md'
118
+ - ' string/suffix-array.md'
119
+ - ' string/aho_corasick.md'
120
+ - ' Advanced ' :
121
+ - ' string/suffix-tree-ukkonen.md'
122
+ - ' string/suffix-automaton.md'
123
+ - ' string/lyndon_factorization.md'
124
+ - ' Tasks ' :
125
+ - ' string/expression_parsing.md'
126
+ - ' string/manacher.md'
127
+ - ' string/main_lorentz.md'
128
+
129
+ - ' Linear Algebra ' :
130
+ - ' Matrices ' :
131
+ - ' linear_algebra/linear-system-gauss.md'
132
+ - ' linear_algebra/determinant-gauss.md'
133
+ - ' linear_algebra/determinant-kraut.md'
134
+ - ' linear_algebra/rank-matrix.md'
135
+ - ' Combinatorics ' :
136
+ - ' Fundamentals ' :
137
+ - ' algebra/factorial-divisors.md'
138
+ - ' combinatorics/binomial-coefficients.md'
139
+ - ' combinatorics/catalan-numbers.md'
140
+ - ' Techniques ' :
141
+ - ' combinatorics/inclusion-exclusion.md'
142
+ - ' combinatorics/burnside.md'
143
+ - ' combinatorics/stars_and_bars.md'
144
+ - ' combinatorics/generating_combinations.md'
145
+ - ' Tasks ' :
146
+ - ' combinatorics/bishops-on-chessboard.md'
147
+ - ' combinatorics/bracket_sequences.md'
148
+ - ' combinatorics/counting_labeled_graphs.md'
149
+ - ' Numerical Methods ' :
150
+ - ' Search ' :
151
+ - ' num_methods/ternary_search.md'
152
+ - ' num_methods/roots_newton.md'
153
+ - ' Integration ' :
154
+ - ' num_methods/simpson-integration.md'
155
+ - ' Geometry ' :
156
+ - ' Elementary operations ' :
157
+ - ' geometry/basic-geometry.md'
158
+ - ' geometry/segment-to-line.md'
159
+ - ' geometry/lines-intersection.md'
160
+ - ' geometry/check-segments-intersection.md'
161
+ - ' geometry/segments-intersection.md'
162
+ - ' geometry/circle-line-intersection.md'
163
+ - ' geometry/circle-circle-intersection.md'
164
+ - ' geometry/tangents-to-two-circles.md'
165
+ - ' geometry/length-of-segments-union.md'
166
+ - ' Polygons ' :
167
+ - ' geometry/oriented-triangle-area.md'
168
+ - ' geometry/area-of-simple-polygon.md'
169
+ - ' geometry/point-in-convex-polygon.md'
170
+ - ' geometry/minkowski.md'
171
+ - ' geometry/picks-theorem.md'
172
+ - ' geometry/lattice-points.md'
173
+ - ' Convex hull ' :
174
+ - ' geometry/convex-hull.md'
175
+ - ' geometry/convex_hull_trick.md'
176
+ - ' Sweep-line ' :
177
+ - ' geometry/intersecting_segments.md'
178
+ - ' geometry/point-location.md'
179
+ - ' Miscellaneous ' :
180
+ - ' geometry/nearest_points.md'
181
+ - ' geometry/delaunay.md'
182
+ - ' geometry/vertical_decomposition.md'
183
+ - ' geometry/halfplane-intersection.md'
184
+ - ' Graphs ' :
185
+ - ' Graph traversal ' :
186
+ - ' graph/breadth-first-search.md'
187
+ - ' graph/depth-first-search.md'
188
+ - ' Connected components, bridges, articulations points ' :
189
+ - ' graph/search-for-connected-components.md'
190
+ - ' graph/bridge-searching.md'
191
+ - ' graph/bridge-searching-online.md'
192
+ - ' graph/cutpoints.md'
193
+ - ' graph/strongly-connected-components.md'
194
+ - ' graph/strong-orientation.md'
195
+ - ' Single-source shortest paths ' :
196
+ - ' graph/dijkstra.md'
197
+ - ' graph/dijkstra_sparse.md'
198
+ - ' graph/bellman_ford.md'
199
+ - ' graph/01_bfs.md'
200
+ - ' graph/desopo_pape.md'
201
+ - ' All-pairs shortest paths ' :
202
+ - ' graph/all-pair-shortest-path-floyd-warshall.md'
203
+ - ' graph/fixed_length_paths.md'
204
+ - ' Spanning trees ' :
205
+ - ' graph/mst_prim.md'
206
+ - ' graph/mst_kruskal.md'
207
+ - ' graph/mst_kruskal_with_dsu.md'
208
+ - ' graph/second_best_mst.md'
209
+ - ' graph/kirchhoff-theorem.md'
210
+ - ' graph/pruefer_code.md'
211
+ - ' Cycles ' :
212
+ - ' graph/finding-cycle.md'
213
+ - ' graph/finding-negative-cycle-in-graph.md'
214
+ - ' graph/euler_path.md'
215
+ - ' Lowest common ancestor ' :
216
+ - ' graph/lca.md'
217
+ - ' graph/lca_binary_lifting.md'
218
+ - ' graph/lca_farachcoltonbender.md'
219
+ - ' graph/rmq_linear.md'
220
+ - ' graph/lca_tarjan.md'
221
+ - ' Flows and related problems ' :
222
+ - ' graph/edmonds_karp.md'
223
+ - ' graph/push-relabel.md'
224
+ - ' graph/push-relabel-faster.md'
225
+ - ' graph/dinic.md'
226
+ - ' graph/mpm.md'
227
+ - ' graph/flow_with_demands.md'
228
+ - ' graph/min_cost_flow.md'
229
+ - ' graph/Assignment-problem-min-flow.md'
230
+ - ' Matchings and related problems ' :
231
+ - ' graph/bipartite-check.md'
232
+ - ' graph/kuhn_maximum_bipartite_matching.md'
233
+ - ' Miscellaneous ' :
234
+ - ' graph/topological-sort.md'
235
+ - ' graph/edge_vertex_connectivity.md'
236
+ - ' graph/tree_painting.md'
237
+ - ' graph/2SAT.md'
238
+ - ' graph/hld.md'
239
+ - ' Miscellaneous ' :
240
+ - ' Sequences ' :
241
+ - ' sequences/rmq.md'
242
+ - ' sequences/longest_increasing_subsequence.md'
243
+ - ' others/maximum_average_segment.md'
244
+ - ' sequences/k-th.md'
245
+ - ' Game Theory ' :
246
+ - ' game_theory/games_on_graphs.md'
247
+ - ' game_theory/sprague-grundy-nim.md'
248
+ - ' Schedules ' :
249
+ - ' schedules/schedule_one_machine.md'
250
+ - ' schedules/schedule_two_machines.md'
251
+ - ' schedules/schedule-with-completion-duration.md'
252
+ - ' Miscellaneous ' :
253
+ - ' others/josephus_problem.md'
254
+ - ' others/15-puzzle.md'
255
+ - ' others/stern_brocot_tree_farey_sequences.md'
0 commit comments