Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class RelocateExpensiveChain
Note: This documentation is automatically generated.
RelocateExpensiveChain
Operator which relocates the most expensive subchains (given a cost
callback) in a path to a different position.
The most expensive chain on a path is the one resulting from cutting the 2
most expensive arcs on this path.
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 `RelocateExpensiveChain` class operator relocates the most expensive subchains within a path. It identifies the most expensive chain by cutting the two costliest arcs on the path. Key methods include `MakeNeighbor` and `MakeOneNeighbor`, which likely facilitate the relocation process. The `RelocateExpensiveChain` method takes arguments including the path variables, secondary variables, a function defining an empty path class, the number of arcs to consider, and a function defining arc costs for the path start. It also provides a `DebugString` method for debugging.\n"],null,[]]
