How do I query the shortest paths for different types of nodes？
For example:kim have a lot of friends, and these friends also have friends, all of whom may have K-Box. Now I want to check with Kim’s closest relation, who has K-Box.
The blue nodes: dgraph type is “Person”, predicate is “name”
The edge between the blue nodes is “friend”
The green nodes: dgraph type is “GameBox”, predicate is “box_name”
The edge between blue node and green node is “has_box”
How do I know what the order of closest relationships is 1–>4–>8.And not1–>2–>5–>9