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

An independent set is a set of nodes such that the subgraph
of G induced by these nodes contains no edges. A maximal
independent set is an independent set such that it is not possible
to add a new node and still get an independent set.

Parameters:

G (NetworkX graph)

nodes (list or iterable) – Nodes that must be part of the independent set. This set of nodes
must be independent.