mariamgui/CliqueSATSolver
This provides a SAT solver the graph cliaue problem which is NP-hard. A clique in a graph is a subset of vertices, all adjacent to each other, also called complete subgraphs in a graph.
Python
This provides a SAT solver the graph cliaue problem which is NP-hard. A clique in a graph is a subset of vertices, all adjacent to each other, also called complete subgraphs in a graph.
Python