summaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorMartin Kagamino Lehoux <martin@lehoux.net>2024-07-28 18:24:22 +0200
committerMartin Kagamino Lehoux <martin@lehoux.net>2024-07-28 18:24:22 +0200
commitc3c8381b5d376263f4b14ea3e5328f7ab8ad2142 (patch)
tree3365e8a1f8877c25084e7c86072617ff7f498716 /README.md
parent406625f7074233b381c3e01de751250d05b04f9d (diff)
test: Add failing test for climb inside long false flat
Diffstat (limited to 'README.md')
-rw-r--r--README.md3
1 files changed, 1 insertions, 2 deletions
diff --git a/README.md b/README.md
index adc3787..38c8826 100644
--- a/README.md
+++ b/README.md
@@ -17,8 +17,6 @@
- Get back what is interesting in previous projects
- Go bike:
- Only tooling for golang, project is different
- - Rust bike
- - Algorithm + example
- Django bike
- https://github.com/paulmach/osm
- https://github.com/tkrajina/gpxgo
@@ -30,6 +28,7 @@
- CI / Tooling
- Tests
- linter for calls to `make([]..., n)` that then use append
+- try this algo: inc end while score inc, then inc start while score inc, again until optimum
## Examples