Correct answer will be upvoted else downvoted. Computer science. You are given a weighted undirected associated diagram comprising of n vertices and m edges. It is ensured that there are no self-circles or various edges in the given diagram. How about we characterize the heaviness of the way comprising of k edges with files e1,e2,… ,ek as ∑i=1kwei−maxi=1kwei+mini=1kwei, where wi — weight of the I-th edge in the chart. Your errand is to track down the base load of the way from the 1-st vertex to the I-th vertex for every I (2≤i≤n). Input The principal line contains two integers n and m (2≤n≤2⋅105; 1≤m≤2⋅105) — the number of vertices and the number of edges in the chart. Following m lines contains three integers vi,ui,wi (1≤vi,ui≤n; 1≤wi≤109; vi≠ui) — endpoints of the I-th edge and its weight separately. Output Print n−1 integers — the base load of the way from 1-st vertex to the I-th vertex for every I (2≤i≤n).
Correct answer will be upvoted else downvoted. Computer science.
You are given a weighted undirected associated diagram comprising of n vertices and m edges. It is ensured that there are no self-circles or various edges in the given diagram.
How about we characterize the heaviness of the way comprising of k edges with files e1,e2,… ,ek as ∑i=1kwei−maxi=1kwei+mini=1kwei, where wi — weight of the I-th edge in the chart.
Your errand is to track down the base load of the way from the 1-st vertex to the I-th vertex for every I (2≤i≤n).
Input
The principal line contains two integers n and m (2≤n≤2⋅105; 1≤m≤2⋅105) — the number of vertices and the number of edges in the chart.
Following m lines contains three integers vi,ui,wi (1≤vi,ui≤n; 1≤wi≤109; vi≠ui) — endpoints of the I-th edge and its weight separately.
Output
Print n−1 integers — the base load of the way from 1-st vertex to the I-th vertex for every I (2≤i≤n).
Step by step
Solved in 2 steps
