For each query relation, we use all positive entity pairs to sample demonstration candidates from the given KG.
for each positive entity pair, we use bi-directional breadth-first search to explore the shortest path between two entities.