Re: [Boost-users] [Graph][parallel] Scale-free graph generator without self-loops

Subject: Re: [Boost-users] [Graph][parallel] Scale-free graph generator without self-loops
From: Borja Miñano (bminyano_at_[hidden])
Date: 2013-03-08 04:03:57

Hello Jeremiah,

I have been looking for information and I have seen there is a 
filtered_graph, maybe it is another option.
I don't understand very well how the filter_iterator remove the 
self-loops before creating the graph. Don't you refer after creating it?

Thank you

El 07/03/13 16:17, Jeremiah Willcock escribió:
> 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 mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users
>

-- 
Un saludo,
Borja Miñano
IAC3 - Universitat de les Illes Balears
ParcBit - Edifici 17 (Disset); Local D7
Cra. Valldemossa km. 7,4
E-07121 Palma de Mallorca. Balears. Spain.
Phone: [phone]