Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class SweepArranger
This documentation is automatically generated.
Class to arrange indices by by their distance and their angles from the
depot. Used in the Sweep first solution heuristic.
| Method |
ArrangeIndices | Return type: void Arguments: std::vector<int64>* indices |
SetSectors | Return type: void Arguments: int sectors |
SweepArranger | Return type: explicit Arguments: const std::vector<std::pair<int64, int64>>& 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 2021-01-05 UTC.
[{
"type": "thumb-down",
"id": "missingTheInformationINeed",
"label":"Missing the information I need"
},{
"type": "thumb-down",
"id": "tooComplicatedTooManySteps",
"label":"Too complicated / too many steps"
},{
"type": "thumb-down",
"id": "outOfDate",
"label":"Out of date"
},{
"type": "thumb-down",
"id": "samplesCodeIssue",
"label":"Samples / code issue"
},{
"type": "thumb-down",
"id": "otherDown",
"label":"Other"
}]
[{
"type": "thumb-up",
"id": "easyToUnderstand",
"label":"Easy to understand"
},{
"type": "thumb-up",
"id": "solvedMyProblem",
"label":"Solved my problem"
},{
"type": "thumb-up",
"id": "otherUp",
"label":"Other"
}]
