Explain a graph path

Names resolve to registry entities (top candidate used, alternatives listed); the search finds the shortest path of up to 4 hops and grades every hop E1–E4 without hiding weak edges.