A graph in which random alternatives will be searched for. More...
#include <DataStructures.h>
Collaboration diagram for Graph:
Public Attributes | |
| std::vector< Edge > | edges |
| Graph edges. | |
| uint32_t | startIdent |
| An index of the start node. | |
| uint32_t | endIdent |
| An index of the end node. | |
| std::vector< StaticActivity * > | idToActivity |
| Node index to static activity, note that dynamic activities are already incorporated in the lengths of edges. | |
| std::vector< std::vector< Edge > > | idToSuccessors |
| Node index to leaving edges that enters to its (node) successors. | |
Detailed Description
A graph in which random alternatives will be searched for.
Definition at line 65 of file DataStructures.h.
The documentation for this struct was generated from the following file:
- /home/bukatlib/Downloads/SolverEquationsGeneratedAsImages/inc/HeuristicSolver/DataStructures.h
