leda_graph.hpp File Reference

#include <boost/config.hpp>
#include <boost/iterator/iterator_facade.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/properties.hpp>
#include <LEDA/graph/graph.h>
#include <LEDA/graph/node_array.h>
#include <LEDA/graph/node_map.h>

Include dependency graph for leda_graph.hpp:

Classes
struct	boost::leda_graph_traversal_category
struct	boost::graph_traits< leda::GRAPH< vtype, etype > >
class	boost::graph_traits< leda::GRAPH< vtype, etype > >::adjacency_iterator
class	boost::graph_traits< leda::GRAPH< vtype, etype > >::out_edge_iterator
class	boost::graph_traits< leda::GRAPH< vtype, etype > >::in_edge_iterator
class	boost::graph_traits< leda::GRAPH< vtype, etype > >::vertex_iterator
class	boost::graph_traits< leda::GRAPH< vtype, etype > >::edge_iterator
struct	boost::graph_traits< leda::graph >
class	boost::graph_traits< leda::graph >::adjacency_iterator
class	boost::graph_traits< leda::graph >::out_edge_iterator
class	boost::graph_traits< leda::graph >::in_edge_iterator
class	boost::graph_traits< leda::graph >::vertex_iterator
class	boost::graph_traits< leda::graph >::edge_iterator
class	boost::leda_graph_id_map
struct	boost::leda_property_map< Tag >
struct	boost::leda_property_map< vertex_index_t >
struct	boost::leda_property_map< vertex_index_t >::bind_< vtype, etype >
struct	boost::leda_property_map< edge_index_t >
struct	boost::leda_property_map< edge_index_t >::bind_< vtype, etype >
class	boost::leda_graph_data_map< Data, DataRef, GraphPtr >
struct	boost::leda_property_map< vertex_all_t >
struct	boost::leda_property_map< vertex_all_t >::bind_< vtype, etype >
struct	boost::leda_property_map< edge_all_t >
struct	boost::leda_property_map< edge_all_t >::bind_< vtype, etype >
class	boost::leda_node_property_map< E, ERef, NodeMapPtr >
struct	boost::property_map< leda::GRAPH< vtype, etype >, Tag >
class	boost::leda_edge_property_map< E, ERef, EdgeMapPtr >

Namespaces
	boost
	Duration formatting facet for input.

