[[["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 `SweepArranger` class arranges indices based on distance and angle from a central depot point."],["This class is utilized within the Sweep first solution heuristic for routing optimization."],["Indices are arranged into sectors, configurable using the `SetSectors` method."],["`ArrangeIndices` reorders a provided list of indices according to the calculated arrangement."]]],["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"]]
