Re: [igraph] Representation of Bipartite Networks

[Gábor Csárdi]

Lorenzo, I don't know what is recommended. We don't have any special
layout algorithms for bipartite networks, AFAIK.

Maybe it is possible to work out something meaningful using positive
and negative edge weights in the Fruchterman-Reingold algorithm. My
idea would be to create the union of the original and a full graph. In
the full graph, vertices of different type would repulse each other
(negative weight on the edge) and vertices of the same type would
attract each other. Whether this gives anything meaningful, I have no
idea.

Maybe it is enough to simply use different vertex shapes for both vertex types.

Best,
Gabor

On Fri, Mar 5, 2010 at 3:57 PM, Lorenzo Isella <address@hidden> wrote:
> Dear All,
> I am actually dealing with bipartite networks.
> What is the best way (if there is any) to plot a bipartite network?
> Is there any recommended layout in igraph?
> Cheers
>
> Lorenzo
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>



-- 
Gabor Csardi <address@hidden>     UNIL DGM