Exercise to get the maximum clique returned within a graph.
- Improve control of the vertices belonging to the clique
- Improve the vertex array (use a boolean array instead of integers array)
- Use "bitvector" API, to improve memory space
- Add input of adjacency matrix from file
- Add prints of adjacency matrix (by args)
- Add prints the nodes belonging to the clique (by args)
- Add prints the number of nodes belonging to the clique (by args)
- Add param to specify cbmc backend path