Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class SweepArranger
Note: This documentation is automatically generated.
Class to arrange indices by their distance and their angle from the depot.
Used in the Sweep first solution heuristic.
| Method |
ArrangeIndices | Return type: void Arguments: std::vector<int64_t>* indices |
SetSectors | Return type: void Arguments: int sectors |
SweepArranger | Return type: explicit Arguments:
const std::vector<std::pair<int64_t, int64_t>>& points |
~SweepArranger | Return type: virtual |
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[],["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,[]]
