Fixed readme

Author: EduMenges

1/dijkstra.hpp

@@ -7,8 +7,9 @@
 using ListItem = std::pair<uint32_t, uint16_t>;
 using Graph = std::vector<std::vector<std::pair<uint32_t, uint16_t>>>;
 
-template <size_t K> class MinHeap {
-  public:
+template <size_t K>
+class MinHeap {
+   public:
     constexpr explicit MinHeap(size_t max_nodes) : node_indexes(max_nodes, UINT32_MAX) {}
 
     [[nodiscard]] constexpr bool empty() const { return heap.empty(); }
@@ -45,7 +46,7 @@ template <size_t K> class MinHeap {
     size_t sift_down_count = 0;
     size_t sift_up_count = 0;
 
-  private:
+   private:
     constexpr void sift_down(size_t index) {
         using namespace std;
 
@@ -102,7 +103,8 @@ struct Result {
     size_t sift_down = 0;
 };
 
-template <size_t K> Result dijkstra(const Graph &graph, uint32_t origin, uint32_t destination) {
+template <size_t K>
+Result dijkstra(const Graph& graph, uint32_t origin, uint32_t destination) {
     using namespace std;
 
     auto n = graph.size();

1/main.cpp

@@ -1,11 +1,11 @@
-#include "dijkstra.hpp"
 #include <iostream>
 #include <sstream>
 #include <string>
+#include "dijkstra.hpp"
 
 using namespace std;
 
-int main(int argc, char *argv[]) {
+int main(int argc, char* argv[]) {
     if (argc < 3) {
         cerr << "Usage: dijkstra <origin> <destination>\n";
         return EXIT_FAILURE;
@@ -37,9 +37,7 @@ int main(int argc, char *argv[]) {
         }
     }
 
-
-
     auto result = dijkstra<2>(graph, origin, destination);
 
     return EXIT_SUCCESS;
-}
+}

1/scaling_dijkstra.cpp

@@ -1,5 +1,5 @@
-#include "mimalloc-new-delete.h"
 #include "dijkstra.hpp"
+#include "mimalloc-new-delete.h"
 
 #include <chrono>
 #include <iostream>
@@ -64,4 +64,4 @@ int main() {
     cout << "Average duration: " << avg_duration << '\n';
 
     return EXIT_SUCCESS;
-}
+}

README.md

@@ -1 +1,23 @@
-# advanced_algorithms
+# Advanced Algorithms
+
+This repository is for the Advanced Algorithms course, thaught by professor Marcus Ritt at UFRGS. It is divided upon 5 tasks, corresponding to directories listed here. All of them were implemented in C++.
+
+## Task 1
+
+Implements the Disjkstra algorithm using a min heap and tests it with varios lenghts of heaps.
+
+## Task 2
+
+Implements BFS, DFS and the fastest path algorithm and compares them when tracing a path between two vertices.
+
+## Task 3
+
+Implements the max flow algorithm to solve the tournament problem.
+
+## Task 4
+
+Implements the Hungarian algorithm that solves the assignment problem.
+
+## Task 5
+
+Solves the knapsack problem using DP and the algorithm proposeed by He & Xu (https://epubs.siam.org/doi/10.1137/1.9781611977936.6), comparing the number of updates required.