Consider the weighted undirected graph with 4 vertices, where the weight of edge {i, j} is given by the entry Wi j in the matrix W.
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 ______.
