template<class VLabel, class ELabel>
struct faudes::TGraph< VLabel, ELabel >
Graph data structure for transitionrelation – EXPERIMENTAL.
A graph is modelled as a map from vertex-labels to nodes.
We have encountered situations where the set based approach implies a performace penalty for large generators. This light-weight graph class is provided to investigate the situation and to compare perfromance. Forward declaration to mimique recursive typedef by templates
For our use, the vertex-labels are state indicees and each node represents the transitions from the respective state.
Effectively, we implement the following structure graph: map< state-index , node > node: set< node-entry > node-entry: pair < event-index , graph-iterator > >
For convenience methods addressing the intended ussage, see also the below specialisation.
Definition at line 262 of file cfl_project.cpp.