[[["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."],[[["\u003cp\u003eThe \u003ccode\u003eCheapestAdditionFilteredHeuristic\u003c/code\u003e class is a decision builder for routing problems that extends paths by selecting the cheapest arc.\u003c/p\u003e\n"],["\u003cp\u003eThis heuristic utilizes filtering for efficiency and is based on the addition heuristic principle.\u003c/p\u003e\n"],["\u003cp\u003eIt includes methods like \u003ccode\u003eBuildSolutionInternal\u003c/code\u003e for solution construction and the constructor/destructor for object management.\u003c/p\u003e\n"]]],["The `CheapestAdditionFilteredHeuristic` class in C++ is a filtered decision builder. It extends a path by adding the cheapest arc from its start node. Key actions include: `BuildSolutionInternal`, which returns a boolean; `CheapestAdditionFilteredHeuristic`, the constructor taking a `RoutingModel` and `LocalSearchFilterManager` as arguments; and the destructor `~CheapestAdditionFilteredHeuristic`. This class uses an addition heuristic to select the next path segment, filtering choices in the process.\n"],null,[]]
