Merge branch 'main' of https://github.com/CSRT-NTUA/AlgoPlus

README.md

@@ -7,6 +7,7 @@ AlgoPlus is a C++ library that includes ready to use complex Data Structures.
 [![Gitpod Ready-to-Code](https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod)](https://gitpod.io/#https://github.com/CSRT-NTUA/AlgoPlus)
 [![CodeQL CI](https://github.com/TheAlgorithms/C-Plus-Plus/actions/workflows/codeql.yml/badge.svg)](https://github.com/CSRT-NTUA/AlgoPlus/actions/workflows/codeql.yml)
 [![Awesome CI](https://github.com/CSRT-NTUA/AlgoPlus/workflows/Awesome%20CI%20Workflow/badge.svg)](https://github.com/CSRT-NTUA/AlgoPlus/actions?query=workflow%3A%22Awesome+CI+Workflow%22)
+
 Examples:
 ```cpp
 doubly_linked_list<int> l1, l2;
@@ -44,6 +45,7 @@ doubly_linked_list<int> l1, l2;
 
 ### Classes
   * Graph
+  * Multigraph
   * AVL Tree
   * Binary Search Tree
   * B-Tree

src/classes/heap/min_heap.h

@@ -3,7 +3,8 @@
 #include <iostream>
 #include <vector>
 #endif
-
+
+
 template <typename T> class min_heap {
 private:
   T *arr;

tutorial/graph.md

@@ -26,7 +26,7 @@ There are also some functions for both classes like **has_edge(u, v)** that chec
 ### **DFS**:
 ```cpp
 #include <algoplus/graph>
-graph<int> g("directed);
+graph<int> g("directed");
 g.add_edge(1, 2);
 g.add_edge(4, 5);
 g.add_edge(5 , 6);
@@ -39,7 +39,7 @@ std::vector<T> dfs = g.dfs();
 ### **BFS**:
 ```cpp
 #include <algoplus/graph>
-graph<int> g("directed);
+graph<int> g("directed");
 g.add_edge(1, 2);
 g.add_edge(4, 5);
 g.add_edge(5 , 6);
@@ -53,7 +53,7 @@ std::vector<T> bfs = g.bfs();
 ### **connected_components**:
 ```cpp
 #include <algoplus/graph>
-graph<char> g("undirected);
+graph<char> g("undirected");
 g.add_edge('a', 'b');
 g.add_edge('b','c');
 g.add_edge('g','h');