Go to the source code of this file.
|
namespace | operations_research |
| The vehicle routing library lets one model and solve generic vehicle routing problems ranging from the Traveling Salesman Problem to more complex problems such as the Capacitated Vehicle Routing Problem with Time Windows.
|
|
|
template<class Iterator > |
using | value_type_t = typename std::iterator_traits< Iterator >::value_type |
|
|
template<class Iterator , class Compare = std::less<value_type_t<Iterator>>> |
void | IncrementalSort (int max_comparisons, Iterator begin, Iterator end, Compare comp=Compare{}, bool is_stable=false) |
|
template<class Iterator , class Compare = std::less<value_type_t<Iterator>>> |
void | InsertionSort (Iterator begin, Iterator end, Compare comp=Compare{}) |
|
template<class Iterator , class Compare = std::less<value_type_t<Iterator>>> |
void | IncrementalSort (Iterator begin, Iterator end, Compare comp=Compare{}, bool is_stable=false) |
|