Freaks City

The problem involves finding the minimum number of vertices to remove from an undirected graph to make it disconnected. Problem Analysis When a graph becomes disconnected, there exist at least two vertices that cannot reach each other. We can enumerate these two vertices as source and sink, then determine the minimum number of other vertices th ...