| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2024-02-27 | delete duplicate sparse table LCA | Gloria Mundi | |
| 2024-02-27 | add binary lifting and make old LCA optional | Gloria Mundi | |
| 2023-11-19 | fixed runtime | mzuenni | |
| 2023-11-15 | hld: fix bug | f1or1an | |
| Nach Initialisierung mit root!=0 war nxt[root]!=root. Dadurch gab es (mindestens, aber nicht nur) diesen Fehler: Beim Aufruf von for_intervals mit u=v=root wurde f mit max(in[root], in[nxt[root]] =max(0, in[0]) =in[0], einer quasi beliebigen Zahl, aufgerufen | |||
| 2023-11-09 | fix matrix multiplication | MZuenni | |
| 2023-09-15 | shorten scc code + clear before each call | Noobie99 | |
| 2023-08-29 | fix | Noobie99 | |
| 2023-08-29 | remove 1 pushrelabel + consistency | Noobie99 | |
| 2023-08-29 | small fix + consistency | Noobie99 | |
| 2023-08-29 | consistency | mzuenni | |
| 2023-08-29 | consistency | mzuenni | |
| 2023-08-27 | improved hld | mzuenni | |
| 2023-07-10 | improved dinic, sped up hopcroft-karp | Noobie99 | |
| 2023-05-28 | minor changes + fix lca in hld | Noobie99 | |
| 2023-03-28 | merged | mzuenni | |
| 2023-03-01 | reformatted empty lines | MZuenni | |
| 2023-03-01 | removed direct calls to lst | MZuenni | |
| 2023-03-01 | added digit separator | MZuenni | |
| 2023-03-01 | removed trailing whitespaces and use more structured bindings | MZuenni | |
| 2023-02-28 | simplified tree isomorphism | MZuenni | |
| 2023-02-13 | squezed in new code :D | MZuenni | |
| 2023-02-13 | reformatted lineendings | MZuenni | |
| 2023-01-11 | dont use .size() | MZuenni | |
| 2023-01-10 | change whitespaces | mzuenni | |
| 2022-12-22 | removed usage off nonexisting macro (eb - emplace_back) | Noobie99 | |
| 2022-11-30 | Merge branch 'new-master' of github.com:mzuenni/ContestReference into new-master | MZuenni | |
| 2022-11-30 | use all macro | MZuenni | |
| 2022-10-16 | fixed typo | mzuenni | |
| 2022-06-27 | updated tcr | mzuenni | |
| 2017-12-22 | Adding new code for sparse table implementation and LCA. | Paul Jungeblut | |
| 2017-12-15 | Adding another comment to max weight bipartite matching code. | Paul Jungeblut | |
| 2017-12-15 | Adding some comments in matching code. | Paul Jungeblut | |
| 2017-12-15 | Adding code for max weight bipartite matching. | 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-10-31 | Adding code for the value of the maximum matching. | Paul Jungeblut | |
| 2017-10-28 | Removing push relabel algorithm from document. Wastes space. | Paul Jungeblut | |
| 2017-10-28 | Removing Kruskal code. | Paul Jungeblut | |
| 2017-10-22 | Fixing linebreaks in bitonic TSP. | 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-07-30 | simplified code | mzuenni | |
| 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?) | |||
| 2017-07-22 | Update articulationPoints.cpp | mzuenni | |
| root has an other calculation for isArt | |||
| 2017-07-22 | Update articulationPoints.cpp | mzuenni | |
| updated coments | |||
 |
index : tcr | |
| Team Contest Reference |
| summaryrefslogtreecommitdiff |