mage
mage copied to clipboard
All Shortest Paths
Description
All shortest paths algorithm. Currently supports defining the target nodes and works only on unweighted directed graphs.
TODO:
- [ ] Source nodes support
- [ ] Weighted paths
- [ ] Undirected paths
- [ ] I/O speedup
Pull request type
- [x] Algorithm/Module
Reviewer checklist (the reviewer checks this part)
Module/Algorithm
- [ ] Core algorithm/module implementation
- [ ] Query module implementation
- [ ] Unit tests
- [ ] End-to-end tests
- [ ] Code documentation
- [ ] README short description
- [ ] Documentation on memgraph/docs
######################################