Edges in shortest paths
Filed under Directi
The question
Given an undirected weighted graph and two vertices x and y, output all edges that are part of any shortest path between them.
No write-up yet. Related questions below have one.
Related Directi questions
Collected from public candidate posts and coding forums. Updated Nov 2026.