ó |£*^c@sLdZdjddgƒZdgZddlZddlZdd„ZdS(s= Algorithm to find a maximal (not maximum) independent set. s s Leo Lopes s'Loïc Séguin-C. tmaximal_independent_setiÿÿÿÿNcCs1|s'ttj|jƒƒgƒ}n t|ƒ}|j|ƒsXtjd|ƒ‚ntjg|D]}t|j|ƒƒ^qeŒ}tj ||ƒr±tjd|ƒ‚nt |ƒ}t|jƒƒj |j|ƒƒ}xI|r,tjt |ƒƒ}|j |ƒ|j |j|ƒ|gƒqäW|S(saReturn 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. Returns ------- indep_nodes : list List of nodes that are part of a maximal independent set. Raises ------ NetworkXUnfeasible If the nodes in the provided list are not part of the graph or do not form an independent set, an exception is raised. Examples -------- >>> G = nx.path_graph(5) >>> nx.maximal_independent_set(G) # doctest: +SKIP [4, 0, 2] >>> nx.maximal_independent_set(G, [1]) # doctest: +SKIP [1, 3] Notes ----- This algorithm does not solve the maximum independent set problem. s$%s is not a subset of the nodes of Gs!%s is not an independent set of G(tsettrandomtchoicetnodestissubsettnxtNetworkXUnfeasibletuniont neighborst intersectiontlistt differencetappendtdifference_update(tGRtvR t indep_nodestavailable_nodestnode((sk/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/mis.pyRs")! 1 $  !( t__doc__tjoint __author__t__all__RtnetworkxRtNoneR(((sk/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/mis.pyts