We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 6fe07ca commit 91f6885Copy full SHA for 91f6885
README.md
@@ -11,8 +11,5 @@ Which gives us an approximate solution to the Travelling Salesman Problem.
11
Demo
12
https://gilbertls.github.io/2-approximation-TSP/
13
14
-Created as a project for COMP 3804
15
-http://people.scs.carleton.ca/~agheibi/courses/comp3804.html
16
-
17
Coded by Gilbert Lavergne-Shank
18
-http://gilbertls.com
+http://gilbertls.com
0 commit comments