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
+```