# Uses tsp to find the best hamiltonian on the complete graph on 1..n

### Description

Returns shortest cycle or path via tsp solver from package TSP

### Usage

1 |

### Arguments

`d` |
A |

`method` |
Options are |

`improve` |
if |

`cycle` |
If |

`path_dir` |
If a function is provided, used to re-orient the cycle/path. Default function is |

`...` |
passed to |

### Details

Requires package TSP.
When `path_dir`

is non NULL, the returned hamiltonian is also optimally oriented using `best_orientation`

, which compares orientations via `path_dir`

.

### Value

A vector containing a permutation of 1..n

### Author(s)

C.B. Hurley and R.W. Oldford

### References

See package TSP.

### See Also

`order_best`

, `solve_TSP`

in TSP.

### Examples

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |