Hi, Does dgraph has templates or libraries to support graph Algorithms like Shortest Paths , Pageranks etc.
We have K-Shortest Path Queries https://docs.dgraph.io/query-language/#k-shortest-path-queries
nope, but there’s a similar thing we gonna support in the future.
For now, there’s no way to use algos without hard code it in the code base. Also, If you have a sense of how to implement them, PRs are welcome.
Thanks Michel, How about ways to derive centralities? Do we have any template
Also any reference how to write BFS or DFS queried?