sl@0: //=======================================================================
sl@0: // Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
sl@0: // Copyright 2004 The Trustees of Indiana University.
sl@0: // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek, Douglas Gregor
sl@0: //
sl@0: // Distributed under the Boost Software License, Version 1.0. (See
sl@0: // accompanying file LICENSE_1_0.txt or copy at
sl@0: // http://www.boost.org/LICENSE_1_0.txt)
sl@0: //=======================================================================
sl@0: #ifndef BOOST_GRAPH_LEDA_HPP
sl@0: #define BOOST_GRAPH_LEDA_HPP
sl@0: 
sl@0: #include <boost/config.hpp>
sl@0: #include <boost/iterator/iterator_facade.hpp>
sl@0: #include <boost/graph/graph_traits.hpp>
sl@0: #include <boost/graph/properties.hpp>
sl@0: 
sl@0: #include <LEDA/graph.h>
sl@0: #include <LEDA/node_array.h>
sl@0: #include <LEDA/node_map.h>
sl@0: 
sl@0: // The functions and classes in this file allows the user to
sl@0: // treat a LEDA GRAPH object as a boost graph "as is". No
sl@0: // wrapper is needed for the GRAPH object.
sl@0: 
sl@0: // Remember to define LEDA_PREFIX so that LEDA types such as
sl@0: // leda_edge show up as "leda_edge" and not just "edge".
sl@0: 
sl@0: // Warning: this implementation relies on partial specialization
sl@0: // for the graph_traits class (so it won't compile with Visual C++)
sl@0: 
sl@0: // Warning: this implementation is in alpha and has not been tested
sl@0: 
sl@0: #if !defined BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
sl@0: namespace boost {
sl@0: 
sl@0:   struct leda_graph_traversal_category : 
sl@0:     public virtual bidirectional_graph_tag,
sl@0:     public virtual adjacency_graph_tag,
sl@0:     public virtual vertex_list_graph_tag { };
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   struct graph_traits< leda::GRAPH<vtype,etype> > {
sl@0:     typedef leda_node vertex_descriptor;
sl@0:     typedef leda_edge edge_descriptor;
sl@0: 
sl@0:     class adjacency_iterator 
sl@0:       : public iterator_facade<adjacency_iterator,
sl@0:                                leda_node,
sl@0:                                bidirectional_traversal_tag,
sl@0:                                leda_node,
sl@0:                                const leda_node*>
sl@0:     {
sl@0:     public:
sl@0:       explicit adjacency_iterator(leda_edge edge = 0) : base(edge) {}
sl@0: 
sl@0:     private:
sl@0:       leda_node dereference() const { return leda::target(base); }
sl@0: 
sl@0:       bool equal(const adjacency_iterator& other) const
sl@0:       { return base == other.base; }
sl@0: 
sl@0:       void increment() { base = Succ_Adj_Edge(base, 0); }
sl@0:       void decrement() { base = Pred_Adj_Edge(base, 0); }
sl@0: 
sl@0:       leda_edge base;
sl@0: 
sl@0:       friend class iterator_core_access;
sl@0:     };
sl@0:       
sl@0:     class out_edge_iterator 
sl@0:       : public iterator_facade<out_edge_iterator,
sl@0:                                leda_edge,
sl@0:                                bidirectional_traversal_tag,
sl@0:                                const leda_edge&,
sl@0:                                const leda_edge*>
sl@0:     {
sl@0:     public:
sl@0:       explicit out_edge_iterator(leda_edge edge = 0) : base(edge) {}
sl@0: 
sl@0:     private:
sl@0:       const leda_edge& dereference() const { return base; }
sl@0: 
sl@0:       bool equal(const out_edge_iterator& other) const
sl@0:       { return base == other.base; }
sl@0: 
sl@0:       void increment() { base = Succ_Adj_Edge(base, 0); }
sl@0:       void decrement() { base = Pred_Adj_Edge(base, 0); }
sl@0: 
sl@0:       leda_edge base;
sl@0: 
sl@0:       friend class iterator_core_access;
sl@0:     };
sl@0:       
sl@0:     class in_edge_iterator 
sl@0:       : public iterator_facade<in_edge_iterator,
sl@0:                                leda_edge,
sl@0:                                bidirectional_traversal_tag,
sl@0:                                const leda_edge&,
sl@0:                                const leda_edge*>
sl@0:     {
sl@0:     public:
sl@0:       explicit in_edge_iterator(leda_edge edge = 0) : base(edge) {}
sl@0: 
sl@0:     private:
sl@0:       const leda_edge& dereference() const { return base; }
sl@0: 
sl@0:       bool equal(const in_edge_iterator& other) const
sl@0:       { return base == other.base; }
sl@0: 
sl@0:       void increment() { base = Succ_Adj_Edge(base, 1); }
sl@0:       void decrement() { base = Pred_Adj_Edge(base, 1); }
sl@0: 
sl@0:       leda_edge base;
sl@0: 
sl@0:       friend class iterator_core_access;
sl@0:     };
sl@0: 
sl@0:     class vertex_iterator 
sl@0:       : public iterator_facade<vertex_iterator,
sl@0:                                leda_node,
sl@0:                                bidirectional_traversal_tag,
sl@0:                                const leda_node&,
sl@0:                                const leda_node*>
sl@0:     {
sl@0:     public:
sl@0:       vertex_iterator(leda_node node = 0, 
sl@0:                       const leda::GRAPH<vtype, etype>* g = 0)
sl@0:         : base(node), g(g) {}
sl@0: 
sl@0:     private:
sl@0:       const leda_node& dereference() const { return base; }
sl@0: 
sl@0:       bool equal(const vertex_iterator& other) const
sl@0:       { return base == other.base; }
sl@0: 
sl@0:       void increment() { base = g->succ_node(base); }
sl@0:       void decrement() { base = g->pred_node(base); }
sl@0: 
sl@0:       leda_node base;
sl@0:       const leda::GRAPH<vtype, etype>* g;
sl@0: 
sl@0:       friend class iterator_core_access;
sl@0:     };
sl@0: 
sl@0:     typedef directed_tag directed_category;
sl@0:     typedef allow_parallel_edge_tag edge_parallel_category; // not sure here
sl@0:     typedef leda_graph_traversal_category traversal_category;
sl@0:     typedef int vertices_size_type;
sl@0:     typedef int edges_size_type;
sl@0:     typedef int degree_size_type;
sl@0:   };
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   struct vertex_property< leda::GRAPH<vtype,etype> > {
sl@0:     typedef vtype type;
sl@0:   };
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   struct edge_property< leda::GRAPH<vtype,etype> > {
sl@0:     typedef etype type;
sl@0:   };
sl@0: 
sl@0: } // namespace boost
sl@0: #endif
sl@0: 
sl@0: namespace boost {
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor
sl@0:   source(typename graph_traits< leda::GRAPH<vtype,etype> >::edge_descriptor e,
sl@0:          const leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     return source(e);
sl@0:   }
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor
sl@0:   target(typename graph_traits< leda::GRAPH<vtype,etype> >::edge_descriptor e,
sl@0:          const leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     return target(e);
sl@0:   }
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   inline std::pair<
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_iterator,
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_iterator >  
sl@0:   vertices(const leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     typedef typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_iterator
sl@0:       Iter;
sl@0:     return std::make_pair( Iter(g.first_node(),&g), Iter(0,&g) );
sl@0:   }
sl@0: 
sl@0:   // no edges(g) function
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   inline std::pair<
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::out_edge_iterator,
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::out_edge_iterator >  
sl@0:   out_edges(
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor u, 
sl@0:     const leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     typedef typename graph_traits< leda::GRAPH<vtype,etype> >
sl@0:       ::out_edge_iterator Iter;
sl@0:     return std::make_pair( Iter(First_Adj_Edge(u,0)), Iter(0) );
sl@0:   }
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   inline std::pair<
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::in_edge_iterator,
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::in_edge_iterator >  
sl@0:   in_edges(
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor u, 
sl@0:     const leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     typedef typename graph_traits< leda::GRAPH<vtype,etype> >
sl@0:       ::in_edge_iterator Iter;
sl@0:     return std::make_pair( Iter(First_Adj_Edge(u,1)), Iter(0) );
sl@0:   }
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   inline std::pair<
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::adjacency_iterator,
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::adjacency_iterator >  
sl@0:   adjacent_vertices(
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor u, 
sl@0:     const leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     typedef typename graph_traits< leda::GRAPH<vtype,etype> >
sl@0:       ::adjacency_iterator Iter;
sl@0:     return std::make_pair( Iter(First_Adj_Edge(u,0)), Iter(0) );
sl@0:   }
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   typename graph_traits< leda::GRAPH<vtype,etype> >::vertices_size_type
sl@0:   num_vertices(const leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     return g.number_of_nodes();
sl@0:   }  
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   typename graph_traits< leda::GRAPH<vtype,etype> >::edges_size_type
sl@0:   num_edges(const leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     return g.number_of_edges();
sl@0:   }  
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   typename graph_traits< leda::GRAPH<vtype,etype> >::degree_size_type
sl@0:   out_degree(
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor u, 
sl@0:     const leda::GRAPH<vtype,etype>&)
sl@0:   {
sl@0:     return outdeg(u);
sl@0:   }
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   typename graph_traits< leda::GRAPH<vtype,etype> >::degree_size_type
sl@0:   in_degree(
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor u, 
sl@0:     const leda::GRAPH<vtype,etype>&)
sl@0:   {
sl@0:     return indeg(u);
sl@0:   }
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   typename graph_traits< leda::GRAPH<vtype,etype> >::degree_size_type
sl@0:   degree(
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor u, 
sl@0:     const leda::GRAPH<vtype,etype>&)
sl@0:   {
sl@0:     return outdeg(u) + indeg(u);
sl@0:   }
sl@0:   
sl@0:   template <class vtype, class etype>
sl@0:   typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor
sl@0:   add_vertex(leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     return g.new_node();
sl@0:   }
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor
sl@0:   add_vertex(const vtype& vp, leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     return g.new_node(vp);
sl@0:   }
sl@0: 
sl@0:   // Hmm, LEDA doesn't have the equivalent of clear_vertex() -JGS
sl@0:   // need to write an implementation
sl@0:   template <class vtype, class etype>
sl@0:   void clear_vertex(
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor u,
sl@0:     leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     g.del_node(u);
sl@0:   }
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   void remove_vertex(
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor u,
sl@0:     leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     g.del_node(u);
sl@0:   }
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   std::pair<
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::edge_descriptor,
sl@0:     bool>
sl@0:   add_edge(
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor u,
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor v,
sl@0:     leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     return std::make_pair(g.new_edge(u, v), true);
sl@0:   }
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   std::pair<
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::edge_descriptor,
sl@0:     bool>
sl@0:   add_edge(
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor u,
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor v,
sl@0:     const etype& et, 
sl@0:     leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     return std::make_pair(g.new_edge(u, v, et), true);
sl@0:   }
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   void
sl@0:   remove_edge(
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor u,
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::vertex_descriptor v,
sl@0:     leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::out_edge_iterator 
sl@0:       i,iend;
sl@0:     for (boost::tie(i,iend) = out_edges(u,g); i != iend; ++i)
sl@0:       if (target(*i,g) == v)
sl@0:         g.del_edge(*i);
sl@0:   }
sl@0: 
sl@0:   template <class vtype, class etype>
sl@0:   void
sl@0:   remove_edge(
sl@0:     typename graph_traits< leda::GRAPH<vtype,etype> >::edge_descriptor e,
sl@0:     leda::GRAPH<vtype,etype>& g)
sl@0:   {
sl@0:     g.del_edge(e);
sl@0:   }
sl@0: 
sl@0:   //===========================================================================
sl@0:   // property maps
sl@0:   
sl@0:   class leda_graph_id_map
sl@0:     : public put_get_helper<int, leda_graph_id_map>
sl@0:   {
sl@0:   public:
sl@0:     typedef readable_property_map_tag category;
sl@0:     typedef int value_type;
sl@0:     typedef int reference;
sl@0:     typedef leda_node key_type;
sl@0:     leda_graph_id_map() { }
sl@0:     template <class T>
sl@0:     long operator[](T x) const { return x->id(); }
sl@0:   };
sl@0:   template <class vtype, class etype>
sl@0:   inline leda_graph_id_map
sl@0:   get(vertex_index_t, const leda::GRAPH<vtype, etype>& g) {
sl@0:     return leda_graph_id_map();
sl@0:   }
sl@0:   template <class vtype, class etype>
sl@0:   inline leda_graph_id_map
sl@0:   get(edge_index_t, const leda::GRAPH<vtype, etype>& g) {
sl@0:     return leda_graph_id_map();
sl@0:   }
sl@0: 
sl@0:   template <class Tag>
sl@0:   struct leda_property_map { };
sl@0: 
sl@0:   template <>
sl@0:   struct leda_property_map<vertex_index_t> {
sl@0:     template <class vtype, class etype>
sl@0:     struct bind_ {
sl@0:       typedef leda_graph_id_map type;
sl@0:       typedef leda_graph_id_map const_type;
sl@0:     };
sl@0:   };
sl@0:   template <>
sl@0:   struct leda_property_map<edge_index_t> {
sl@0:     template <class vtype, class etype>
sl@0:     struct bind_ {
sl@0:       typedef leda_graph_id_map type;
sl@0:       typedef leda_graph_id_map const_type;
sl@0:     };
sl@0:   };
sl@0: 
sl@0: 
sl@0:   template <class Data, class DataRef, class GraphPtr>
sl@0:   class leda_graph_data_map
sl@0:     : public put_get_helper<DataRef, 
sl@0:                             leda_graph_data_map<Data,DataRef,GraphPtr> >
sl@0:   {
sl@0:   public:
sl@0:     typedef Data value_type;
sl@0:     typedef DataRef reference;
sl@0:     typedef void key_type;
sl@0:     typedef lvalue_property_map_tag category;
sl@0:     leda_graph_data_map(GraphPtr g) : m_g(g) { }
sl@0:     template <class NodeOrEdge>
sl@0:     DataRef operator[](NodeOrEdge x) const { return (*m_g)[x]; }
sl@0:   protected:
sl@0:     GraphPtr m_g;
sl@0:   };
sl@0: 
sl@0:   template <>
sl@0:   struct leda_property_map<vertex_all_t> {
sl@0:     template <class vtype, class etype>
sl@0:     struct bind_ {
sl@0:       typedef leda_graph_data_map<vtype, vtype&, leda::GRAPH<vtype, etype>*> type;
sl@0:       typedef leda_graph_data_map<vtype, const vtype&, 
sl@0:         const leda::GRAPH<vtype, etype>*> const_type;
sl@0:     };
sl@0:   };  
sl@0:   template <class vtype, class etype >
sl@0:   inline typename property_map< leda::GRAPH<vtype, etype>, vertex_all_t>::type
sl@0:   get(vertex_all_t, leda::GRAPH<vtype, etype>& g) {
sl@0:     typedef typename property_map< leda::GRAPH<vtype, etype>, vertex_all_t>::type 
sl@0:       pmap_type;
sl@0:     return pmap_type(&g);
sl@0:   }
sl@0:   template <class vtype, class etype >
sl@0:   inline typename property_map< leda::GRAPH<vtype, etype>, vertex_all_t>::const_type
sl@0:   get(vertex_all_t, const leda::GRAPH<vtype, etype>& g) {
sl@0:     typedef typename property_map< leda::GRAPH<vtype, etype>, 
sl@0:       vertex_all_t>::const_type pmap_type;
sl@0:     return pmap_type(&g);
sl@0:   }
sl@0: 
sl@0:   template <>
sl@0:   struct leda_property_map<edge_all_t> {
sl@0:     template <class vtype, class etype>
sl@0:     struct bind_ {
sl@0:       typedef leda_graph_data_map<etype, etype&, leda::GRAPH<vtype, etype>*> type;
sl@0:       typedef leda_graph_data_map<etype, const etype&, 
sl@0:         const leda::GRAPH<vtype, etype>*> const_type;
sl@0:     };
sl@0:   };
sl@0:   template <class vtype, class etype >
sl@0:   inline typename property_map< leda::GRAPH<vtype, etype>, edge_all_t>::type
sl@0:   get(edge_all_t, leda::GRAPH<vtype, etype>& g) {
sl@0:     typedef typename property_map< leda::GRAPH<vtype, etype>, edge_all_t>::type 
sl@0:       pmap_type;
sl@0:     return pmap_type(&g);
sl@0:   }
sl@0:   template <class vtype, class etype >
sl@0:   inline typename property_map< leda::GRAPH<vtype, etype>, edge_all_t>::const_type
sl@0:   get(edge_all_t, const leda::GRAPH<vtype, etype>& g) {
sl@0:     typedef typename property_map< leda::GRAPH<vtype, etype>, 
sl@0:       edge_all_t>::const_type pmap_type;
sl@0:     return pmap_type(&g);
sl@0:   }
sl@0: 
sl@0:   // property map interface to the LEDA node_array class
sl@0: 
sl@0:   template <class E, class ERef, class NodeMapPtr>
sl@0:   class leda_node_property_map
sl@0:     : public put_get_helper<ERef, leda_node_property_map<E, ERef, NodeMapPtr> >
sl@0:   {
sl@0:   public:
sl@0:     typedef E value_type;
sl@0:     typedef ERef reference;
sl@0:     typedef leda_node key_type;
sl@0:     typedef lvalue_property_map_tag category;
sl@0:     leda_node_property_map(NodeMapPtr a) : m_array(a) { }
sl@0:     ERef operator[](leda_node n) const { return (*m_array)[n]; }
sl@0:   protected:
sl@0:     NodeMapPtr m_array;
sl@0:   };
sl@0:   template <class E>
sl@0:   leda_node_property_map<E, const E&, const leda_node_array<E>*>
sl@0:   make_leda_node_property_map(const leda_node_array<E>& a)
sl@0:   {
sl@0:     typedef leda_node_property_map<E, const E&, const leda_node_array<E>*>
sl@0:       pmap_type;
sl@0:     return pmap_type(&a);
sl@0:   }
sl@0:   template <class E>
sl@0:   leda_node_property_map<E, E&, leda_node_array<E>*>
sl@0:   make_leda_node_property_map(leda_node_array<E>& a)
sl@0:   {
sl@0:     typedef leda_node_property_map<E, E&, leda_node_array<E>*> pmap_type;
sl@0:     return pmap_type(&a);
sl@0:   }
sl@0: 
sl@0:   template <class E>
sl@0:   leda_node_property_map<E, const E&, const leda_node_map<E>*>
sl@0:   make_leda_node_property_map(const leda_node_map<E>& a)
sl@0:   {
sl@0:     typedef leda_node_property_map<E,const E&,const leda_node_map<E>*> 
sl@0:       pmap_type;
sl@0:     return pmap_type(&a);
sl@0:   }
sl@0:   template <class E>
sl@0:   leda_node_property_map<E, E&, leda_node_map<E>*>
sl@0:   make_leda_node_property_map(leda_node_map<E>& a)
sl@0:   {
sl@0:     typedef leda_node_property_map<E, E&, leda_node_map<E>*> pmap_type;
sl@0:     return pmap_type(&a);
sl@0:   }
sl@0: 
sl@0:   // g++ 'enumeral_type' in template unification not implemented workaround
sl@0:   template <class vtype, class etype, class Tag>
sl@0:   struct property_map<leda::GRAPH<vtype, etype>, Tag> {
sl@0:     typedef typename 
sl@0:       leda_property_map<Tag>::template bind_<vtype, etype> map_gen;
sl@0:     typedef typename map_gen::type type;
sl@0:     typedef typename map_gen::const_type const_type;
sl@0:   };
sl@0: 
sl@0:   template <class vtype, class etype, class PropertyTag, class Key>
sl@0:   inline
sl@0:   typename boost::property_traits<
sl@0:     typename boost::property_map<leda::GRAPH<vtype, etype>,PropertyTag>::const_type
sl@0:   >::value_type
sl@0:   get(PropertyTag p, const leda::GRAPH<vtype, etype>& g, const Key& key) {
sl@0:     return get(get(p, g), key);
sl@0:   }
sl@0:   
sl@0:   template <class vtype, class etype, class PropertyTag, class Key,class Value>
sl@0:   inline void
sl@0:   put(PropertyTag p, leda::GRAPH<vtype, etype>& g, 
sl@0:       const Key& key, const Value& value)
sl@0:   {
sl@0:     typedef typename property_map<leda::GRAPH<vtype, etype>, PropertyTag>::type Map;
sl@0:     Map pmap = get(p, g);
sl@0:     put(pmap, key, value);
sl@0:   }
sl@0: 
sl@0: } // namespace boost
sl@0: 
sl@0: 
sl@0: #endif // BOOST_GRAPH_LEDA_HPP