EZDIJKST  Easy Dijkstra Problem
Determine the shortest path between the specified vertices in the graph given in the input data.
Hint: You can use Dijkstra's algorithm.
Hint 2: if you're a lazy C++ programmer, you can use set and cin/cout (with sync_with_stdio(0))  it should suffice.
Input
first line  one integer  number of test cases
For each test case the numbers V, K (number of vertices, number of edges) are given,
Then K lines follow, each containing the following numbers separated by a single space:
a_{i}, b_{i}, c_{i}
It means that the graph being described contains an edge from a_{i} to b_{i},
with a weight of c_{i}.
Below the graph description a line containing a pair of integers A, B is present.
The goal is to find the shortest path from vertex A to vertex B.
All numbers in the input data are integers in the range 0..10000.
Output
For each test case your program should output (in a separate line) a single number C  the length of the shortest path from vertex A to vertex B. In case there is no such path, your program should output a single word "NO" (without quotes)
Example
Input: 3 3 2 1 2 5 2 3 7 1 3 3 3 1 2 4 1 3 7 2 3 1 1 3 3 1 1 2 4 1 3 Output: 12 5 NO
hide comments
hamobos_499:
20191212 15:33:42
The graph is directed btw 

gabirosa:
20191203 02:54:36
tenso migos 

hetp111:
20190902 13:48:50
memset doesnt work for big value.... use fill() instead or a loop.


adist98:
20190814 11:57:52
Lazy Dijkstra will work here without any issues. 

nayeem_joy:
20190810 15:54:39
My solution here


tacongnam:
20190606 04:47:35
What type of the graph? Is it directed / undirected or cycle graph? 

amitjoshi:
20190213 22:47:12
i want to submit a solution but then it asks me to sign in and then I can't submit the solution Last edit: 20190213 22:47:48 

baby_doll:
20181220 13:44:38
F[edited] of You need to mention whether the graph is directed or not


imabhinav:
20180826 16:06:53
Take directed graph 

lamia2658:
20180411 12:38:15
dont make mistake by thinking the graph as undirected; 
Added by:  Robert Rychcicki 
Date:  20090110 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS OBJC PERL6 VB.NET 