boost::parallel::detail::remove_in_edge_predicate< Graph, Predicate > Struct Template Reference

Function object that applies the underlying predicate to determine if an in-edge should be removed. More...

#include <adjacency_list.hpp>

Public Types
typedef graph_traits< Graph > ::edge_descriptor	edge_descriptor
typedef bool	result_type

Public Member Functions
	remove_in_edge_predicate (Graph &g, const Predicate &predicate)
template<typename StoredEdge >
bool	operator() (const StoredEdge &le)

Detailed Description

template<typename Graph, typename Predicate>
struct boost::parallel::detail::remove_in_edge_predicate< Graph, Predicate >

Function object that applies the underlying predicate to determine if an in-edge should be removed.

If so, either removes the outgoing edge (if it is stored locally) or sends a message to the owner of the target requesting that it remove the edge. Only required for bidirectional graphs.

Member Typedef Documentation

template<typename Graph , typename Predicate >

typedef graph_traits<Graph>::edge_descriptor boost::parallel::detail::remove_in_edge_predicate< Graph, Predicate >::edge_descriptor

template<typename Graph , typename Predicate >

typedef bool boost::parallel::detail::remove_in_edge_predicate< Graph, Predicate >::result_type

Constructor & Destructor Documentation

template<typename Graph , typename Predicate >

boost::parallel::detail::remove_in_edge_predicate< Graph, Predicate >::remove_in_edge_predicate ( Graph &  g, const Predicate &  predicate  )

inline

Member Function Documentation

template<typename Graph , typename Predicate >

template<typename StoredEdge >

bool boost::parallel::detail::remove_in_edge_predicate< Graph, Predicate >::operator() ( const StoredEdge &  le )

inline

References boost::remove_edge(), boost::source(), boost::target(), and template.

---

The documentation for this struct was generated from the following file:

• boost_1_57_0/boost/graph/distributed/adjacency_list.hpp