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
Prashant Gupta:
20120923 07:56:34
i m getting SIGKILL plzz chk


Prashant Gupta:
20120923 07:52:08
i m getting SIGKILL plzz chk


Panagiotis Kostopanagiotis:
20120716 20:35:17
Is it possible that one node is connected to itself, it's the only thing i can come up with so my program doesn't output the correct answer all the time :/ 

Piyush Raman Srivastava:
20120712 13:24:31
plz.. tell me why i am getting WA!


Tornike Mandzulashvili:
20120127 15:19:28
why did i get TLE, i am using


axlrose:
20110625 14:50:26
My solution returns the right solutions, but still keep getting the wrong answer, I wonder if it's reading with scanf () or write to printf (), please thanks. 

Sarthak :
20110409 13:13:28
is the given graph directed or nondirected ?? is A is always smaller than B ?


Jose Luis Castrillon Garrido:
20101209 04:15:35
I just got AC using another alg, thank you for your suggestion, I would be honored if you sent to me some algs concerning graphs. 

:D:
20101207 15:38:09
You get WA because there are errors in your program :). Except admins/moderators and problem setter, no one can see your programs. If you want help, go to the forum and make a post the with your code pasted. Last edit: 20101207 15:38:44 

Jose Luis Castrillon Garrido:
20101207 06:52:40
my alg works ok but I dont know why I get WA I whish someone could help me. 
Added by:  Robert Rychcicki 
Date:  20090110 
Time limit:  0.150s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS OBJC PERL6 VB.NET 