Add badges

Author: arcondello

README.md

@@ -1,8 +1,11 @@
 qbsolv
 ======
 
+[![pypi](https://img.shields.io/pypi/v/dwave-qbsolv.svg)](https://pypi.python.org/pypi/dwave-qbsolv)
+[![codecov](https://codecov.io/gh/dwavesystems/qbsolv/branch/master/graph/badge.svg)](https://codecov.io/gh/dwavesystems/qbsolv)
 [![Build Status](https://travis-ci.org/dwavesystems/qbsolv.svg?branch=master)](https://travis-ci.org/dwavesystems/qbsolv)
 [![Build status](https://ci.appveyor.com/api/projects/status/y2f7rqxvepn4ak4b/branch/master?svg=true)](https://ci.appveyor.com/project/dwave-adtt/qbsolv/branch/master)
+[![CircleCI](https://circleci.com/gh/dwavesystems/qbsolv.svg?style=svg)](https://circleci.com/gh/dwavesystems/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.