[Boost-users] [BGL] bug in PLOD algorithm

From: Johan Oudinet (johan.oudinet_at_[hidden])
Date: 2006-03-14 05:57:06

Hi,
I'm using Parrallel Boost Graph Library to generate some graphs and
compute their pagerank. I found the PLOD algorithm and I'd like using
it with bidirected graphs.

But, the PLOD algorithm generates self_edges whereas I put
allow_self_edges to false.
I look at the code in plod_generator.hpp and found that the
next(directed_tag) function never uses allow_self_edges boolean ! I
think it's a bug...
I suggest replace:
      current.second = x(*gen);
with:
      do {
        current.second = x(*gen);
      } while (current.first == current.second && !allow_self_loops);

Regards,
--
Johan