Graph Data Structures

Classes
class	spot::adjlist< State_Data >
	A compact adjacency list representation for directed graphs. More...
class	spot::digraph< State_Data, Edge_Data >
	A directed graph. More...

Functions
bool	spot::named_graph< Graph, State_Name, Name_Hash, Name_Equal >::alias_state (state s, name newname)
	Give an alternate name to a state.

Detailed Description

Generic graph representations and algorithms used throughout Spot.

Function Documentation

alias_state()

template<typename Graph, typename State_Name, typename Name_Hash = std::hash<State_Name>, typename Name_Equal = std::equal_to<State_Name>>

bool spot::named_graph< Graph, State_Name, Name_Hash, Name_Equal >::alias_state ( state s, name newname )

inline

#include <spot/graph/ngraph.hh>

Give an alternate name to a state.

Returns

true iff the newname state was already existing (in this case the existing newname state will be merged with state s: the newname will be unreachable and without successors.)