Re: [igraph] Maximum_independent_vertex_sets() function question

[Tamas Nepusz]

Hi,

Unfortunately it's not possible yet and it would need significant modifications in the underlying C layer. Right now the core igraph library has a function that takes a graph and puts all the independent sets in a vector; this is then translated back to Python lists. The C core would require a function instead that takes a graph and a callback function instead, and it would then call the callback function for each found independent vertex set.

All the best,

Tamás

On Mon, 25 Mar 2019 at 22:51, Jesse Alloy <address@hidden> wrote:

Hi,

Is there an easy way to find one instance of an independent set of a certain size in a graph (using the Python implementation)?

largest_independent_vertex_sets() gives me all of them, but I know what the largest size is in my problem, I just need to find one of them. If I find them all, then the algorithm takes too long. Breaking after the first instance might save me enough time to make this implementation usable.

Thank you for the help. 
_______________________________________________
igraph-help mailing list
address@hidden
https://lists.nongnu.org/mailman/listinfo/igraph-help