filtered_graph.hpp File Reference

#include <boost/graph/graph_traits.hpp>
#include <boost/graph/properties.hpp>
#include <boost/graph/adjacency_iterator.hpp>
#include <boost/graph/detail/set_adaptor.hpp>
#include <boost/iterator/filter_iterator.hpp>

Include dependency graph for filtered_graph.hpp:

This graph shows which files directly or indirectly include this file:

Classes
struct	boost::keep_all
struct	boost::is_residual_edge< ResidualCapacityEdgeMap >
struct	boost::is_in_subset< Set >
struct	boost::is_not_in_subset< Set >
struct	boost::detail::out_edge_predicate< EdgePredicate, VertexPredicate, Graph >
struct	boost::detail::in_edge_predicate< EdgePredicate, VertexPredicate, Graph >
struct	boost::detail::edge_predicate< EdgePredicate, VertexPredicate, Graph >
struct	boost::filtered_graph_tag
struct	boost::filtered_graph_base< G >
class	boost::filtered_graph< Graph, EdgePredicate, VertexPredicate >
struct	boost::vertex_property_type< filtered_graph< Graph, EdgePredicate, VertexPredicate > >
struct	boost::edge_property_type< filtered_graph< Graph, EdgePredicate, VertexPredicate > >
struct	boost::graph_property_type< filtered_graph< Graph, EdgePredicate, VertexPredicate > >
struct	boost::vertex_bundle_type< filtered_graph< Graph, EdgePredicate, VertexPredicate > >
struct	boost::edge_bundle_type< filtered_graph< Graph, EdgePredicate, VertexPredicate > >
struct	boost::graph_bundle_type< filtered_graph< Graph, EdgePredicate, VertexPredicate > >
struct	boost::property_map< filtered_graph< G, EP, VP >, Property >
struct	boost::vertex_subset_filter< Graph, Set >
struct	boost::vertex_subset_compliment_filter< Graph, Set >
struct	boost::vertex_subset_complement_filter< Graph, Set >
struct	boost::property_map_filter< PropertyMap >

Namespaces
	boost
	Duration formatting facet for input.
	boost::detail

Functions
template<typename Graph , typename EdgePredicate >
filtered_graph< Graph, EdgePredicate >	boost::make_filtered_graph (Graph &g, EdgePredicate ep)
template<typename Graph , typename EdgePredicate , typename VertexPredicate >
filtered_graph< Graph, EdgePredicate, VertexPredicate >	boost::make_filtered_graph (Graph &g, EdgePredicate ep, VertexPredicate vp)
template<typename Graph , typename EdgePredicate >
filtered_graph< const Graph, EdgePredicate >	boost::make_filtered_graph (const Graph &g, EdgePredicate ep)
template<typename Graph , typename EdgePredicate , typename VertexPredicate >
filtered_graph< const Graph, EdgePredicate, VertexPredicate >	boost::make_filtered_graph (const Graph &g, EdgePredicate ep, VertexPredicate vp)
template<typename G , typename EP , typename VP >
std::pair< typename filtered_graph< G, EP, VP > ::vertex_iterator, typename filtered_graph< G, EP, VP > ::vertex_iterator >	boost::vertices (const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
std::pair< typename filtered_graph< G, EP, VP > ::edge_iterator, typename filtered_graph< G, EP, VP > ::edge_iterator >	boost::edges (const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
filtered_graph< G, EP, VP > ::vertices_size_type	boost::num_vertices (const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
filtered_graph< G, EP, VP > ::edges_size_type	boost::num_edges (const filtered_graph< G, EP, VP > &g)
template<typename G >
filtered_graph_base< G > ::vertex_descriptor	boost::source (typename filtered_graph_base< G >::edge_descriptor e, const filtered_graph_base< G > &g)
template<typename G >
filtered_graph_base< G > ::vertex_descriptor	boost::target (typename filtered_graph_base< G >::edge_descriptor e, const filtered_graph_base< G > &g)
template<typename G , typename EP , typename VP >
std::pair< typename filtered_graph< G, EP, VP > ::out_edge_iterator, typename filtered_graph< G, EP, VP > ::out_edge_iterator >	boost::out_edges (typename filtered_graph< G, EP, VP >::vertex_descriptor u, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
filtered_graph< G, EP, VP > ::degree_size_type	boost::out_degree (typename filtered_graph< G, EP, VP >::vertex_descriptor u, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
std::pair< typename filtered_graph< G, EP, VP > ::adjacency_iterator, typename filtered_graph< G, EP, VP > ::adjacency_iterator >	boost::adjacent_vertices (typename filtered_graph< G, EP, VP >::vertex_descriptor u, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
std::pair< typename filtered_graph< G, EP, VP > ::in_edge_iterator, typename filtered_graph< G, EP, VP > ::in_edge_iterator >	boost::in_edges (typename filtered_graph< G, EP, VP >::vertex_descriptor u, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
filtered_graph< G, EP, VP > ::degree_size_type	boost::in_degree (typename filtered_graph< G, EP, VP >::vertex_descriptor u, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
std::pair< typename filtered_graph< G, EP, VP > ::edge_descriptor, bool >	boost::edge (typename filtered_graph< G, EP, VP >::vertex_descriptor u, typename filtered_graph< G, EP, VP >::vertex_descriptor v, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP >
std::pair< typename filtered_graph< G, EP, VP > ::out_edge_iterator, typename filtered_graph< G, EP, VP > ::out_edge_iterator >	boost::edge_range (typename filtered_graph< G, EP, VP >::vertex_descriptor u, typename filtered_graph< G, EP, VP >::vertex_descriptor v, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP , typename Property >
property_map< G, Property >::type	boost::get (Property p, filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP , typename Property >
property_map< G, Property > ::const_type	boost::get (Property p, const filtered_graph< G, EP, VP > &g)
template<typename G , typename EP , typename VP , typename Property , typename Key >
property_map_value< G, Property >::type	boost::get (Property p, const filtered_graph< G, EP, VP > &g, const Key &k)
template<typename G , typename EP , typename VP , typename Property , typename Key , typename Value >
void	boost::put (Property p, const filtered_graph< G, EP, VP > &g, const Key &k, const Value &val)
template<typename Graph , typename Set >
vertex_subset_filter< Graph, Set >::type	boost::make_vertex_subset_filter (Graph &g, const Set &s)
template<typename Graph , typename Set >
vertex_subset_compliment_filter < Graph, Set >::type	boost::make_vertex_subset_compliment_filter (Graph &g, const Set &s)
template<typename Graph , typename Set >
vertex_subset_complement_filter < Graph, Set >::type	boost::make_vertex_subset_complement_filter (Graph &g, const Set &s)