Khan.randRange(10, 20) nnodes+Khan.randRange(3,nnodes) vertexCover_KA.initJSAV(nnodes,nedges)

Your task in this exercise is to find the minimum vertex cover.

Select the vertices that can form a minimum vertex cover.

[vertexCover_KA.userInput]
if (!vertexCover_KA.checkAnswer() && !guess[0]) return ""; // User did not click, and correct answer is not // initial array state else return vertexCover_KA.checkAnswer();

vertexCover_KA.getSolution()