diff --git a/README.md b/README.md
index 9399ab8..08138f3 100644
--- a/README.md
+++ b/README.md
@@ -1,3 +1,8 @@
+
+[![PyPI version](https://img.shields.io/pypi/v/sfas.svg)](https://pypi.org/project/sfas/)
+[![Downloads shield](https://pepy.tech/badge/sfas)](https://pepy.tech/project/sfas)
+[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+
 # Small Feedback Arc Set (sfas)
 Efficient implementation of a greedy algorithm for computing small feedback arc sets in directed weighted multi-graphs.
 This implementation is an adaptation of the algorithm described in Section 2.3 of [this](http://www.vldb.org/pvldb/vol10/p133-simpson.pdf) article, with additional generalization to support weights and parallel edges.
@@ -33,4 +38,4 @@ ouput = greedy.compute_order(graph)
 ### Result:
 1. `List` with all nodes, ordered so that the total weight of edges going backwards (w.r.t. this order) is small
 ## Questions / suggestions welcome
-`arie.matsliah@gmail.com`
\ No newline at end of file
+`arie.matsliah@gmail.com`