Note

This documents the development version of NetworkX. Documentation for the current release can be found here.

Maximal independent set

Algorithm to find a maximal (not maximum) independent set.

maximal_independent_set(G[, nodes, seed])

Returns a random maximal independent set guaranteed to contain a given set of nodes.