From 08a38fdafe7994fcfd1b7585967f1c31ee3e74ba Mon Sep 17 00:00:00 2001
From: Tim Peng <61765933+typg93@users.noreply.github.com>
Date: Fri, 2 Oct 2020 01:11:10 -0400
Subject: [PATCH] Update A*-Algorithm-GUI.md

---
 Projects/2-Intermediate/A*-Algorithm-GUI.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/Projects/2-Intermediate/A*-Algorithm-GUI.md b/Projects/2-Intermediate/A*-Algorithm-GUI.md
index 72a8b9f9..a6073660 100644
--- a/Projects/2-Intermediate/A*-Algorithm-GUI.md
+++ b/Projects/2-Intermediate/A*-Algorithm-GUI.md
@@ -25,11 +25,13 @@ The purpose of the app is to find the shortest path from the starting point to t
 A* Algorithm:
 
 https://www.geeksforgeeks.org/a-search-algorithm/
+
 https://en.wikipedia.org/wiki/A*_search_algorithm#:~:text=*%2Dlike%20algorithm.-,Description,shortest%20time%2C%20etc.).
 
 If you are new to graph traversals you might want to check out Dijkstra's algorithm and Breadth First Search First:
 
 https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
+
 https://en.wikipedia.org/wiki/Breadth-first_search
 
 ## Example projects