A graph edge in the distance graph. More...
#include <DataStructures.h>
Collaboration diagram for Edge:
Public Attributes | |
| StaticActivity * | f |
| Edge leaves the activity f. | |
| StaticActivity * | t |
| Edge enters to activity t. | |
| uint32_t | i |
| An index assigned to the activity f, used for an access to the distance matrix. | |
| uint32_t | j |
| An index assigned to the activity t, used for an access to the distance matrix. | |
| double | length |
Detailed Description
Member Data Documentation
| double Edge::length |
The edge length corresponding to the minimal duration of activity f plus the minimal duration of the dynamic activity that connects activity f with activity t.
Definition at line 59 of file DataStructures.h.
The documentation for this struct was generated from the following file:
- /home/bukatlib/Downloads/SolverEquationsGeneratedAsImages/inc/HeuristicSolver/DataStructures.h
