[[["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 `PruningHamiltonianSolver` class is used for solving the Hamiltonian path problem in C++, aiming to find the shortest path that visits all nodes exactly once."],["It offers methods such as `HamiltonianCost` to retrieve the cost of the path and constructors to initialize the solver with the problem's cost function and number of nodes."],["Users can leverage this class by providing a cost function that defines the cost between any two nodes and utilizing its methods to determine the optimal Hamiltonian path and its associated cost."]]],[]]