Functions
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::vertex_descriptor	boost::source (typename graph_traits< leda::GRAPH< vtype, etype > >::edge_descriptor e, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::vertex_descriptor	boost::target (typename graph_traits< leda::GRAPH< vtype, etype > >::edge_descriptor e, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
std::pair< typename graph_traits< leda::GRAPH < vtype, etype > >::vertex_iterator, typename graph_traits< leda::GRAPH < vtype, etype > >::vertex_iterator >	boost::vertices (const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
std::pair< typename graph_traits< leda::GRAPH < vtype, etype > >::edge_iterator, typename graph_traits< leda::GRAPH < vtype, etype > >::edge_iterator >	boost::edges (const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
std::pair< typename graph_traits< leda::GRAPH < vtype, etype > >::out_edge_iterator, typename graph_traits < leda::GRAPH< vtype, etype > >::out_edge_iterator >	boost::out_edges (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
std::pair< typename graph_traits< leda::GRAPH < vtype, etype > >::in_edge_iterator, typename graph_traits< leda::GRAPH < vtype, etype > >::in_edge_iterator >	boost::in_edges (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
std::pair< typename graph_traits< leda::GRAPH < vtype, etype > >::adjacency_iterator, typename graph_traits < leda::GRAPH< vtype, etype > >::adjacency_iterator >	boost::adjacent_vertices (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::vertices_size_type	boost::num_vertices (const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::edges_size_type	boost::num_edges (const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::degree_size_type	boost::out_degree (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::degree_size_type	boost::in_degree (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::degree_size_type	boost::degree (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::vertex_descriptor	boost::add_vertex (leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
graph_traits< leda::GRAPH < vtype, etype > >::vertex_descriptor	boost::add_vertex (const vtype &vp, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
void	boost::clear_vertex (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
void	boost::remove_vertex (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
std::pair< typename graph_traits< leda::GRAPH < vtype, etype > >::edge_descriptor, bool >	boost::add_edge (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor v, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
std::pair< typename graph_traits< leda::GRAPH < vtype, etype > >::edge_descriptor, bool >	boost::add_edge (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor v, const etype &et, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
void	boost::remove_edge (typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor u, typename graph_traits< leda::GRAPH< vtype, etype > >::vertex_descriptor v, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
void	boost::remove_edge (typename graph_traits< leda::GRAPH< vtype, etype > >::edge_descriptor e, leda::GRAPH< vtype, etype > &g)
graph_traits< leda::graph > ::vertex_descriptor	boost::source (graph_traits< leda::graph >::edge_descriptor e, const leda::graph &g)
graph_traits< leda::graph > ::vertex_descriptor	boost::target (graph_traits< leda::graph >::edge_descriptor e, const leda::graph &g)
std::pair< graph_traits < leda::graph > ::vertex_iterator, graph_traits< leda::graph > ::vertex_iterator >	boost::vertices (const leda::graph &g)
std::pair< graph_traits < leda::graph >::edge_iterator, graph_traits< leda::graph > ::edge_iterator >	boost::edges (const leda::graph &g)
std::pair< graph_traits < leda::graph > ::out_edge_iterator, graph_traits< leda::graph > ::out_edge_iterator >	boost::out_edges (graph_traits< leda::graph >::vertex_descriptor u, const leda::graph &g)
std::pair< graph_traits < leda::graph > ::in_edge_iterator, graph_traits< leda::graph > ::in_edge_iterator >	boost::in_edges (graph_traits< leda::graph >::vertex_descriptor u, const leda::graph &g)
std::pair< graph_traits < leda::graph > ::adjacency_iterator, graph_traits< leda::graph > ::adjacency_iterator >	boost::adjacent_vertices (graph_traits< leda::graph >::vertex_descriptor u, const leda::graph &g)
graph_traits< leda::graph > ::vertices_size_type	boost::num_vertices (const leda::graph &g)
graph_traits< leda::graph > ::edges_size_type	boost::num_edges (const leda::graph &g)
graph_traits< leda::graph > ::degree_size_type	boost::out_degree (graph_traits< leda::graph >::vertex_descriptor u, const leda::graph &g)
graph_traits< leda::graph > ::degree_size_type	boost::in_degree (graph_traits< leda::graph >::vertex_descriptor u, const leda::graph &g)
graph_traits< leda::graph > ::degree_size_type	boost::degree (graph_traits< leda::graph >::vertex_descriptor u, const leda::graph &g)
graph_traits< leda::graph > ::vertex_descriptor	boost::add_vertex (leda::graph &g)
void	boost::remove_edge (graph_traits< leda::graph >::vertex_descriptor u, graph_traits< leda::graph >::vertex_descriptor v, leda::graph &g)
void	boost::remove_edge (graph_traits< leda::graph >::edge_descriptor e, leda::graph &g)
void	boost::clear_vertex (graph_traits< leda::graph >::vertex_descriptor u, leda::graph &g)
void	boost::remove_vertex (graph_traits< leda::graph >::vertex_descriptor u, leda::graph &g)
std::pair< graph_traits < leda::graph > ::edge_descriptor, bool >	boost::add_edge (graph_traits< leda::graph >::vertex_descriptor u, graph_traits< leda::graph >::vertex_descriptor v, leda::graph &g)
template<class vtype , class etype >
leda_graph_id_map	boost::get (vertex_index_t, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
leda_graph_id_map	boost::get (edge_index_t, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
property_map< leda::GRAPH < vtype, etype >, vertex_all_t > ::type	boost::get (vertex_all_t, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
property_map< leda::GRAPH < vtype, etype >, vertex_all_t > ::const_type	boost::get (vertex_all_t, const leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
property_map< leda::GRAPH < vtype, etype >, edge_all_t > ::type	boost::get (edge_all_t, leda::GRAPH< vtype, etype > &g)
template<class vtype , class etype >
property_map< leda::GRAPH < vtype, etype >, edge_all_t > ::const_type	boost::get (edge_all_t, const leda::GRAPH< vtype, etype > &g)
template<class E >
leda_node_property_map< E, const E &, const leda::node_array< E > * >	boost::make_leda_node_property_map (const leda::node_array< E > &a)
template<class E >
leda_node_property_map< E, E &, leda::node_array< E > * >	boost::make_leda_node_property_map (leda::node_array< E > &a)
template<class E >
leda_node_property_map< E, const E &, const leda::node_map< E > * >	boost::make_leda_node_property_map (const leda::node_map< E > &a)
template<class E >
leda_node_property_map< E, E &, leda::node_map< E > * >	boost::make_leda_node_property_map (leda::node_map< E > &a)
template<class vtype , class etype , class PropertyTag , class Key >
boost::property_traits < typename boost::property_map < leda::GRAPH< vtype, etype > , PropertyTag >::const_type > ::value_type	boost::get (PropertyTag p, const leda::GRAPH< vtype, etype > &g, const Key &key)
template<class vtype , class etype , class PropertyTag , class Key , class Value >
void	boost::put (PropertyTag p, leda::GRAPH< vtype, etype > &g, const Key &key, const Value &value)
template<class E >
leda_edge_property_map< E, const E &, const leda::edge_array< E > * >	boost::make_leda_node_property_map (const leda::node_array< E > &a)
template<class E >
leda_edge_property_map< E, E &, leda::edge_array< E > * >	boost::make_leda_edge_property_map (leda::edge_array< E > &a)
template<class E >
leda_edge_property_map< E, const E &, const leda::edge_map< E > * >	boost::make_leda_edge_property_map (const leda::edge_map< E > &a)
template<class E >
leda_edge_property_map< E, E &, leda::edge_map< E > * >	boost::make_leda_edge_property_map (leda::edge_map< E > &a)