Maximal Score Path

All submissions for this problem are available.
Problem Statement
Given a weighted and undirected graph G = (V, E), let us define the score of an edge as its weight, and the score of a path as the minimum of the scores of its edges. For each pair of vertices (u, v), let us define a best path as a path with the maximal score, that starts at u and ends at v. Your task is to find out the score of a best path over all pairs of distinct vertices (u, v) given the description of the graph G.
Input
The first line contains V, the number of vertices, and E, the number of edges in the graph. The graph will be weighted, undirected, simple (no self loops and no parallel edges), and connected. Each of the next E lines contains three nonnegative integers u, v, and w, denoting that there is an edge (u, v) in the graph with a score of w. u and v are guaranteed to be distinct, and no edge will repeat in the input.
Output
Output a total of V lines each containing V integers. The vth integer on the uth line should be 0 if u = v, or the score of a best path that starts at vertex u and ends at vertex v.
Constraints
2 ≤ V ≤ 1000
V  1 ≤ E ≤ V(V  1)/2
0 ≤ u, v ≤ V  1
0 ≤ w ≤ 10^8
Example
Input: 3 3 0 1 1 1 2 2 0 2 3 Output: 0 2 3 2 0 2 3 2 0Warning
Large Input/Output. Use faster Input/Output techniques.
Author:  rahulakaneo 
Tester:  gamabunta 
Editorial  http://discuss.codechef.com/problems/RG_01 
Tags  easy, june11, rahulakaneo, re_01 
Date Added:  10042011 
Time Limit:  0.367424 sec 
Source Limit:  50000 Bytes 
Languages:  C, CPP14, JAVA, PYTH, PYTH 3.5, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, CLOJ, FS 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
If you are still having problems, see a sample solution here. 