Re: [igraph] edge weights bipartite projection

[Moses Boudourides]

Gábor,

Let me ask something which is irrelevant to this thread and I won't be
surprised if you tell me that it is already taken care in igraph (in
which case I'll be grateful if you could tell me exactly how - because
I'm extremely lazy when I come to searching into manuals). This is
what I would like to know:

When projecting a bipartite graph, is it possible instead of taking
the number of 2-paths between two vertices to get explicitly the set
of all such 2-paths? Of course, this amounts to getting a list of
vertices of mode B establishing the 2-paths for any pair of vertices
of mode A.

--Moses

On Fri, Oct 19, 2012 at 4:30 PM, Gábor Csárdi <address@hidden> wrote:
> On Fri, Oct 19, 2012 at 8:36 AM, Florian Umlauf (CRIE)
> <address@hidden> wrote:
> [...]
>> I am working with a bipartite weighted network.  So every edge has a weight.
>> When I use the bipartite.projection() the old weights gets lost and the
>> bipartite.projection() return a weight where it sums up the number of
>> alternative connections.
>
> That is the default behavior, but you can customize it, see
> ?attribute.combination for details.
>
>> Is there a way to hold the old weights and sum them up for the projection?
>
> I am not sure what you mean by this. Isn't this what is happening now
> by default? Can you give a small example for what you want?
>
> Thanks,
> Gabor
>
>> Thank everyone for your help
>>
>> Florian
>>
>>
>>
>>
>> _______________________________________________
>> igraph-help mailing list
>> address@hidden
>> https://lists.nongnu.org/mailman/listinfo/igraph-help
>>
>
>
>
> --
> Gabor Csardi <address@hidden>     MTA KFKI RMKI
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help