update readme
This commit is contained in:
parent
dfbc6c309a
commit
74b438efaa
@ -19,7 +19,7 @@ implementations of graph-theoretical algorithms and utilities in rust.
|
|||||||
- [ ] a* search
|
- [ ] a* search
|
||||||
- [x] dijkstra's algorithm (bidirectionally?)
|
- [x] dijkstra's algorithm (bidirectionally?)
|
||||||
- [ ] general concepts
|
- [ ] general concepts
|
||||||
- [ ] hamilton paths and cycles
|
- [x] hamilton paths and cycles
|
||||||
- [ ] euler paths and cycles (hierholzer's algorithm)
|
- [ ] euler paths and cycles (hierholzer's algorithm)
|
||||||
- [ ] chromatic number (graph coloring), DSATUR, edge coloring
|
- [ ] chromatic number (graph coloring), DSATUR, edge coloring
|
||||||
- [ ] connectivity, strongly connected components
|
- [ ] connectivity, strongly connected components
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user