Write a program to find a cluster editing solution of size k or less on a undirected, unweighted graph. The program should take the name of a graph file as a command line argument and a non negative integer, k. It should output a list of k or fewer edge insertions and/or deletions that transform the graph into a cluster graph or a message that the graph has no solution for the given k. The output should look something like the following along with the example file:

> /.clusteredit graph.txt 3

insert (0,2)

delete (3,5)

delete (2,7)

> ./clusteredit graph.txt 2

No solution

graph.txt :

8 10 0 1 1 2 2 3 0 3 1 3 3 5 2 7 5 7 5 6 6 7