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.
This topic was automatically closed 30 days after the last reply. New replies are no longer allowed.