| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2023-02-13 | reformatted lineendings | MZuenni | |
| 2022-11-30 | use all macro | MZuenni | |
| 2022-06-27 | updated tcr | mzuenni | |
| 2017-10-22 | Fixing linebreaks in bitonic TSP. | Paul Jungeblut | |
| 2017-07-30 | simplified code | 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?) | |||
| 2015-12-03 | Improving graoh chapter. | Paul Jungeblut | |
| 2014-11-25 | bitonic tsp | pjungeblut | |
 |
index : tcr | |
| Team Contest Reference |
| summaryrefslogtreecommitdiff |