7 Mar
2013
7 Mar
'13
3:17 p.m.
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