CAPD RedHom Library
|
#include <capd/graph/StronglyConnectedComponentsGraph.h>
Public Types | |
typedef GraphOnEdges< typename Graph::Id > | Base |
typedef Base::Id | Id |
typedef Graph::Id | VId |
typedef Base::EdgesStorage | EdgesStorage |
typedef std::vector< Id > | ComponentMap |
typedef graph::BoostGraphEdgeAdaptor< Vertex > | Edge |
typedef boost::sub_range< typename Groups::ConstGroupRange > | OutEdges |
typedef boost::iterator_range< boost::counting_iterator< Id > > | Vertices |
typedef boost::filtered_range< IsNotGuard, const EdgesStorage > | Edges |
Public Member Functions | |
StronglyConnectedComponentsGraph (size_t size, EdgesStorage &&edges, ComponentMap &&componentMap) | |
Id | componentOf (VId v) const |
Vertex | vertex (Id id) const |
Vertices | vertices () const |
OutEdges | outEdges (const Vertex &v) const |
Edges | edges () const |
size_t | size () const |
size_t | numberOfEdges () const |
Public Attributes | |
decltype(homAux::MakeGroupedRangeByKey(std::declval< EdgesStorage >())) typedef | Groups |
Static Public Attributes | |
static const Id | NOT_VALID = std::numeric_limits<Id>::max() |
Protected Attributes | |
size_t | _size |
Groups | _groupedEdges |
typedef GraphOnEdges<typename Graph::Id> capd::graph::StronglyConnectedComponentsGraph< Graph >::Base |
typedef std::vector<Id> capd::graph::StronglyConnectedComponentsGraph< Graph >::ComponentMap |
|
inherited |
|
inherited |
typedef Base::EdgesStorage capd::graph::StronglyConnectedComponentsGraph< Graph >::EdgesStorage |
typedef Base::Id capd::graph::StronglyConnectedComponentsGraph< Graph >::Id |
|
inherited |
|
inherited |
typedef Graph::Id capd::graph::StronglyConnectedComponentsGraph< Graph >::VId |
|
inlineexplicit |
|
inline |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
protectedinherited |
|
protectedinherited |
|
inherited |
|
static |