Update README and setup package deployments

Signed-off-by: Vadim Markovtsev <[email protected]>

Author: vmarkovtsev

.github/workflows/push.yml

@@ -78,3 +78,24 @@ jobs:
         commit_email: [email protected]
         login: vmarkovtsev
         token: "${{ secrets.BUMP_VERSION_TOKEN }}"
+  release-package:
+    if: "contains(github.event.head_commit.message, 'Bump version') && github.ref == 'refs/heads/master'"
+    name: Release package on PyPI
+    runs-on: ubuntu-20.04
+    steps:
+    - uses: actions/checkout@v2
+    - name: Install dependencies
+      run: pip3 install -U setuptools twine wheel auditwheel
+    - name: Build package
+      run: |
+        python3 setup.py bdist_wheel sdist --format=gztar
+        mv dist/*.whl .
+        auditwheel repair -w dist *.whl
+        rm *.whl
+        ls
+        ls dist
+    - name: Publish package to PyPI
+      uses: pypa/gh-action-pypi-publish@master
+      with:
+        user: __token__
+        password: "${{ secrets.PYPI_API_TOKEN }}"

README.md

@@ -1,4 +1,4 @@
-[![Build Status](https://travis-ci.org/src-d/lapjv.svg?branch=master)](https://travis-ci.org/src-d/lapjv) [![PyPI](https://img.shields.io/pypi/v/lapjv.svg)](https://pypi.python.org/pypi/lapjv)
+[![Build Status](https://github.com/src-d/lapjv/workflows/Push/badge.svg?branch=master)](https://github.com/src-d/lapjv/actions) [![PyPI](https://img.shields.io/pypi/v/lapjv.svg)](https://pypi.python.org/pypi/lapjv)
 
 Linear Assignment Problem solver using Jonker-Volgenant algorithm
 ==================================================================
@@ -9,7 +9,7 @@ the original thanks to the optimization of the augmenting row reduction phase
 using Intel AVX2 intrinsics. It is a native Python 3 module and does
 not work with Python 2.x, stick to pyLAPJV otherwise.
 
-[![Blog post](https://blog.sourced.tech/post/lapjv/mapping.png)](https://blog.sourced.tech/post/lapjv/)
+[![Blog post](doc/mapping.png)](http://web.archive.org/web/20180611012448/https://blog.sourced.tech/post/lapjv//)
 
 [Linear assignment problem](https://en.wikipedia.org/wiki/Assignment_problem)
 is the bijection between two sets with equal cardinality which optimizes the sum