Template Function ADS::deltaTsp

Function Documentation

template<class T>
Nodes ADS::deltaTsp(const std::vector<std::vector<T>> &D)

the circuit of the nodes of a minimum spanning tree of the complete graph of the symmetric distances D in preorder from 0, the children by increasing name: at most twice the optimum if D is triangular

Pre:

D is square and symmetric, and triangular (an audit, O( n^3 ))

Post:

a permutation of the cities