Boost logo

Boost Users :

Subject: Re: [Boost-users] [Graph][parallel] Scale-free graph generator without self-loops
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2013-03-07 10:17:40


On Thu, 7 Mar 2013, bminano wrote:

> Hello,
>
> Does anyone knows if there is possible to generate a scale-free graph that
> does not generate self-loops (edges with the same vertex for source and
> target)?
> I am using the unique_rmat_iterator, but it generates some self-loops. I
> could remove them, but for the graph remains inconsistent because of a bug.
>
> I will apreciate your help.

One option would be to use a filter_iterator from Boost.Iterator to remove
the self-loops before you create the graph.

-- Jeremiah Willcock


Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net