Java program to find the minimum cost to color all vertices of an Undirected Graph
import java . util . * ; class GFG { static final int MAX = 10 ; @ SuppressWarnings ( " unchecked " ) static Vector < Integer > [ ] adj = new Vector [ MAX ] ; static int min_cost_node ;