#include <filtered_graph.hpp>
|
typedef Graph | graph_type |
|
typedef
detail::out_edge_predicate
< EdgePredicate,
VertexPredicate, self > | OutEdgePred |
|
typedef
detail::in_edge_predicate
< EdgePredicate,
VertexPredicate, self > | InEdgePred |
|
typedef detail::edge_predicate
< EdgePredicate,
VertexPredicate, self > | EdgePred |
|
typedef Traits::vertex_descriptor | vertex_descriptor |
|
typedef Traits::edge_descriptor | edge_descriptor |
|
typedef Traits::directed_category | directed_category |
|
typedef
Traits::edge_parallel_category | edge_parallel_category |
|
typedef Traits::traversal_category | traversal_category |
|
typedef filter_iterator
< OutEdgePred, typename
Traits::out_edge_iterator > | out_edge_iterator |
|
typedef Traits::degree_size_type | degree_size_type |
|
typedef
adjacency_iterator_generator
< self, vertex_descriptor,
out_edge_iterator >::type | adjacency_iterator |
|
typedef filter_iterator
< InEdgePred, typename
Traits::in_edge_iterator > | in_edge_iterator |
|
typedef filter_iterator
< VertexPredicate, typename
Traits::vertex_iterator > | vertex_iterator |
|
typedef Traits::vertices_size_type | vertices_size_type |
|
typedef filter_iterator
< EdgePred, typename
Traits::edge_iterator > | edge_iterator |
|
typedef Traits::edges_size_type | edges_size_type |
|
typedef filtered_graph_tag | graph_tag |
|
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Descriptor >
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
template<typename Descriptor >
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
Referenced by boost::edge(), boost::edge_range(), boost::edges(), boost::in_edges(), boost::num_edges(), boost::num_vertices(), boost::filtered_graph< DistributedGraph, is_local_edge< DistributedGraph >, is_local_vertex< DistributedGraph > >::operator[](), boost::out_edges(), boost::process_group(), boost::put(), boost::vertex(), and boost::vertices().
template<typename Graph, typename EdgePredicate, typename VertexPredicate = keep_all>
The documentation for this class was generated from the following file: