C++ Reference: christofides

This documentation is automatically generated.

ChristofidesPathSolver computes an approximate solution to the Traveling Salesman Problen using the Christofides algorithm (c.f. https://en.wikipedia.org/wiki/Christofides_algorithm). Note that the algorithm guarantees finding a solution within 3/2 of the optimum. Its complexity is O(n^2 * log(n)) where n is the number of nodes.

Classes

ChristofidesPathSolver

Send feedback about...