tcr - Team Contest Reference

Age	Commit message (Collapse)	Author
2017-12-15	Adding code for max weight bipartite matching.	Paul Jungeblut

2017-11-22	Moving a few tables in math section.	Paul Jungeblut

2017-11-22	Changing layout to A4 paper.	Paul Jungeblut

2017-11-21	Newly building document.	Paul Jungeblut

2017-11-21	Adding two more builtins for the number of leading 0-bits.	Paul Jungeblut

2017-11-19	Changing order of two maths tables to get back into the 25 pages.	Paul Jungeblut

2017-11-19	Removing old lines form others section and moving others together.	Paul Jungeblut

2017-11-19	Removing space around sections and subsections.	Paul Jungeblut

2017-11-19	Adding code for 2D segment tree.	Paul Jungeblut

2017-11-19	Deleting old union find implementation.	Paul Jungeblut

2017-11-19	Adding some sample code for a LL1-Parser to build an abstract syntax tree.	Paul Jungeblut

2017-11-17	Small spacing improvements in some maths table.	Paul Jungeblut

2017-11-17	Changing few lines in Tipps/Tricks section and shortenig shortest paths section.	Paul Jungeblut

2017-11-17	Removing text about MSTs, since it wastes space.	Paul Jungeblut

2017-11-17	Correcting date on title page.	Paul Jungeblut

2017-11-17	Adding formular for complete cross product.	Paul Jungeblut

2017-11-17	Adding short paragraph about polya counting.	Paul Jungeblut

2017-11-17	Adding Niklas Fenwick Tree Code.	Paul Jungeblut

2017-11-17	Adding code for skew heaps.	Paul Jungeblut

2017-10-31	Adding short paragraph about Centroid Decomposition.	Paul Jungeblut

2017-10-31	Adding another formular to count the number of derangements.	Paul Jungeblut

2017-10-31	Adding code for the value of the maximum matching.	Paul Jungeblut

2017-10-28	Not printing table of contents. Wastes space.	Paul Jungeblut

2017-10-28	Adding decimal value of 2^31.	Paul Jungeblut

2017-10-28	Removing code for fast input/fast output from doucment. Wastes space.	Paul Jungeblut

2017-10-28	Adding builtins to count number of set bits.	Paul Jungeblut

2017-10-28	Removing push relabel algorithm from document. Wastes space.	Paul Jungeblut

2017-10-28	Taking big int code out of the document. Wastes space.	Paul Jungeblut

2017-10-28	Removing Kruskal code.	Paul Jungeblut

2017-10-28	Removing code to find first unused number.	Paul Jungeblut

2017-10-24	Adding short description on Mo's Algorithm.	Paul Jungeblut

2017-10-22	Fixing linebreaks in bitonic TSP.	Paul Jungeblut

2017-10-22	Adding sieve implementation for Euler's Totient function.	Paul Jungeblut

2017-10-22	Adding code for Möbius Inversion.	Paul Jungeblut

2017-10-22	Removing Java section, because Java sucks and Python is now available.	Paul Jungeblut

2017-10-22	Adding function to count the number of 1-bits in an integer.	Paul Jungeblut

2017-10-22	Removing pointers from trie implementation.	Paul Jungeblut

2017-10-22	Removing pointers from Aho Corasick Automaton.	Paul Jungeblut

2017-10-22	merge.	Paul Jungeblut
	Merge branch 'master' of https://github.com/pjungeblut/ChaosKITs
2017-10-22	Correcting typo in cut vertex/bridge algorithm.	Paul Jungeblut

2017-10-22	Removing constant from matching code.	Paul Jungeblut

2017-10-22	Removing stupid line from segment tree code.	Paul Jungeblut

2017-07-30	Merge pull request #29 from mzuenni/master	Paul Jungeblut
	simplified code
2017-07-30	simplified code	mzuenni

2017-07-29	Merge pull request #28 from mzuenni/master	Paul Jungeblut
	implemented new bitonic tsp algorithm
2017-07-29	removed todo	mzuenni

2017-07-29	reincluded bitonic tsp	mzuenni

2017-07-29	reimplemented old dp solution and added path reconstruction	mzuenni

2017-07-28	fixed last inserted edge	mzuenni

2017-07-28	implemented new bitonic tsp algorithm	mzuenni
	this algorithm technically can be used to to solve bitonic tsp with linear space (by calculating dist[i][j] on the fly) it should be easier to use, a little bit quicker and is able reconstruct the used tour(maybe there is an easier way to reconstruct it?)