indigoX
access.hpp
Go to the documentation of this file.
1 #ifndef INDIGOX_ALGORITHM_ACCESS_HPP
2 #define INDIGOX_ALGORITHM_ACCESS_HPP
3 
4 #include "../graph/base_graph.hpp"
5 #include "../utils/fwd_declares.hpp"
6 
7 namespace indigox::algorithm {
8  struct access {
9  template <class V, class E, class S, class D, class VP, class EP>
12  return G.m_basedata->boost_graph;
13  }
14 
15  template <class V, class E, class S, class D, class VP, class EP>
18  return G.m_basedata->vertex_descriptors;
19  }
20 
21  template <class V, class E, class S, class D, class VP, class EP>
24  return G.m_basedata->edge_descriptors;
25  }
26  };
27 } // namespace indigox::algorithm
28 
29 #endif
Definition: simple_bimap.hpp:7
Definition: access.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
Definition: access.hpp:8
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