Qbsolv,a decomposing solver, finds a minimum value of a large quadratic unconstrained binary optimization (QUBO) problem by splitting it into pieces solved either via a D-Wave system or a classical tabu solver. (Note that qbsolv by default uses its internal classical solver. Access to a D-Wave system must be arranged separately.)
When working on QBSolv as a developer and making local changes, it is often convenient to use
to quickly test changes (see link).
While we're at it, we might also want to link the cython docs explaining the different cython file types (e.g. pxd files or just the basic tutorial).