Traits structure that allows a communicator with graph topology to be view as a graph by the Boost Graph Library. More...

#include <graph_communicator.hpp>

Classes
struct	traversal_category
	INTERNAL ONLY. More...

Public Types
typedef int	vertex_descriptor

typedef std::pair< int, int >	edge_descriptor

typedef directed_tag	directed_category

typedef disallow_parallel_edge_tag	edge_parallel_category

typedef mpi::detail::comm_out_edge_iterator	out_edge_iterator

typedef int	degree_size_type

typedef mpi::detail::comm_adj_iterator	adjacency_iterator

typedef counting_iterator< int >	vertex_iterator

typedef int	vertices_size_type

typedef mpi::detail::comm_edge_iterator	edge_iterator

typedef int	edges_size_type

Static Public Member Functions
static vertex_descriptor	null_vertex ()
	Returns a vertex descriptor that can never refer to any valid vertex. More...

Detailed Description

template<>
struct boost::graph_traits< mpi::graph_communicator >

Traits structure that allows a communicator with graph topology to be view as a graph by the Boost Graph Library.

The specialization of graph_traits for an MPI communicator allows a communicator with graph topology to be viewed as a graph. An MPI communicator with graph topology meets the requirements of the Graph, Incidence Graph, Adjacency Graph, Vertex List Graph, and Edge List Graph concepts from the Boost Graph Library.