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-16 20:58:10 +01:00
parent bd416fcf70
commit 57f7095c3f
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
README.md
View File

@ -9,12 +9,12 @@ implementations of graph-theoretical algorithms and utilities in rust.
> NOTE: this library isn't complete at this point. only checked off points are implemented. > NOTE: this library isn't complete at this point. only checked off points are implemented.
- [x] model (bi-)directional graphs - [x] model (bi-)directional graphs
- [x] representation: `(v, adj(e))` (adjacency matrix approach) - [x] representation: `(v, adj(e))` (adjacency list approach)
- [ ] representation: `(v, adj(e), w(e))` (weighted edges) - [ ] representation: `(v, adj(e), w(e))` (weighted edges)
- [ ] macro: `graph! { ... }` (from adjacency matrix) - [x] macro: `graph! { ... }` (from adjacency list)
- [x] pathfinding - [x] pathfinding
- [x] breadth-first search - [x] breadth-first search
- [ ] depth-first search - [x] depth-first search
- [ ] bidirectional search - [ ] bidirectional search
- [ ] a* search - [ ] a* search
- [ ] dijkstra's algorithm (bidirectionally?) - [ ] dijkstra's algorithm (bidirectionally?)
@ -53,4 +53,5 @@ implementations of graph-theoretical algorithms and utilities in rust.
- [ ] make vertex identities separate from vertex data - [ ] make vertex identities separate from vertex data
- [ ] 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`)