-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.out
45 lines (45 loc) · 2.66 KB
/
main.out
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
\BOOKMARK [1][-]{section*.2}{C++}{}% 1
\BOOKMARK [1][-]{section*.3}{Computations}{}% 2
\BOOKMARK [2][-]{section*.4}{Greatest Common Divisor}{section*.3}% 3
\BOOKMARK [2][-]{section*.5}{Binomial Coefficients}{section*.3}% 4
\BOOKMARK [1][-]{section*.6}{Data Structures}{}% 5
\BOOKMARK [2][-]{section*.7}{Union Find}{section*.6}% 6
\BOOKMARK [1][-]{section*.8}{Math-Stuff}{}% 7
\BOOKMARK [2][-]{section*.9}{Euclid-Stuff}{section*.8}% 8
\BOOKMARK [2][-]{section*.10}{Gauss-Jordan}{section*.8}% 9
\BOOKMARK [2][-]{section*.11}{Collected Binomials}{section*.8}% 10
\BOOKMARK [1][-]{section*.12}{Shortest Paths}{}% 11
\BOOKMARK [2][-]{section*.13}{Floyd-Warshall}{section*.12}% 12
\BOOKMARK [2][-]{section*.14}{Dijkstra/Java}{section*.12}% 13
\BOOKMARK [2][-]{section*.15}{Bellman-Ford/Java}{section*.12}% 14
\BOOKMARK [1][-]{section*.16}{Flow}{}% 15
\BOOKMARK [2][-]{section*.17}{MaxFlow Push-Relabel}{section*.16}% 16
\BOOKMARK [1][-]{section*.18}{Matching}{}% 17
\BOOKMARK [2][-]{section*.19}{Max Bipartite Matching}{section*.18}% 18
\BOOKMARK [1][-]{section*.20}{Graph Stuff}{}% 19
\BOOKMARK [2][-]{section*.21}{Strongly Connected Components}{section*.20}% 20
\BOOKMARK [2][-]{section*.22}{Topological Sort}{section*.20}% 21
\BOOKMARK [2][-]{section*.23}{Bruecken - Artikulationspunkte}{section*.20}% 22
\BOOKMARK [2][-]{section*.24}{Minimal Spanning Tree \(Prim\)}{section*.20}% 23
\BOOKMARK [1][-]{section*.25}{Strings}{}% 24
\BOOKMARK [2][-]{section*.26}{Suffix Array}{section*.25}% 25
\BOOKMARK [2][-]{section*.27}{Knuth-Morris-Pratt Algorithm}{section*.25}% 26
\BOOKMARK [1][-]{section*.28}{Geometry}{}% 27
\BOOKMARK [2][-]{section*.29}{Geometry/C++}{section*.28}% 28
\BOOKMARK [2][-]{section*.30}{Geometry/Java}{section*.28}% 29
\BOOKMARK [2][-]{section*.31}{Graham Scan \205 Konvexe Huelle}{section*.28}% 30
\BOOKMARK [2][-]{section*.32}{Delaunay Triangulation}{section*.28}% 31
\BOOKMARK [1][-]{section*.33}{Trees}{}% 32
\BOOKMARK [2][-]{section*.34}{Binary Indexed Tree}{section*.33}% 33
\BOOKMARK [2][-]{section*.35}{Segment Tree}{section*.33}% 34
\BOOKMARK [2][-]{section*.36}{KD-tree}{section*.33}% 35
\BOOKMARK [1][-]{section*.37}{Misc}{}% 36
\BOOKMARK [2][-]{section*.38}{Longest Increasing Subsequence}{section*.37}% 37
\BOOKMARK [2][-]{section*.39}{Simulated Annealing}{section*.37}% 38
\BOOKMARK [2][-]{section*.40}{Simplex Algorithm}{section*.37}% 39
\BOOKMARK [2][-]{section*.41}{Dates}{section*.37}% 40
\BOOKMARK [2][-]{section*.42}{Primes}{section*.37}% 41
\BOOKMARK [2][-]{section*.43}{LatLon}{section*.37}% 42
\BOOKMARK [2][-]{section*.44}{Bounded Knapsack}{section*.37}% 43
\BOOKMARK [2][-]{section*.45}{Binary Search}{section*.37}% 44
\BOOKMARK [1][-]{lstnumber.-33.15}{Theoretical CS Cheat Sheet}{}% 45