|
| | adjlist (unsigned max_states=10, unsigned max_trans=0) |
| | Constructor for adjacency list.
|
| |
| template<typename... Args> |
| unsigned | new_state (Args &&... args) |
| | Create a new state with given data.
|
| |
| template<typename... Args> |
| unsigned | new_states (unsigned n, Args &&... args) |
| | Create multiple new states with the same data.
|
| |
|
internal::boxed_label< State_Data >::data_t & | state_data (unsigned s) |
| |
|
const internal::boxed_label< State_Data >::data_t & | state_data (unsigned s) const |
| |
| void | new_edge (unsigned src, unsigned dst) |
| | Add a new edge between two states.
|
| |
|
successor_range | out (unsigned state) const |
| |
|
unsigned | num_states () const |
| |
|
unsigned | num_edges () const |
| |
template<class State_Data>
class spot::adjlist< State_Data >
A compact adjacency list representation for directed graphs.
This class works almost like a digraph, but it does not support removal of edges, does not support data on edges, prepend edges instead of appending them, and only stores the destinations of edges, not their source. So this is a more compact memory representation.