[[["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\u003eSweepArranger\u003c/code\u003e class arranges indices based on distance and angle from a central depot point.\u003c/p\u003e\n"],["\u003cp\u003eThis class is utilized within the Sweep first solution heuristic for routing optimization.\u003c/p\u003e\n"],["\u003cp\u003eIndices are arranged into sectors, configurable using the \u003ccode\u003eSetSectors\u003c/code\u003e method.\u003c/p\u003e\n"],["\u003cp\u003e\u003ccode\u003eArrangeIndices\u003c/code\u003e reorders a provided list of indices according to the calculated arrangement.\u003c/p\u003e\n"]]],["The `SweepArranger` class arranges indices based on their distance and angle from a depot, aiding the Sweep heuristic solution. Key actions include: `ArrangeIndices`, which reorders a vector of indices; `SetSectors`, which sets the number of sectors; and `SweepArranger`, the constructor, which takes a vector of point pairs as arguments. The `~SweepArranger` is a virtual destructor. This class is implemented in C++ and automatically documented.\n"],null,["# SweepArranger\n\nC++ Reference: class SweepArranger\n==================================\n\n\nNote: This documentation is automatically generated.\nClass to arrange indices by their distance and their angle from the depot. Used in the Sweep first solution heuristic.\n\n| Method ||\n|-------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------|\n| [`ArrangeIndices`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/routing_search.h#L1126) | Return type: `void ` Arguments: `std::vector\u003cint64_t\u003e* indices` \u003cbr /\u003e |\n| [`SetSectors`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/routing_search.h#L1127) | Return type: `void ` Arguments: `int sectors` \u003cbr /\u003e |\n| [`SweepArranger`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/routing_search.h#L1123) | Return type: `explicit ` Arguments: ` const std::vector\u003cstd::pair\u003cint64_t, int64_t\u003e\u003e& points` \u003cbr /\u003e |\n| [`~SweepArranger`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/routing_search.h#L1125) | Return type: `virtual ` \u003cbr /\u003e |"]]
