From: Skullheadx <94652084+Skullheadx@users.noreply.github.com>
Date: Mon, 9 Jan 2023 15:44:49 +0000 (-0500)
Subject: Update README.md
X-Git-Url: http://git.skullheadx.com/nixos/static/gitweb.css?a=commitdiff_plain;h=d4838861e5a4287bd8fe99a056d66272194c8610;p=The-Traveling-Salesman-Problem.git

Update README.md
---

diff --git a/README.md b/README.md
index 4c2bd98..f7f6d37 100644
--- a/README.md
+++ b/README.md
@@ -111,6 +111,8 @@ Take this graph for instance, generated by the Christofides Algorithm.
 
 If you notice the edge between (273, 269) and (334,510) and the edge between (263, 392) and (510, 143). They cross each other and it would probably be a better solution if they connected differently.
 This method of improving a candidate solution created by a heuristic is called local search.
+
+
 --------------------------------------------------------------------------------------------------------------
 
 **Random Swapping**