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