🕸⚐ Maximum Independent Set

The Maximum Independent Set problem is a constraint-solving problem on graphs. Many industries use approximate algorithms to find approximate solutions to this problem, as it is key to all sorts of applied issues of scheduling, optimization, etc.

The Pasqal Maximum Independent Set library is a simple library designed to solve the Maximum Independent Set problem through quantum algorithms -- using either a quantum computer, if you have access to one, or a built-in quantum emulator.

Closed bounties:

• $200 | [Application] Add a graph coloring solver
  closed by: SpeedCode210
• $200 | [Application] Add a 3SAT solver
  closed by: SpeedCode210
• $50 | [Feature] Add visualization functionality for original graph and MIS solution
  closed by: Newtech66
• $50 | [Testing] Accept instances in DIMACS format
  closed by: y-richie-y