directed_graph.hpp File Reference

#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/properties.hpp>
#include <boost/pending/property.hpp>
#include <boost/property_map/transform_value_property_map.hpp>
#include <boost/type_traits.hpp>
#include <boost/mpl/if.hpp>

Include dependency graph for directed_graph.hpp:

Classes
struct	boost::directed_graph_tag
class	boost::directed_graph< VertexProp, EdgeProp, GraphProp >
	The directed_graph class template is a simplified version of the BGL adjacency list. More...
struct	boost::property_map< directed_graph< VP, EP, GP >, Property >
struct	boost::property_map< directed_graph< VP, EP, GP >, vertex_all_t >
struct	boost::property_map< directed_graph< VP, EP, GP >, edge_all_t >
struct	boost::graph_mutability_traits< directed_graph< VP, EP, GP > >

Namespaces
	boost
	Duration formatting facet for input.

Macros
#define	DIRECTED_GRAPH_PARAMS   typename VP, typename EP, typename GP
#define	DIRECTED_GRAPH   directed_graph<VP,EP,GP>

Functions
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertex_descriptor	boost::source (typename directed_graph< VP, EP, GP >::edge_descriptor e, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertex_descriptor	boost::target (typename directed_graph< VP, EP, GP >::edge_descriptor e, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::degree_size_type	boost::out_degree (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::out_edge_iterator, typename directed_graph< VP, EP, GP > ::out_edge_iterator >	boost::out_edges (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::degree_size_type	boost::in_degree (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::in_edge_iterator, typename directed_graph< VP, EP, GP > ::in_edge_iterator >	boost::in_edges (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::degree_size_type	boost::degree (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::adjacency_iterator, typename directed_graph< VP, EP, GP > ::adjacency_iterator >	boost::adjacent_vertices (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertex_descriptor	boost::vertex (typename directed_graph< VP, EP, GP >::vertices_size_type n, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::edge_descriptor, bool >	boost::edge (typename directed_graph< VP, EP, GP >::vertex_descriptor u, typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertices_size_type	boost::num_vertices (directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::vertex_iterator, typename directed_graph< VP, EP, GP > ::vertex_iterator >	boost::vertices (directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::edges_size_type	boost::num_edges (directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::edge_iterator, typename directed_graph< VP, EP, GP > ::edge_iterator >	boost::edges (directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertex_descriptor	boost::add_vertex (directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertex_descriptor	boost::add_vertex (typename directed_graph< VP, EP, GP >::vertex_property_type const &p, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	boost::clear_vertex (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	boost::remove_vertex (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::edge_descriptor, bool >	boost::add_edge (typename directed_graph< VP, EP, GP >::vertex_descriptor u, typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
std::pair< typename directed_graph< VP, EP, GP > ::edge_descriptor, bool >	boost::add_edge (typename directed_graph< VP, EP, GP >::vertex_descriptor u, typename directed_graph< VP, EP, GP >::vertex_descriptor v, typename directed_graph< VP, EP, GP >::edge_property_type const &p, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	boost::remove_edge (typename directed_graph< VP, EP, GP >::vertex_descriptor u, typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	boost::remove_edge (typename directed_graph< VP, EP, GP >::edge_descriptor e, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	boost::remove_edge (typename directed_graph< VP, EP, GP >::edge_iterator i, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , class Predicate >
void	boost::remove_edge_if (Predicate pred, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , class Predicate >
void	boost::remove_out_edge_if (typename directed_graph< VP, EP, GP >::vertex_descriptor v, Predicate pred, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , class Predicate >
void	boost::remove_in_edge_if (typename directed_graph< VP, EP, GP >::vertex_descriptor v, Predicate pred, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , typename Property >
property_map< directed_graph < VP, EP, GP >, Property > ::type	boost::get (Property p, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP , typename Property >
property_map< directed_graph < VP, EP, GP >, Property > ::const_type	boost::get (Property p, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
property_map< directed_graph < VP, EP, GP >, vertex_all_t > ::type	boost::get (vertex_all_t, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
property_map< directed_graph < VP, EP, GP >, vertex_all_t > ::const_type	boost::get (vertex_all_t, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
property_map< directed_graph < VP, EP, GP >, edge_all_t > ::type	boost::get (edge_all_t, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
property_map< directed_graph < VP, EP, GP >, edge_all_t > ::const_type	boost::get (edge_all_t, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP , typename Property , typename Key >
property_traits< typename property_map< typename directed_graph< VP, EP, GP > ::graph_type, Property > ::const_type >::value_type	boost::get (Property p, directed_graph< VP, EP, GP > const &g, Key const &k)
template<typename VP , typename EP , typename GP , typename Key >
property_traits< typename property_map< typename directed_graph< VP, EP, GP > ::graph_type, vertex_all_t > ::const_type >::value_type	boost::get (vertex_all_t, directed_graph< VP, EP, GP > const &g, Key const &k)
template<typename VP , typename EP , typename GP , typename Key >
property_traits< typename property_map< typename directed_graph< VP, EP, GP > ::graph_type, edge_all_t > ::const_type >::value_type	boost::get (edge_all_t, directed_graph< VP, EP, GP > const &g, Key const &k)
template<typename VP , typename EP , typename GP , typename Property , typename Key , typename Value >
void	boost::put (Property p, directed_graph< VP, EP, GP > &g, Key const &k, Value const &v)
template<typename VP , typename EP , typename GP , typename Key , typename Value >
void	boost::put (vertex_all_t, directed_graph< VP, EP, GP > &g, Key const &k, Value const &v)
template<typename VP , typename EP , typename GP , typename Key , typename Value >
void	boost::put (edge_all_t, directed_graph< VP, EP, GP > &g, Key const &k, Value const &v)
template<typename VP , typename EP , typename GP , class Property >
graph_property< directed_graph < VP, EP, GP >, Property > ::type &	boost::get_property (directed_graph< VP, EP, GP > &g, Property p)
template<typename VP , typename EP , typename GP , class Property >
graph_property< directed_graph < VP, EP, GP >, Property > ::type const &	boost::get_property (directed_graph< VP, EP, GP > const &g, Property p)
template<typename VP , typename EP , typename GP , class Property , class Value >
void	boost::set_property (directed_graph< VP, EP, GP > &g, Property p, Value v)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertex_index_type	boost::get_vertex_index (typename directed_graph< VP, EP, GP >::vertex_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::vertex_index_type	boost::max_vertex_index (directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
void	boost::renumber_vertex_indices (directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	boost::remove_vertex_and_renumber_indices (typename directed_graph< VP, EP, GP >::vertex_iterator i, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::edge_index_type	boost::get_edge_index (typename directed_graph< VP, EP, GP >::edge_descriptor v, directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
directed_graph< VP, EP, GP > ::edge_index_type	boost::max_edge_index (directed_graph< VP, EP, GP > const &g)
template<typename VP , typename EP , typename GP >
void	boost::renumber_edge_indices (directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	boost::remove_edge_and_renumber_indices (typename directed_graph< VP, EP, GP >::edge_iterator i, directed_graph< VP, EP, GP > &g)
template<typename VP , typename EP , typename GP >
void	boost::renumber_indices (directed_graph< VP, EP, GP > &g)

Macro Definition Documentation

#define DIRECTED_GRAPH   directed_graph<VP,EP,GP>

#define DIRECTED_GRAPH_PARAMS   typename VP, typename EP, typename GP