Maximum subgraph

Question

I am currently looking at implementing the maximum McGregor subgraph in Python, but I cannot find one already implemented.

I found an algorithm implemented as part of the Boost C ++ libraries, but Python bindings are missing.

Does this seem a little strange? Is this the correct algorithm? Are there libraries that perform this task?

Answer 1

Check the network packet; I'm not sure if its networkx.algorithms.mis.maximal_independent_set is the same as McGregor, but if you work on networks, networkx is a useful package.

http://networkx.lanl.gov/index.html