From 76657bcb9e14e4abf7ff125849d0e695b9e0c2e8 Mon Sep 17 00:00:00 2001
From: Spiros Maggioros <51701672+spirosmaggioros@users.noreply.github.com>
Date: Mon, 22 Jan 2024 15:51:16 +0200
Subject: [PATCH] Update graph.md

---
 tutorial/graph.md | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/tutorial/graph.md b/tutorial/graph.md
index 7ff52592..61dde9a2 100644
--- a/tutorial/graph.md
+++ b/tutorial/graph.md
@@ -21,6 +21,7 @@ weighted_graph class algorithms:
     - prim
     - bipartite
     - visualize
+
 There are also some functions for both classes like **has_edge(u, v)** that checks if an edge exists from node u to node v, **size()** that returns the number of elements in the graph, **empty()** that checks if a graph is empty and **empty()** that empties the graph.
 ### **DFS**:
 ```cpp
@@ -142,4 +143,4 @@ g.add_edge("Athens", "Kozani", 100);
 // returns the minimum spanning tree starting 
 // from the node Athens.
 std::cout << g.prim("Athens") << '\n';
-```
\ No newline at end of file
+```