[UVA] 1198 - The Geodetic Set Problem
Let
G = (V, E) be a connected graph without loops and multiple edges, where V and E are the vertex and edge,
respectively, sets of G. For any two vertices
u, v V , the distance between vertices u and v in G
is the number of edges in a shortest u - v path. A shortes...
