1 #ifndef INDIGOX_ALGORITHM_ACCESS_HPP 2 #define INDIGOX_ALGORITHM_ACCESS_HPP 4 #include "../graph/base_graph.hpp" 5 #include "../utils/fwd_declares.hpp" 9 template <
class V,
class E,
class S,
class D,
class VP,
class EP>
15 template <
class V,
class E,
class S,
class D,
class VP,
class EP>
21 template <
class V,
class E,
class S,
class D,
class VP,
class EP>
Definition: simple_bimap.hpp:7
static graph::BaseGraph< V, E, S, D, VP, EP >::EdgeMap & GetEdgeMap(graph::BaseGraph< V, E, S, D, VP, EP > &G)
Definition: access.hpp:23
static graph::BaseGraph< V, E, S, D, VP, EP >::VertMap & GetVertexMap(graph::BaseGraph< V, E, S, D, VP, EP > &G)
Definition: access.hpp:17
std::shared_ptr< BaseImpl > m_basedata
Definition: base_graph.hpp:104
boost::adjacency_list< boost::setS, boost::listS, typename D::is_directed_t, VP, EP > graph_type
Type of the underlying boost graph.
Definition: base_graph.hpp:69
static graph::BaseGraph< V, E, S, D, VP, EP >::graph_type & GetGraph(graph::BaseGraph< V, E, S, D, VP, EP > &G)
Definition: access.hpp:11
Template base class for all graphs used in the indigoX library.
Definition: base_graph.hpp:56