equal
deleted
inserted
replaced
43 /// |
43 /// |
44 /// If no starting tour is given to the \ref run() function, then the |
44 /// If no starting tour is given to the \ref run() function, then the |
45 /// algorithm uses the node sequence determined by the node IDs. |
45 /// algorithm uses the node sequence determined by the node IDs. |
46 /// Oherwise, it starts with the given tour. |
46 /// Oherwise, it starts with the given tour. |
47 /// |
47 /// |
48 /// This is a relatively slow but powerful method. |
48 /// This is a rather slow but effective method. |
49 /// A typical usage of it is the improvement of a solution that is resulted |
49 /// Its typical usage is the improvement of the result of a fast tour |
50 /// by a fast tour construction heuristic (e.g. the InsertionTsp algorithm). |
50 /// construction heuristic (e.g. the InsertionTsp algorithm). |
51 /// |
51 /// |
52 /// \tparam CM Type of the cost map. |
52 /// \tparam CM Type of the cost map. |
53 template <typename CM> |
53 template <typename CM> |
54 class Opt2Tsp |
54 class Opt2Tsp |
55 { |
55 { |