25 Graph traversal and shortest path
Both work over relations, not references or embedded data.
- Traverse — Traverse walks a relation out from the current result, breadth first, and returns the nodes it reaches. The current result is level 0, and you get every node whose shortest distance from it is between minLevel and…
- ShortestPath — ShortestPath finds one shortest path between two nodes over a relation, counting steps: