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
roham1381:
20180111 09:30:17
badihi jat 

shivan11:
20171121 18:46:18
Last edit: 20171121 19:18:22 

vershwal:
20171020 16:43:34
Last edit: 20171020 16:44:36 

edujtm:
20171006 09:34:04
Graph is directed. The vertices starts their indexes from 1, not from 0 as said in the description ("all inputs range 0...10000"). 

anmoldua:
20170918 21:32:11
AC in one go 

deadpool_18:
20170819 19:01:43
@mewtomat7 thanks brother :) 

namitp:
20170711 13:48:15
AC In one Go


ngtrthinh:
20170610 13:28:40
:)


mewtomat7:
20170522 03:24:30
Don't assume that the graph is undirected. Last edit: 20170522 03:24:46 

onkar14_n:
20170507 14:40:39
AC in one go 0.19 s.

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 