breadth_first_search.hpp File Reference

#include <boost/graph/breadth_first_search.hpp>
#include <boost/graph/overloading.hpp>
#include <boost/graph/distributed/concepts.hpp>
#include <boost/graph/distributed/detail/filtered_queue.hpp>
#include <boost/graph/distributed/queue.hpp>
#include <boost/dynamic_bitset.hpp>
#include <boost/pending/queue.hpp>
#include <boost/graph/parallel/properties.hpp>
#include <boost/graph/parallel/container_traits.hpp>

Include dependency graph for breadth_first_search.hpp:

Classes
struct	boost::detail::darken_and_push< ColorMap >
	A unary predicate that decides when to push into a breadth-first search queue. More...
struct	boost::detail::has_not_been_seen< IndexMap >

Namespaces
	boost
	Duration formatting facet for input.
	boost::detail

Functions
template<typename IndexMap >
void	boost::detail::swap (has_not_been_seen< IndexMap > &x, has_not_been_seen< IndexMap > &y)
template<class DistributedGraph , class ColorMap , class BFSVisitor , class BufferRef , class VertexIndexMap >
void	boost::detail::parallel_bfs_helper (DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, ColorMap color, BFSVisitor vis, BufferRef Q, VertexIndexMap)
template<class DistributedGraph , class ColorMap , class BFSVisitor , class VertexIndexMap >
void	boost::detail::parallel_bfs_helper (DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, ColorMap color, BFSVisitor vis, boost::param_not_found, VertexIndexMap vertex_index)
template<class DistributedGraph , class ColorMap , class BFSVisitor , class P , class T , class R >
void	boost::detail::bfs_helper (DistributedGraph &g, typename graph_traits< DistributedGraph >::vertex_descriptor s, ColorMap color, BFSVisitor vis, const bgl_named_params< P, T, R > &params, boost::mpl::true_)