[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [igraph] working with bipartite graphs

From: Tamás Nepusz
Subject: Re: [igraph] working with bipartite graphs
Date: Fri, 16 Aug 2013 12:22:39 +0200

> Would it not be possible to have such a technique embedded at the lowest 
> levels so that I am only returned networks where there is >1 weight to the 
> edge? It might require a different algorithm to optimize, but it would 
> certain mean significantly less edges in the resulting graphs. 
I took a quick look at the code and I think it would be possible to implement 
such an optimization in the lowest level. Feel free to file a feature request 
at https://github.com/igraph/igraph/issues and we'll pick it up eventually if 
more people seem to be demanding it.

All the best,

reply via email to

[Prev in Thread] Current Thread [Next in Thread]