vector_as_graph.hpp File Reference

#include <cassert>
#include <utility>
#include <vector>
#include <cstddef>
#include <boost/iterator.hpp>
#include <boost/iterator/counting_iterator.hpp>
#include <boost/range/irange.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/properties.hpp>
#include <algorithm>

Include dependency graph for vector_as_graph.hpp:

Classes
struct	boost::detail::val_out_edge_ret< EdgeList >
struct	boost::detail::val_out_edge_iter< EdgeList >
struct	boost::detail::val_edge< EdgeList >
struct	boost::vector_as_graph_traversal_tag
struct	boost::graph_traits< std::vector< EdgeList > >
struct	boost::edge_property_type< std::vector< EdgeList > >
struct	boost::vertex_property_type< std::vector< EdgeList > >
struct	boost::graph_property_type< std::vector< EdgeList > >
struct	boost::detail::val_edge< EdgeList >
class	boost::detail::val_out_edge_iterator< V, Iter >
struct	boost::detail::val_out_edge_iter< EdgeList >
struct	boost::detail::val_out_edge_ret< EdgeList >
struct	boost::property_map< std::vector< EdgeList, Allocator >, vertex_index_t >

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

Functions
template<class EdgeList , class Alloc >
detail::val_out_edge_ret < EdgeList >::type	boost::out_edges (typename EdgeList::value_type v, const std::vector< EdgeList, Alloc > &g)
template<class EdgeList , class Alloc >
EdgeList::size_type	boost::out_degree (typename EdgeList::value_type v, const std::vector< EdgeList, Alloc > &g)
template<class EdgeList , class Alloc >
std::pair< typename EdgeList::const_iterator, typename EdgeList::const_iterator >	boost::adjacent_vertices (typename EdgeList::value_type v, const std::vector< EdgeList, Alloc > &g)
template<class EdgeList , class Alloc >
std::pair < boost::counting_iterator < typename EdgeList::value_type > , boost::counting_iterator < typename EdgeList::value_type > >	boost::vertices (const std::vector< EdgeList, Alloc > &v)
template<class EdgeList , class Alloc >
std::vector< EdgeList, Alloc > ::size_type	boost::num_vertices (const std::vector< EdgeList, Alloc > &v)
template<class EdgeList , class Allocator >
std::pair< typename detail::val_edge< EdgeList > ::type, bool >	boost::add_edge (typename EdgeList::value_type u, typename EdgeList::value_type v, std::vector< EdgeList, Allocator > &g)
template<class EdgeList , class Allocator >
std::pair< typename detail::val_edge< EdgeList > ::type, bool >	boost::edge (typename EdgeList::value_type u, typename EdgeList::value_type v, std::vector< EdgeList, Allocator > &g)
template<class EdgeList , class Allocator >
void	boost::remove_edge (typename EdgeList::value_type u, typename EdgeList::value_type v, std::vector< EdgeList, Allocator > &g)
template<class EdgeList , class Allocator >
void	boost::remove_edge (typename detail::val_edge< EdgeList >::type e, std::vector< EdgeList, Allocator > &g)
template<class EdgeList , class Allocator , class Predicate >
void	boost::remove_edge_if (Predicate p, std::vector< EdgeList, Allocator > &g)
template<class EdgeList , class Allocator >
EdgeList::value_type	boost::add_vertex (std::vector< EdgeList, Allocator > &g)
template<class EdgeList , class Allocator >
void	boost::clear_vertex (typename EdgeList::value_type u, std::vector< EdgeList, Allocator > &g)
template<class EdgeList , class Allocator >
void	boost::remove_vertex (typename EdgeList::value_type u, std::vector< EdgeList, Allocator > &g)
template<typename EdgeList , typename Allocator >
identity_property_map	boost::get (vertex_index_t, const std::vector< EdgeList, Allocator > &)
template<typename EdgeList , typename Allocator >
identity_property_map	boost::get (vertex_index_t, std::vector< EdgeList, Allocator > &)