Fixed formatting of showcase

README.md

@@ -12,10 +12,10 @@ The point of this project was familiarize myself with graphs (networks of nodes)
 
 The following is the same maze solved with two different solving algorithms 
 
-Dijkstra's:
+Dijkstra's: <br>
 <img src="Maze Gifs/Generated 101x101 Maze - Dijkstra.gif" alt="Generated 101x101 Maze - Dijkstra"  width=250/>
 
-A*:
+A*: <br>
 <img src="Maze Gifs/Generated 101x101 Maze - A Star.gif" alt="Generated 101x101 Maze - A Star"  width=250/>
 
 It should be noted that due to the fact that mazes usually only have one solution that is very intricate and does not always head directly towards the end goal, the advantage of A*'s direction heuristic tends to be marginalized. However, the advantage becomes more apparent in mazes made with various turns and solutions such as the following.