Caravans arrive at the fox den of Rustwood with crates of bridges, and Finn the scribe must account for every last one. Task: Print the minimum number of edges on a path from s to t, or -1. Input format: First line: n m s t. Next m lines: u v. Output format: Print the BFS distance or -1. Constraints: 1 <= n <= 1828; 0 <= m <= 3656.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1828; 0 <= m <= 3656.
