|
1 | 1 | \section{Combinatorial optimization}
|
2 | 2 | \subsection{Sparse max-flow}
|
3 | 3 | \raggedbottom\lstinputlisting[style=customcc]{code/Dinic.cc}
|
| 4 | +\hrulefill |
4 | 5 | \subsection{Min-cost max-flow}
|
5 | 6 | \raggedbottom\lstinputlisting[style=customcc]{code/MinCostMaxFlow.cc}
|
| 7 | +\hrulefill |
6 | 8 | \subsection{Push-relabel max-flow}
|
7 | 9 | \raggedbottom\lstinputlisting[style=customcc]{code/PushRelabel.cc}
|
| 10 | +\hrulefill |
8 | 11 | \subsection{Min-cost matching}
|
9 | 12 | \raggedbottom\lstinputlisting[style=customcc]{code/MinCostMatching.cc}
|
| 13 | +\hrulefill |
10 | 14 | \subsection{Max bipartite matching}
|
11 | 15 | \raggedbottom\lstinputlisting[style=customcc]{code/MaxBipartiteMatching.cc}
|
| 16 | +\hrulefill |
12 | 17 | \subsection{Global min-cut}
|
13 | 18 | \raggedbottom\lstinputlisting[style=customcc]{code/MinCut.cc}
|
| 19 | +\hrulefill |
14 | 20 | \subsection{Graph cut inference}
|
15 | 21 | \raggedbottom\lstinputlisting[style=customcc]{code/GraphCutInference.cc}
|
16 | 22 |
|
17 |
| -% \section{Geometry} |
18 |
| -% \subsection{Convex hull} |
19 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/ConvexHull.cc} |
20 |
| -% \subsection{Miscellaneous geometry} |
21 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/Geometry.cc} |
22 |
| -% \subsection{Java geometry} |
23 |
| -% \raggedbottom\lstinputlisting[style=customjava]{code/JavaGeometry.java} |
24 |
| -% \subsection{3D geometry} |
25 |
| -% \raggedbottom\lstinputlisting[style=customjava]{code/Geom3D.java} |
26 |
| -% \subsection{Slow Delaunay triangulation} |
27 |
| -% \raggedbottom\lstinputlisting[style=customjava]{code/Delaunay.cc} |
| 23 | +\section{Geometry} |
| 24 | +\subsection{Convex hull} |
| 25 | +\raggedbottom\lstinputlisting[style=customcc]{code/ConvexHull.cc} |
| 26 | +\hrulefill |
| 27 | +\subsection{Miscellaneous geometry} |
| 28 | +\raggedbottom\lstinputlisting[style=customcc]{code/Geometry.cc} |
| 29 | +\hrulefill |
| 30 | +\subsection{Java geometry} |
| 31 | +\raggedbottom\lstinputlisting[style=customjava]{code/JavaGeometry.java} |
| 32 | +\hrulefill |
| 33 | +\subsection{3D geometry} |
| 34 | +\raggedbottom\lstinputlisting[style=customjava]{code/Geom3D.java} |
| 35 | +\hrulefill |
| 36 | +\subsection{Slow Delaunay triangulation} |
| 37 | +\raggedbottom\lstinputlisting[style=customjava]{code/Delaunay.cc} |
28 | 38 |
|
29 |
| -% \section{Numerical algorithms} |
30 |
| -% \subsection{Number theory (modular, Chinese remainder, linear Diophantine)} |
31 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/Euclid.cc} |
32 |
| -% \subsection{Systems of linear equations, matrix inverse, determinant} |
33 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/GaussJordan.cc} |
34 |
| -% \subsection{Reduced row echelon form, matrix rank} |
35 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/ReducedRowEchelonForm.cc} |
36 |
| -% \subsection{Fast Fourier transform} |
37 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/FFT_new.cpp} |
38 |
| -% \subsection{Simplex algorithm} |
39 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/Simplex.cc} |
| 39 | +\section{Numerical algorithms} |
| 40 | +\subsection{Number theory (modular, Chinese remainder, linear Diophantine)} |
| 41 | +\raggedbottom\lstinputlisting[style=customcc]{code/Euclid.cc} |
| 42 | +\hrulefill |
| 43 | +\subsection{Systems of linear equations, matrix inverse, determinant} |
| 44 | +\raggedbottom\lstinputlisting[style=customcc]{code/GaussJordan.cc} |
| 45 | +\hrulefill |
| 46 | +\subsection{Reduced row echelon form, matrix rank} |
| 47 | +\raggedbottom\lstinputlisting[style=customcc]{code/ReducedRowEchelonForm.cc} |
| 48 | +\hrulefill |
| 49 | +\subsection{Fast Fourier transform} |
| 50 | +\raggedbottom\lstinputlisting[style=customcc]{code/FFT_new.cpp} |
| 51 | +\hrulefill |
| 52 | +\subsection{Simplex algorithm} |
| 53 | +\raggedbottom\lstinputlisting[style=customcc]{code/Simplex.cc} |
40 | 54 |
|
41 |
| -% \section{Graph algorithms} |
42 |
| -% \subsection{Fast Dijkstra\'s algorithm} |
43 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/FastDijkstra.cc} |
44 |
| -% \subsection{Strongly connected components} |
45 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/SCC.cc} |
46 |
| -% \subsection{Eulerian path} |
47 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/EulerianPath.cc} |
| 55 | +\section{Graph algorithms} |
| 56 | +\subsection{Fast Dijkstra\'s algorithm} |
| 57 | +\raggedbottom\lstinputlisting[style=customcc]{code/FastDijkstra.cc} |
| 58 | +\hrulefill |
| 59 | +\subsection{Strongly connected components} |
| 60 | +\raggedbottom\lstinputlisting[style=customcc]{code/SCC.cc} |
| 61 | +\hrulefill |
| 62 | +\subsection{Eulerian path} |
| 63 | +\raggedbottom\lstinputlisting[style=customcc]{code/EulerianPath.cc} |
48 | 64 |
|
49 |
| -% \section{Data structures} |
50 |
| -% \subsection{Suffix array} |
51 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/SuffixArray.cc} |
52 |
| -% \subsection{Binary Indexed Tree} |
53 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/BIT.cc} |
54 |
| -% \subsection{Union-find set} |
55 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/UnionFind.cc} |
56 |
| -% \subsection{KD-tree} |
57 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/KDTree.cc} |
58 |
| -% \subsection{Splay tree} |
59 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/splay.cpp} |
60 |
| -% \subsection{Lazy segment tree} |
61 |
| -% \raggedbottom\lstinputlisting[style=customjava]{code/SegmentTreeLazy.java} |
62 |
| -% \subsection{Lowest common ancestor} |
63 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/LCA.cc} |
| 65 | +\section{Data structures} |
| 66 | +\subsection{Suffix array} |
| 67 | +\raggedbottom\lstinputlisting[style=customcc]{code/SuffixArray.cc} |
| 68 | +\hrulefill |
| 69 | +\subsection{Binary Indexed Tree} |
| 70 | +\raggedbottom\lstinputlisting[style=customcc]{code/BIT.cc} |
| 71 | +\hrulefill |
| 72 | +\subsection{Union-find set} |
| 73 | +\raggedbottom\lstinputlisting[style=customcc]{code/UnionFind.cc} |
| 74 | +\hrulefill |
| 75 | +\subsection{KD-tree} |
| 76 | +\raggedbottom\lstinputlisting[style=customcc]{code/KDTree.cc} |
| 77 | +\hrulefill |
| 78 | +\subsection{Splay tree} |
| 79 | +\raggedbottom\lstinputlisting[style=customcc]{code/splay.cpp} |
| 80 | +\hrulefill |
| 81 | +\subsection{Lazy segment tree} |
| 82 | +\raggedbottom\lstinputlisting[style=customjava]{code/SegmentTreeLazy.java} |
| 83 | +\hrulefill |
| 84 | +\subsection{Lowest common ancestor} |
| 85 | +\raggedbottom\lstinputlisting[style=customcc]{code/LCA.cc} |
64 | 86 |
|
65 |
| -% \section{Miscellaneous} |
66 |
| -% \subsection{Longest increasing subsequence} |
67 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/LongestIncreasingSubsequence.cc} |
68 |
| -% \subsection{Dates} |
69 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/Dates.cc} |
70 |
| -% \subsection{Regular expressions} |
71 |
| -% \raggedbottom\lstinputlisting[style=customjava]{code/LogLan.java} |
72 |
| -% \subsection{Prime numbers} |
73 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/Primes.cc} |
74 |
| -% \subsection{C++ input/output} |
75 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/IO.cpp} |
76 |
| -% \subsection{Knuth-Morris-Pratt} |
77 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/KMP.cpp} |
78 |
| -% \subsection{Latitude/longitude} |
79 |
| -% \raggedbottom\lstinputlisting[style=customcc]{code/LatLong.cpp} |
80 |
| -% \subsection{Emacs settings} |
81 |
| -% \raggedbottom\lstinputlisting[style=customtxt]{code/EmacsSettings.txt} |
| 87 | +\section{Miscellaneous} |
| 88 | +\subsection{Longest increasing subsequence} |
| 89 | +\raggedbottom\lstinputlisting[style=customcc]{code/LongestIncreasingSubsequence.cc} |
| 90 | +\hrulefill |
| 91 | +\subsection{Dates} |
| 92 | +\raggedbottom\lstinputlisting[style=customcc]{code/Dates.cc} |
| 93 | +\hrulefill |
| 94 | +\subsection{Regular expressions} |
| 95 | +\raggedbottom\lstinputlisting[style=customjava]{code/LogLan.java} |
| 96 | +\hrulefill |
| 97 | +\subsection{Prime numbers} |
| 98 | +\raggedbottom\lstinputlisting[style=customcc]{code/Primes.cc} |
| 99 | +\hrulefill |
| 100 | +\subsection{C++ input/output} |
| 101 | +\raggedbottom\lstinputlisting[style=customcc]{code/IO.cpp} |
| 102 | +\hrulefill |
| 103 | +\subsection{Knuth-Morris-Pratt} |
| 104 | +\raggedbottom\lstinputlisting[style=customcc]{code/KMP.cpp} |
| 105 | +\hrulefill |
| 106 | +\subsection{Latitude/longitude} |
| 107 | +\raggedbottom\lstinputlisting[style=customcc]{code/LatLong.cpp} |
| 108 | +\hrulefill |
| 109 | +\subsection{Emacs settings} |
| 110 | +\raggedbottom\lstinputlisting[style=customtxt]{code/EmacsSettings.txt} |
0 commit comments