Update README.md

README.md

@@ -2,3 +2,26 @@
 
 [![build](https://github.com/FilippoFantinato/algorithms-on-graphs/actions/workflows/build.yml/badge.svg?branch=main)](https://github.com/FilippoFantinato/algorithms-on-graphs/actions/workflows/build.yml)
 [![Coverage Status](https://coveralls.io/repos/github/FilippoFantinato/algorithms-on-graphs/badge.svg?branch=main&service=github&kill_cache=1)](https://coveralls.io/github/FilippoFantinato/algorithms-on-graphs?branch=main)
+
+A collection of algorithms on graphs implemented in Rust just for fun.
+
+| Algorithm                             | Implemented |
+| ------------------------------------- | --- |
+| Stoer and Wagner minimum cut          | :x: |
+| Karger and Stein minimum cut          | :x: |
+| Graph coloring                        | :x: |
+| Minimum vertex cover                  | :x: |
+| Vertex cover                          | :x: |
+| Travelling Salesman Problem           | :x: |
+| Bellman–Ford algorithm                | :x: |
+| Dijkstra's algorithm                  | :x: |
+| Prim's algorithm                      | :x: |
+| Connectivity s-t                      | :x: |
+| Finding out all cycles                | :x: |
+| Counting connected components         | :x: |
+| A* search                             | :x: |
+| Depth-first search                    | :x: |
+| Breadth-first search                  | :x: |
+| Kruskal's algorithm with union find   | :heavy_check_mark: |
+| Kruskal's algorithm                   | :heavy_check_mark: |
+| Checking for ciclicity                | :heavy_check_mark:  |