Problem 2203 · Hard

Minimum Weighted Subgraph With the Required Paths

Find the minimum-weight set of directed edges that lets two sources both reach a shared destination. The visual overlays the shortest paths from each source and shows where they merge.

Open the interactive visualisation