Update README.md

README.md

@@ -29,6 +29,7 @@ It is one of the most renowned and intricate challenges in computer science, and
 A tour in this context refers to a trajectory that visits all cities exactly once. The primary objective is to identify a path that minimizes the total length of the tour.
 
 In the context of the TSP, a cyclic permutation $\pi$ serves as a representation of a tour. 
+
 If $\pi(j)$ is interpreted as the city following city j for j = 1, 2, ··· , n, the cost of the tour can be defined as follows: $\sum_{j=1}^{n}d_{j\pi (j)}$.
 
 __Matrix of cost__