From c87e2ed4ee581a840934475be82c355285d08a1f Mon Sep 17 00:00:00 2001
From: Tayyab R <32965703+Ifera@users.noreply.github.com>
Date: Tue, 20 Jul 2021 21:03:27 +0500
Subject: [PATCH] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 1516779..89da113 100644
--- a/README.md
+++ b/README.md
@@ -4,7 +4,7 @@ A data structures project utilizing Dijkistra algorithm and AdjacencyList to fin
 
 ## Overview
 
-**PathMapper** - An end semester project for **EC-200 Data Structure** course. <br />
+**PathMapper** - An end semester project for **EC-200 Data Structure** course. <br /><br />
 We were told to make use of what we had learned of Data Structures over the course of the semester and make a program that had the following features:
 
 - Map shortest path between two cities (inter-city).