Sets the matching algorithm to use. A minimum weight perfect matching
(MINIMUM_WEIGHT_MATCHING) guarantees the 3/2 upper bound to the optimal
solution. A minimal weight perfect matching (MINIMAL_WEIGHT_MATCHING)
finds a locally minimal weight matching which does not offer any bound
guarantee but, as of 1/2017, is orders of magnitude faster than the
minimum matching.
By default, MINIMAL_WEIGHT_MATCHING is selected.
TODO(user): Change the default when minimum matching gets faster.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["The `ChristofidesPathSolver` class provides an approximate solution to the Traveling Salesman Problem (TSP) using the Christofides algorithm."],["It allows selecting between two matching algorithms: `MINIMUM_WEIGHT_MATCHING` (guarantees a 3/2 approximation bound) and `MINIMAL_WEIGHT_MATCHING` (faster but without bound guarantees)."],["The `Solve()` method executes the algorithm and returns `true` if a solution is found."],["Users can retrieve the cost and path of the approximate TSP tour using `TravelingSalesmanCost()` and `TravelingSalesmanPath()`, respectively."]]],[]]
