From 8403e3a8129b2d3e65a33e85a688c2af305050f9 Mon Sep 17 00:00:00 2001 From: Bartosz Rodziewicz Date: Thu, 24 May 2018 22:51:54 +0200 Subject: [PATCH] Add description of task and app to README --- README.md | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/README.md b/README.md index 11c831b..a23ce1a 100644 --- a/README.md +++ b/README.md @@ -1,3 +1,29 @@ # Graph Representations and Algorithms Comparison Implementation of two graph representations and few algorithms with comparison of how fast they perform. + +Author: Bartosz Rodziewicz + +The task done as a second project for Algorithms and computational complexity (Struktury danych i złożoność obliczeniowa, yes this is official English translation). + +The task was to implement a way to store graphs in the app using these two representations: +* Incidence Matrix +* Adjacency List + +And implement 5 following algorithms: +* Minimum Spanning Tree + * Prim's algorithm + * Kruskal's algorithm +* Shortest Path + * Dijkstra's algorithm + * Bellman–Ford algorithm +* Max Flow + * Ford–Fulkerson algorithm + * with depth-first search + * with depth-first and breadth-first search + +Using STL or Boost libraries was taken as a disadvantage. + +My app covers the most basic solution so I implement both ways of storing graphs using STL structures and two algorithms: +* Prim's algorithm +* Dijkstra's algorithm