Question

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 .

Answer 1

Consider the weighted undirected graph with 4 vertices, where the weight of edge {i,j} is given by the entry Wij in the matrix W.

 W=[02852058850x58x0]

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 ___________.