chore: update solver documentation

fillipe-gsm · Sep 4, 2023 · b98c611 · b98c611
1 parent 777dc19
commit b98c611
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/docs/solvers.rst b/docs/solvers.rst
@@ -207,7 +207,7 @@ A basic Lin and Kernighan implementation is provided. It can be said that the qu
         distance from node i to j
 
     x0
-        Initial permutation. If not provided, it starts with a random pat.
+        Initial permutation. If not provided, it starts with a random path.
 
     log_file
         If not `None`, creates a log file with details about the whole

diff --git a/python_tsp/heuristics/lin_kernighan.py b/python_tsp/heuristics/lin_kernighan.py
@@ -154,7 +154,7 @@ def solve_tsp_lin_kernighan(
         distance from node i to j
 
     x0
-        Initial permutation. If not provided, it starts with a random pat.
+        Initial permutation. If not provided, it starts with a random path.
 
     log_file
         If not `None`, creates a log file with details about the whole