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

A graph is modelled as a map from vertex-labels to nodes. More...

Public Types

typedef graph_iterator_t
< VLabel, ELabel > 
Iterator

Static Public Member Functions

static Iterator InfX1 (void)

Detailed Description

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

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-entrz > node-entry: pair < event-index , graph-iterator > >

For convenience methods addressing the intended ussage, see also the below specialisation.

Definition at line 267 of file cfl_project.cpp.

Member Typedef Documentation

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

Definition at line 269 of file cfl_project.cpp.

Member Function Documentation

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

Definition at line 271 of file cfl_project.cpp.


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

libFAUDES 2.28a --- 2016.09.13 --- c++ api documentaion by doxygen