[Boost-bugs] [Boost C++ Libraries] #1326: Unable to check graph isomorphism using LEDA adapter

Subject: [Boost-bugs] [Boost C++ Libraries] #1326: Unable to check graph isomorphism using LEDA adapter
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2007-10-18 11:08:59

#1326: Unable to check graph isomorphism using LEDA adapter
--------------------------------------+-------------------------------------
 Reporter:  iouri.smirnov_at_[hidden]  |       Owner:  dgregor
     Type:  Bugs                      |      Status:  new    
Milestone:  To Be Determined          |   Component:  graph  
  Version:  Boost 1.34.1              |    Severity:  Problem
 Keywords:  LEDA                      |  
--------------------------------------+-------------------------------------
 I tried to use isomorphism() algorithm with LEDA graphs and encountered
 several compilation issues:

 1. "leda::" namespace is not used in LEDA 4.3.1, therefore declaration
 "leda::GRAPH<vtype,etype>" might be wrong.

 2. EdgeListGraph concept must be supported by a graph in order to use it
 by the isomorphism() algorithm. For me it's unclear why this interface is
 not implemented in LEDA adapter. Generally, it is possible to iterate
 through edges in LEDA graphs. Moreover, EdgeListGraph interface
 implementation may look very similar to VertexListGraph one.

 3. All LEDA adapter iterators publicly inherit from
    iterator_facade< Derived, Value, CategoryOrTraversal, Reference,
 Difference >
 but const pointers to Value are incorrectly passed as the last argument
 (i.e. Difference) while ptrdiff_t is expected. It causes wrong
 instantiation of count() and count_if() algorithms used by isomorphism()
 one.

 I would like to present my fixes of these problems in LEDA adapter for
 review. Thanks!

-- 
Ticket URL: <http://svn.boost.org/trac/boost/ticket/1326>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.