id,summary,reporter,owner,description,type,status,milestone,component,version,severity,resolution,keywords,cc
1326,Unable to check graph isomorphism using LEDA adapter,iouri.smirnov@…,Jeremiah Willcock,"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!
",Bugs,reopened,To Be Determined,graph,Boost Development Trunk,Problem,,LEDA,ich@…