TORONTO KIDS COMPUTER CLUB | Aurora Wednesday 18:30 Python Practice 23.02.22.
post-template-default,single,single-post,postid-21787,single-format-standard,ajax_fade,page_not_loaded,,qode-theme-ver-7.6.2,wpb-js-composer js-comp-ver-6.10.0,vc_responsive

Aurora Wednesday 18:30 Python Practice 23.02.22.

26 Feb Aurora Wednesday 18:30 Python Practice 23.02.22.

The clothing factory made very nice t-shirts. But it’s very tired for the staff to get hundreds of pieces of clothing shipped to the store! So they want to find the shortest route to the store from the clothing factory, you can help them?

Input Format
There are multiple test cases. Each case starts with a line contains two integers N, M (N <= 100 , M <= 10000), N represents the number of intersections in the city, the factory is located at intersection number 1, the store is located at the intersection number N, M indicates a couple of route choices in the city. N = M = 0 indicates the end of input.

In next M rows, each row contains three integers A, B, C (1 < = A, B <= N, 1 <= C <= 1000), indicates there is a route between the intersection A and the intersection B, and it takes C minutes to travel from A to B.
There is at least one route from the factory to the store.

Output Format
For each test case, print the minimum minutes needed from factory to the store.

2 1
1 2 3
3 3
1 2 5
2 3 5
3 1 2
0 0

Sample Output
No Comments

Sorry, the comment form is closed at this time.