Consider the weighted undirected graph with 4 vertices, where the weight of edge {i, j}g is given by the entry Wij in the matrix W.W = {[\table 0 , 2 , 8 , 5 ; 2 , 0 , 5 , 8 ; 8 , 5 , 0 , x ; 5 , 8 , x , 0 ; ]}The largest possible integer value of x, for which at least one shortest path between some pair of vertices will contain the edge with weight x is______.

Test Index