Hi all, I have a question regarding the possibility to do BFS (breadth first search) in graql over a “directed” graph. Lets say I have a family tree with “directed” edges (created roles in the relationship parent -> child). I want to be able to find the path between two persons P1 and P2 only if the P1 is the ancestor of the P2 (has a clear sequence of parent->child relationships in that order). I need to return all nodes on the found path in Java.
The example with path and subgraphs given at http://dev.grakn.ai/docs/distributed-analytics/compute-shortest-path finds a path between Jacob and Barbara which is not suitable as they are at the same level of the tree and therefore Jacob is not ancestor of Barbara.
(asked this in grakn-community slack, was suggested to post it here)