started pythons script for notebook generation

Author: jaehyunp

filter.cc renamed to OLD/filter.cc

@@ -1,29 +1,45 @@
+# Any line followed by a '#' character is ignored
+# Section headings must be in square brackets
+# Subsections within a section should follow the format:
+#   [filename within code directory][tab character \t][subsection title]
+
 [Combinatorial optimization]
+#MaxFlow.cc	Dense max-flow
 Dinic.cc	Sparse max-flow
 MinCostMaxFlow.cc	Min-cost max-flow
 PushRelabel.cc	Push-relabel max-flow	
 MinCostMatching.cc	Min-cost matching
 MaxBipartiteMatching.cc	Max bipartite matchine
 MinCut.cc	Global min-cut
 GraphCutInference.cc	Graph cut inference
+#MaxFlow.java	Max-flow (Java)
+#MinCostMaxFlow.java	Min-cost max-flow (Java)
 
 [Geometry]
 ConvexHull.cc	Convex hull
 Geometry.cc	Miscellaneous geometry
 JavaGeometry.java	Java geometry
 Geom3D.java	3D geometry
 Delaunay.cc	Slow Delaunay triangulation
+#Delaunay.java	Slow Delaunay triangulation (Java)
+
 [Numerical algorithms]
 Euclid.cc	Number theory (modular, Chinese remainder, linear Diophantine)
 GaussJordan.cc	Systems of linear equations, matrix inverse, determinant
 ReducedRowEchelonForm.cc	Reduced row echelon form, matrix rank
 FFT_new.cc	Fast Fourier transform
 Simplex.cc	Simplex algorithm
+#FFT.cc	Fast Fourier transform (C++)
 
 [Graph algorithms]
+#BellmanFord.cc	Bellman-Ford shortest paths with negative edge weights (C++)
+#DijkstraFloyd.cc	Dijkstra and Floyd's algorithm (C++)
 FastDijkstra.cc	Fast Dijkstra's algorithm
 SCC.cc	Strongly connected components
 EulerianPath.cc	Eulerian path
+#Kruskal.cc	Kruskal's algorithm
+#Prim.cc	Minimum spanning trees
+
 [Data structures]
 SuffixArray.cc	Suffix array
 BIT.cc	Binary Indexed Tree
@@ -42,3 +58,11 @@ IO.cc	C++ input/output
 KMP.cc	Knuth-Morris-Pratt
 LatLong.cc	Latitude/longitude
 EmacsSettings.txt	Emacs settings
+#TopologicalSort.cc	Topological sort (C++)
+#Dates.java	Dates (Java)
+#DecFormat.java	Decimal output formatting (Java)
+#RandomSTL.cc	Random STL stuff
+#CSP.cc	Constraint satisfaction problems
+#FastExpo.cc	Fast exponentiation
+#LCS.cc	Longest common subsequence
+#MillerRabin.c	Miller-Rabin Primality Test (C)

format_notebook.pl renamed to OLD/format_notebook.pl

@@ -0,0 +1,33 @@
+#!/usr/bin/python
+
+import subprocess
+
+if __name__ == "__main__":
+    section_name = None
+    sections = []
+    code_dir = 'code'
+    with open('contents.txt', 'r') as f:
+        for line in f:
+            if '#' in line: line = line[:line.find('#')]
+            line = line.strip()
+            if len(line) == 0: continue
+            if line[0] == '[':
+                if section_name is not None:
+                    sections.append((section_name, subsections))
+                section_name = line[1:-1]
+                subsections = []
+            else:
+                tmp = line.split('\t', 1)
+                if len(tmp) == 1:
+                    raise ValueError('Subsection parse error: %s' % line)
+                filename = tmp[0]
+                subsection_name = tmp[1]
+                if subsection_name is None:
+                    raise ValueError('Subsection given without section')
+                subsections.append((filename, subsection_name))
+
+    html = ''
+    for (section_name, subsections) in sections:
+        enscript_options = ["enscript", "-E", "--color", "--language=html", "-o -"]
+        filenames = [code_dir + '/' + filename for (filename, _) in subsections]
+        section_html = subprocess.check_output(enscript_options + filenames)