This program uses the Python cplex library to solve a vertex cover problem. More information on Vertex
Cover is available in the Wikipedia article. The basic idea
of the problem is to select the smallest set of vertices such that each edge in the graph is incident on
at least one selected vertex. Solving vertex cover is NP-Hard.
For this example, I used the toy graph below.
g