Hamiltonian circuit through static activities and the fixed locations. More...
#include <DataStructures.h>
Collaboration diagram for ShortestCircuit:
Public Member Functions | |
| ShortestCircuit (const std::vector< StaticActivity * > arg1, const std::vector< Location * > &arg2) | |
| bool | operator== (const ShortestCircuit &sc) const |
Public Attributes | |
| std::vector< StaticActivity * > | circuit |
| Selected alternative, i.e. order of operations. | |
| std::vector< Location * > | fixedLocations |
| Locations required to be fixed to enforce the spatial compatibility between robots. | |
Detailed Description
Hamiltonian circuit through static activities and the fixed locations.
The structure records the selected alternative, i.e. circuit, and the locations that have to be fixed to resolve spatial compatibility.
Definition at line 96 of file DataStructures.h.
The documentation for this struct was generated from the following file:
- /home/bukatlib/Downloads/SolverEquationsGeneratedAsImages/inc/HeuristicSolver/DataStructures.h
