Maximal independent setΒΆ
Algorithm to find a maximal (not maximum) independent set.
maximal_independent_set (G[, nodes]) |
Return a random maximal independent set guaranteed to contain a given set of nodes. |
Warning
This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
Algorithm to find a maximal (not maximum) independent set.
maximal_independent_set (G[, nodes]) |
Return a random maximal independent set guaranteed to contain a given set of nodes. |