[[["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, primarily for the Sweep first solution heuristic in route optimization.\u003c/p\u003e\n"],["\u003cp\u003eIt provides methods like \u003ccode\u003eArrangeIndices\u003c/code\u003e to order indices and \u003ccode\u003eSetSectors\u003c/code\u003e to define angular sections for arrangement.\u003c/p\u003e\n"],["\u003cp\u003eThis class utilizes a collection of points (likely representing locations) for its calculations, as indicated by its constructor.\u003c/p\u003e\n"]]],["The `SweepArranger` class arranges indices based on their distance and angles from a depot, utilizing a sweep algorithm for initial solution heuristics. Key methods include: `ArrangeIndices`, which modifies a vector of indices; `SetSectors`, which defines the number of sectors for the arrangement; and `SweepArranger`, the constructor taking a vector of points. There is also a virtual destructor. It's designed to sort locations by relative position.\n"],null,[]]
