~i( zSrSSKrSSKJrJr S/r\"S5\"S5\RSSj555rg) z= Algorithm to find a maximal (not maximum) independent set. N)not_implemented_forpy_random_statemaximal_independent_setdirectedc U(dUR[U551nO [U5nURU5(d[R "US35e[R "UVs/sHn[URU5PM sn6n[RXA5(a[R "US35e[U5n[UR55RUR U55nU(a_UR[U55nURU5 UR[URU5U/-5 U(aM_U$s snf)aReturns 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. seed : integer, random_state, or None (default) Indicator of random number generation state. See :ref:`Randomness`. 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. NetworkXNotImplemented If `G` is directed. 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. z" is not a subset of the nodes of Gz is not an independent set of G) choicelistsetissubsetnxNetworkXUnfeasibleunionadj intersectionnodes differenceappenddifference_update)Grseedv neighbors indep_nodesavailable_nodesnodes T/home/mande/repo/quber/.venv/lib/python3.13/site-packages/networkx/algorithms/mis.pyrr s'f T!W%&E  >>!  ##ug-O$PQQ 595aCaM59:I  ))##ug-L$MNNu+K!'')n// 0FGO {{4014 ))$quuT{*;tf*DE / :s2"E5)NN) __doc__networkxr networkx.utilsrr__all__ _dispatchablerrr%sN ? $ %Z ?!?r$