Closed path through locations or static activities including an order of operations, i.e. alternative. More...
#include <DataStructures.h>
Collaboration diagram for HamiltonianCircuit< T >:
Public Attributes | |
| double | minLength |
| The lower bound on the robot cycle time for this circuit (neglecting global constraints). | |
| std::vector< T * > | circuit |
| Closed path through locations or static activities, each static activity is visited just once. | |
Detailed Description
template<class T>
struct HamiltonianCircuit< T >
Closed path through locations or static activities including an order of operations, i.e. alternative.
- Template Parameters
-
T Either a pointer to Location or StaticActivity.
Definition at line 85 of file DataStructures.h.
The documentation for this struct was generated from the following file:
- /home/bukatlib/Downloads/SolverEquationsGeneratedAsImages/inc/HeuristicSolver/DataStructures.h
