Re: [igraph] Folding a network

[Tamás Nepusz]

Hi, 

If nodes of class 1 are only allowed to connect to nodes of class 2 and vice 
versa, then igraph implements this; it is called "bipartite projection" 
(igraph_bipartite_projection in C, bipartite.projection in R, 
Graph.bipartite_projection in Python). 

-- 
T.


On Monday, 21 May 2012 at 13:07, Sub Szabolcs Feczak wrote:

> Hi,
> 
> Im looking to see if it is "easy" enough to implement folding a network in 
> igraph.
> What folding is basically you have two node classes (red box and blue circles)
> and you identify the links between the first class entities through the 
> second class
> entities.If the links are binary, the result network link weights are the 
> number of shared
> entities.The result network does not contain the second node class. 
> ORA provides this functionality 
> http://www.casos.cs.cmu.edu/projects/ora/software.php
> but I need to process a fair number of networks, would be nice if I could 
> automate it
> and add my network measure calculations to the process.
> 
> 
> 
> 
> 
> 
> -- 
> Cheers
> 
> Sub
> 
> _______________________________________________
> igraph-help mailing list
> address@hidden (mailto:address@hidden)
> https://lists.nongnu.org/mailman/listinfo/igraph-help