Leetcode Problem 2203. Minimum Weighted Subgraph With the Required Paths

2203. Minimum Weighted Subgraph With the Required Paths

Leetcode Solutions

Create two graphs, one for the original edges and one for the reversed edges.
Run Dijkstra's algorithm from src1 on the original graph to get the shortest paths to all nodes.
Run Dijkstra's algorithm from src2 on the original graph to get the shortest paths to all nodes.
Run Dijkstra's algorithm from dest on the reversed graph to get the shortest paths from all nodes to dest.
Initialize an answer variable to infinity.
Iterate over all nodes and for each node i, calculate the sum of distances from src1 to i, from src2 to i, and from i to dest.
Update the answer with the minimum sum obtained.
If the answer is still infinity, return -1, indicating no such subgraph exists. Otherwise, return the answer.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen