How to find all paths given two nodes and max length of path


#1

Hello,
Does Dgraph supports finding all paths given two nodes and max length of path? One of the use case is to find the relationship between two companies in database.
I tried to use K-Shortest Path Queries but it’s very slow when many predicates(about 100) are specified.
Thanks!