Skip to content

Commit

Permalink
updated docs of SA_tsp and TA_tsp (networkx#7013)
Browse files Browse the repository at this point in the history
  • Loading branch information
Schefflera-Arboricola authored Oct 12, 2023
1 parent 399b2b9 commit 9976ed2
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions networkx/algorithms/approximation/traveling_salesman.py
Original file line number Diff line number Diff line change
Expand Up @@ -1033,7 +1033,7 @@ def simulated_annealing_tsp(
Parameters
----------
G : Graph
`G` should be a complete weighted undirected graph.
`G` should be a complete weighted graph.
The distance between all pairs of nodes should be included.
init_cycle : list of all nodes or "greedy"
Expand Down Expand Up @@ -1249,7 +1249,7 @@ def threshold_accepting_tsp(
Parameters
----------
G : Graph
`G` should be a complete weighted undirected graph.
`G` should be a complete weighted graph.
The distance between all pairs of nodes should be included.
init_cycle : list or "greedy"
Expand Down

0 comments on commit 9976ed2

Please sign in to comment.