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

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

#include <adjacency_list.hpp>

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

Public Member Functions
	remove_undirected_edge_predicate (Graph &g, Predicate &predicate)
bool	operator() (const argument_type &e)

Detailed Description

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

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

If so, removes the local edges associated with the edge and (potentially) sends a message to the remote processor that also is removing this edge.

Member Typedef Documentation

template<typename Graph , typename Predicate >

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

template<typename Graph , typename Predicate >

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

Constructor & Destructor Documentation

template<typename Graph , typename Predicate >

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

inline

Member Function Documentation

template<typename Graph , typename Predicate >

bool boost::parallel::detail::remove_undirected_edge_predicate< Graph, Predicate >::operator() ( const argument_type &  e )

inline

References boost::detail::parallel::owner(), boost::remove_edge(), boost::detail::parallel::remove_in_edge(), boost::source(), and boost::target().

---

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

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