Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class MakePairActiveOperator
Note: This documentation is automatically generated.
Operator which inserts pairs of inactive nodes into a path.
Possible neighbors for the path 1 -> 2 -> 3 with pair (A, B) inactive
(where 1 and 3 are first and last nodes of the path) are:
1 -> [A] -> [B] -> 2 -> 3
1 -> [B] -> 2 -> [A] -> 3
1 -> [A] -> 2 -> [B] -> 3
1 -> 2 -> [A] -> [B] -> 3
Note that this operator does not expicitely insert the nodes of a pair one
after the other which forbids the following solutions:
1 -> [B] -> [A] -> 2 -> 3
1 -> 2 -> [B] -> [A] -> 3
which can only be obtained by inserting A after B.
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 `MakePairActiveOperator` class inserts pairs of inactive nodes into a path. It explores possible neighbors by inserting the inactive pair (A, B) at different locations within the path, such as `1 -\u003e [A] -\u003e [B] -\u003e 2 -\u003e 3`. It does not insert the pair's nodes consecutively (e.g., `1 -\u003e [B] -\u003e [A] -\u003e 2 -\u003e 3`). Key methods include `MakeNeighbor` (to generate neighbors), `DebugString` (for string representation), and `MakePairActiveOperator` (the constructor), in addition to the destructor `~MakePairActiveOperator`.\n"],null,[]]
