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