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

Update README.md
---

diff --git a/README.md b/README.md
index 0c71d09..4c2bd98 100644
--- a/README.md
+++ b/README.md
@@ -108,6 +108,7 @@ Take this graph for instance, generated by the Christofides Algorithm.
 
 ![](Christofides_bad.png)
 
+
 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.
 --------------------------------------------------------------------------------------------------------------