There was an error while loading. Please reload this page.
1 parent 795be1d commit 1c243fcCopy full SHA for 1c243fc
1 file changed
graphs/travelling_salesman_problem.py
@@ -88,7 +88,7 @@ def travelling_salesman_brute_force(
88
89
nodes = list(graph_points.keys()) # Extracting the node names (keys)
90
91
- # There shoukd be atleast 2 nodes for a valid TSP
+ # There should be at least 2 nodes for a valid TSP
92
if len(nodes) < 2:
93
raise InvalidGraphError("Graph must have at least two nodes")
94
@@ -134,7 +134,7 @@ def travelling_salesman_dynamic_programming(
134
135
n = len(graph_points) # Extracting the node names (keys)
136
137
138
if n < 2:
139
140
0 commit comments