CAPD RedHom Library
|
#include <capd/graph/GraphOnEdges.h>
Classes | |
struct | IsNotGuard |
struct | Vertex |
Public Types | |
typedef IdT | Id |
typedef graph::BoostGraphEdgeAdaptor< Vertex > | Edge |
typedef std::vector< Edge > | EdgesStorage |
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 | |
GraphOnEdges (GraphOnEdges &&)=default | |
GraphOnEdges (const GraphOnEdges &rhs) | |
GraphOnEdges (size_t size, EdgesStorage &&edges) | |
GraphOnEdges & | operator= (const GraphOnEdges &)=delete |
GraphOnEdges & | operator= (GraphOnEdges &&)=default |
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 |
Protected Attributes | |
size_t | _size |
Groups | _groupedEdges |
CAPD_CLASS_LOGGER | |
typedef graph::BoostGraphEdgeAdaptor<Vertex> capd::graph::GraphOnEdges< IdT >::Edge |
typedef boost::filtered_range<IsNotGuard, const EdgesStorage> capd::graph::GraphOnEdges< IdT >::Edges |
typedef std::vector<Edge> capd::graph::GraphOnEdges< IdT >::EdgesStorage |
typedef IdT capd::graph::GraphOnEdges< IdT >::Id |
typedef boost::sub_range<typename Groups::ConstGroupRange> capd::graph::GraphOnEdges< IdT >::OutEdges |
typedef boost::iterator_range<boost::counting_iterator<Id> > capd::graph::GraphOnEdges< IdT >::Vertices |
|
default |
|
inline |
|
inlineexplicit |
|
inline |
|
inline |
|
delete |
|
default |
|
inline |
|
inline |
|
inline |
|
inline |
|
protected |
|
protected |
|
protected |
decltype(homAux::MakeGroupedRangeByKey(std::declval<EdgesStorage>())) typedef capd::graph::GraphOnEdges< IdT >::Groups |