From: Skullheadx <94652084+Skullheadx@users.noreply.github.com>
Date: Tue, 27 Dec 2022 04:19:24 +0000 (-0500)
Subject: Create README.md
X-Git-Url: http://git.skullheadx.com/projects/suckless.html?a=commitdiff_plain;h=0ee9c644ae4ebacd996e6dd25c9da788645feff8;p=The-Traveling-Salesman-Problem.git

Create README.md
---

diff --git a/README.md b/README.md
new file mode 100644
index 0000000..357d917
--- /dev/null
+++ b/README.md
@@ -0,0 +1,15 @@
+# The-Traveling-Salesman-Problem
+
+My solutions to the Traveling Salesman Problem (TSP) inspired by video presented by Reducible on Youtube. 
+(https://youtu.be/GiDsjIBOVoA)
+
+--------------------------------------------------------------------------------------------------------------
+TSP Problem Definition
+If a salesman starts at a town and wants to travel to every other town only once, what is the shortest path he should take?
+
+Assuming that:
+1. Each town is connected by a direct edge
+2. The distance between town A and town B is the same as the distance between town B and town A
+3. The direct path to a town is always the shortest, i.e. going directly from town A to town C is faster than going from town A to town B and then town C
+
+--------------------------------------------------------------------------------------------------------------