1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
|
// Copyright (C) 2004-2008 The Trustees of Indiana University.
// Use, modification and distribution is subject to the Boost Software
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
// Authors: Nick Edmonds
// Douglas Gregor
// Andrew Lumsdaine
#ifndef BOOST_DISTRIBUTED_FILTERED_GRAPH_HPP
#define BOOST_DISTRIBUTED_FILTERED_GRAPH_HPP
#ifndef BOOST_GRAPH_USE_MPI
#error "Parallel BGL files should not be included unless <boost/graph/use_mpi.hpp> has been included"
#endif
#include <boost/graph/parallel/process_group.hpp>
#include <boost/graph/filtered_graph.hpp>
namespace boost {
namespace graph {
namespace parallel {
/// Retrieve the process group from a filtered graph
template<typename Graph, typename EdgePredicate, typename VertexPredicate>
struct process_group_type<filtered_graph<Graph, EdgePredicate, VertexPredicate> >
: process_group_type<Graph> { };
template<typename Graph, typename EdgePredicate, typename VertexPredicate>
struct process_group_type<const filtered_graph<Graph, EdgePredicate, VertexPredicate> >
: process_group_type<Graph> { };
}
}
/// Retrieve the process group from a filtered graph
template<typename Graph, typename EdgePredicate, typename VertexPredicate>
inline typename graph::parallel::process_group_type<Graph>::type
process_group(filtered_graph<Graph, EdgePredicate, VertexPredicate> const& g) {
return process_group(g.m_g);
}
/// Forward vertex() to vertex() of the base graph
template <typename Graph, typename EdgePredicate, typename VertexPredicate>
typename graph_traits<Graph>::vertex_descriptor
vertex(typename graph_traits<Graph>::vertices_size_type i,
filtered_graph<Graph, EdgePredicate, VertexPredicate> const& g)
{ return vertex(i, g.m_g); }
}
#endif // BOOST_DISTRIBUTED_FILTERED_GRAPH_HPP
|
