search

dwavesystems / qbsolv

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.)
https://docs.ocean.dwavesys.com/projects/qbsolv
Apache License 2.0
913 stars 229 forks source link

Shape up for release #152

Closed randomir closed 4 years ago

randomir commented 4 years ago
codecov-commenter commented 4 years ago

Codecov Report

Merging #152 into master will increase coverage by 0.02%. The diff coverage is n/a.

Impacted file tree graph

@@            Coverage Diff             @@
##           master     #152      +/-   ##
==========================================
+ Coverage   96.15%   96.17%   +0.02%     
==========================================
  Files           5        5              
  Lines         182      183       +1     
==========================================
+ Hits          175      176       +1     
  Misses          7        7
Impacted Files Coverage Δ
tests/test_can_call.py 94.59% <0.00%> (+0.04%) :arrow_up:

Continue to review full report at Codecov.

Legend - Click here to learn more Δ = absolute <relative> (impact), ø = not affected, ? = missing data Powered by Codecov. Last update f866563...d8a652e. Read the comment docs.