mxhagen/gtrs
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

update readme

Browse Source
This commit is contained in:
mxhagen 2025-02-21 20:44:23 +01:00
parent 477cbb13f5
commit 26ff260ac8
1 changed files with 3 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
README.md
View File

@ -17,7 +17,7 @@ implementations of graph-theoretical algorithms and utilities in rust.
- [x] depth-first search - [x] depth-first search
- [ ] bidirectional search - [ ] bidirectional search
- [ ] a* search - [ ] a* search
- [ ] dijkstra's algorithm (bidirectionally?) - [x] dijkstra's algorithm (bidirectionally?)
- [ ] general concepts - [ ] general concepts
- [ ] hamilton paths and cycles - [ ] hamilton paths and cycles
- [ ] euler paths and cycles (hierholzer's algorithm) - [ ] euler paths and cycles (hierholzer's algorithm)
@ -54,4 +54,6 @@ implementations of graph-theoretical algorithms and utilities in rust.
- [ ] if useful, add `(V, inc(E))` representation (incidence matrix) - [ ] if useful, add `(V, inc(E))` representation (incidence matrix)
- [ ] improve allocation size heuristic for queue, visited set, etc in search algos - [ ] improve allocation size heuristic for queue, visited set, etc in search algos
- [ ] improve iterator implementation (allow `for &vert in &g`) - [ ] improve iterator implementation (allow `for &vert in &g`)
- [ ] improve dijkstra (`BinaryHeap::retain` might be slow)
- [ ] improve dijkstra (make bidirectional)