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

Function object that applies the underlying predicate to determine if a directed edge can be removed. More...

#include <adjacency_list.hpp>

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

Public Member Functions
	remove_directed_edge_predicate (Graph &g, const Predicate &predicate)
bool	operator() (const argument_type &le)

Detailed Description

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

Function object that applies the underlying predicate to determine if a directed edge can be removed.

This only applies to directed graphs.

Member Typedef Documentation

template<typename Graph , typename Predicate >

typedef Graph::local_edge_descriptor boost::parallel::detail::remove_directed_edge_predicate< Graph, Predicate >::argument_type

template<typename Graph , typename Predicate >

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

template<typename Graph , typename Predicate >

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

Constructor & Destructor Documentation

template<typename Graph , typename Predicate >

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

inline

Member Function Documentation

template<typename Graph , typename Predicate >

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

inline

References template.

---

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

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