Josip Matak
Josip Matak
Implementation of `all shortest paths`. Things to consider: how to apply filtering of nodes when traversing paths, and how to include weighted paths along the way. [master < Epic] PR...
Simple working example of `init-script`. To use this kind of format, the user would need to bind `/usr/lib/memgraph/init` volume to the *.cypherl files that would be executed at the start...
### Description Changed default uuid implementation with https://github.com/mariusbancila/stduuid. ### Pull request type - [x] Build related changes
### Description All shortest paths algorithm. Currently supports defining the target nodes and works only on unweighted directed graphs. TODO: - [ ] Source nodes support - [ ] Weighted...
### Description Memgraph meets the ML! Integration of PyTorch Geometric. The idea is to have an off-the-shelf Pytorch data loader from Memgraph. User would have to write his own custom...
Includes easy to use C++ wrapper code which should be improved in the future iterations
## 🐛 Bug When can users expect to have a working M1 version? ``` Could not find a version that satisfies the requirement dgl~=0.9 No matching distribution found for dgl~=0.9...
### Description Execution of Pagerank by providing nodes and edges to subgraph method. Example of usage: ``` MATCH (n)-[e]->(m) WHERE n.id
### Description Implementation of degree centrality algorithm. More information about algorithm: https://www.sci.unich.it/~francesc/teaching/network/degree.html ### Pull request type - [x] Algorithm/Module ###################################### ### Reviewer checklist (the reviewer checks this part) #### Module/Algorithm...