[[["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 `HamiltonianPathSolver` class calculates the shortest Hamiltonian path and Traveling Salesman Problem (TSP) solutions. It can change the cost matrix via `ChangeCostMatrix`. The solver returns the end node with the shortest Hamiltonian path from 0 using `BestHamiltonianPathEndNode`. `HamiltonianCost` gets the cost from 0 to an end node and `HamiltonianPath` provides the actual shortest path. It also determines `TravelingSalesmanCost` and `TravelingSalesmanPath` for the TSP tour. Finally, `IsRobust` and `VerifiesTriangleInequality` provide information about the cost matrix.\n"]]