Shortest Path in Weighted Graph

Problem

Given a weighted directed graph with n nodes labeled from 0 to n - 1, an edge list edges where each element is [u, v, w], a source node src, and a destination node dst, return the length of the shortest path from src to dst. If no path exists, return -1. All edge weights are non-negative integers.

Constraints

• 1 <= n <= 10^5
• 0 <= edges.length <= 2 * 10^5
• 0 <= u, v < n
• 0 <= w <= 10^9
• 0 <= src, dst < n
• All edge weights are non-negative