[[["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\u003eVolgenantJonkerEvaluator\u003c/code\u003e class in C++ is used for evaluating lower bounds in optimization problems.\u003c/p\u003e\n"],["\u003cp\u003eIt utilizes methods such as \u003ccode\u003eGetStep\u003c/code\u003e, \u003ccode\u003eNext\u003c/code\u003e, \u003ccode\u003eOnNewWMax\u003c/code\u003e, and \u003ccode\u003eOnOneTree\u003c/code\u003e to iterate and refine the lower bound estimation.\u003c/p\u003e\n"],["\u003cp\u003e\u003ccode\u003eVolgenantJonkerEvaluator\u003c/code\u003e can be initialized with the number of nodes and maximum iterations for the evaluation process.\u003c/p\u003e\n"],["\u003cp\u003eThe class provides functionalities to handle events related to one-tree structures and updates to the maximum weight.\u003c/p\u003e\n"]]],["The `VolgenantJonkerEvaluator` class in C++ provides methods for evaluating solutions. Key actions include `GetStep` (returning a `double`), `Next` (returning a `bool`), `OnNewWMax` (taking a `CostType` argument), and `OnOneTree` (taking `CostType`, `double`, and a `std::vector\u003cint\u003e` as arguments). The constructor `VolgenantJonkerEvaluator` takes the `number_of_nodes` and `max_iterations` as input. These methods seem to involve calculating and managing costs or steps in an iterative process.\n"],null,["# VolgenantJonkerEvaluator\n\nC++ Reference: class VolgenantJonkerEvaluator\n=============================================\n\n\nNote: This documentation is automatically generated.\n\n| Method ||\n|----------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------------|\n| [`GetStep`](https://github.com/google/or-tools/blob/v9.4/ortools/graph/one_tree_lower_bound.h#L169) | Return type: `double ` \u003cbr /\u003e |\n| [`Next`](https://github.com/google/or-tools/blob/v9.4/ortools/graph/one_tree_lower_bound.h#L167) | Return type: `bool ` \u003cbr /\u003e |\n| [`OnNewWMax`](https://github.com/google/or-tools/blob/v9.4/ortools/graph/one_tree_lower_bound.h#L187) | Return type: `void ` Arguments: `CostType one_tree_cost` \u003cbr /\u003e |\n| [`OnOneTree`](https://github.com/google/or-tools/blob/v9.4/ortools/graph/one_tree_lower_bound.h#L179) | Return type: `void ` Arguments: `CostType one_tree_cost, double w, const std::vector\u003cint\u003e& degrees` \u003cbr /\u003e |\n| [`VolgenantJonkerEvaluator`](https://github.com/google/or-tools/blob/v9.4/ortools/graph/one_tree_lower_bound.h#L159) | \u003cbr /\u003e Arguments: `int number_of_nodes, int max_iterations` \u003cbr /\u003e |"]]
