Go to the source code of this file.
|
int farthest_ins_from_to | PROTO ((heur_prob *p, _node *tour, int cost, int from_size, int to_size, int starter, neighbor *nbtree, int *intour, int *last, route_data *route_info, int cur_route)) |
|
int closest | PROTO ((neighbor *nbtree, int *intour, int *last)) |
|
void ni_insert_edges | PROTO ((heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last, _node *tour, int cur_route)) |
|
int insert_into_tour | PROTO ((heur_prob *p, _node *tour, int starter, int size, int new_node, route_data *route_info, int cur_route)) |
|
void starters | PROTO ((heur_prob *p, int *starter, route_data *route_info, int start)) |
|
int nearest_ins_from_to PROTO |
( |
(heur_prob *p, _node *tour, int cost, int from_size, int to_size, int starter, neighbor *nbtree, int *intour, int *last, route_data *route_info, int cur_route) |
| ) |
|
int tsp_farthest PROTO |
( |
(neighbor *nbtree, int *intour, int *last) |
| ) |
|
void fi_insert_edges PROTO |
( |
(heur_prob *p, int new_node, neighbor *nbtree, int *intour, int *last, _node *tour, int cur_route) |
| ) |
|
int insert_into_tour PROTO |
( |
(heur_prob *p, _node *tour, int starter, int size, int new_node, route_data *route_info, int cur_route) |
| ) |
|