0 connected entities within 2 hops.
Find the shortest connection between this entity and any other in the graph.