faudes::TGraph< VLabel, ELabel > Struct Template Reference

Detailed Description

template<class VLabel, class ELabel>
struct faudes::TGraph< VLabel, ELabel >

Graph data structure for transition relation – EXPERIMENTAL

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

A graph is modelled as a map from vertex-labels to nodes. 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.

Public Types
typedef graph_iterator_t< VLabel, ELabel >	Iterator

Static Public Member Functions
static Iterator	InfX1 (void)

Member Typedef Documentation

Iterator

template<class VLabel , class ELabel >

typedef graph_iterator_t< VLabel , ELabel> faudes::TGraph< VLabel, ELabel >::Iterator

Definition at line 264 of file cfl_project.cpp.

Member Function Documentation

InfX1()

template<class VLabel , class ELabel >

static Iterator faudes::TGraph< VLabel, ELabel >::InfX1 ( void )

inlinestatic

Definition at line 266 of file cfl_project.cpp.

---

The documentation for this struct was generated from the following file:

• cfl_project.cpp