Caravans arrive at the honeycomb cliffs of Beeswick with crates of bridges, and Jaya the cartographer must account for every last one. Task: An undirected weighted graph is given. Print the shortest-path cost from s to t, or -1 if unreachable. Input format: First line: n m s t. Next m lines: u v w. Output format: Print the shortest distance or -1. Constraints: 1 <= n <= 1845; 0 <= m <= 5535; 1 <= s,t,u,v <= n; 0 <= w <= 1000; distance fits 64-bit.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1845; 0 <= m <= 5535; 1 <= s,t,u,v <= n; 0 <= w <= 1000; distance fits 64-bit.
