+ j Rt^RIt^RIHtRR.t]!R4]!R4]P !RR7R R l444t]P !RRR 7R 4tR#) zTFunctions related to the Mycielski Operation and the Mycielskian family of graphs. N)not_implemented_for mycielskianmycielski_graphdirected multigraphT) returns_graphca\P!V4p\V4FpVP4oVP \S^S,44\ VP 44pVPV3RlV44VPV3RlV44VP^S,4VPV3Rl\S444K V#)aReturns the Mycielskian of a simple, undirected graph G The Mycielskian of graph preserves a graph's triangle free property while increasing the chromatic number by 1. The Mycielski Operation on a graph, :math:`G=(V, E)`, constructs a new graph with :math:`2|V| + 1` nodes and :math:`3|E| + |V|` edges. The construction is as follows: Let :math:`V = {0, ..., n-1}`. Construct another vertex set :math:`U = {n, ..., 2n}` and a vertex, `w`. Construct a new graph, `M`, with vertices :math:`U \bigcup V \bigcup w`. For edges, :math:`(u, v) \in E` add edges :math:`(u, v), (u, v + n)`, and :math:`(u + n, v)` to M. Finally, for all vertices :math:`u \in U`, add edge :math:`(u, w)` to M. The Mycielski Operation can be done multiple times by repeating the above process iteratively. More information can be found at https://en.wikipedia.org/wiki/Mycielskian Parameters ---------- G : graph A simple, undirected NetworkX graph iterations : int The number of iterations of the Mycielski operation to perform on G. Defaults to 1. Must be a non-negative integer. Returns ------- M : graph The Mycielskian of G after the specified number of iterations. Notes ----- Graph, node, and edge data are not necessarily propagated to the new graph. c3<<"TFwrWS,3xK R#5iN.0uvns& ^/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/generators/mycielski.py mycielskian..?s: !U sc3><"TFwrVS,V3xK R#5ir r r s& rrr@s: !a% sc3F<"TFqS,^S,3xK R#5i)Nr )r rrs& rrrBs:Aa%Qs!) nxconvert_node_labels_to_integersrangenumber_of_nodesadd_nodes_fromlistedgesadd_edges_fromadd_node)G iterationsMi old_edgesrs&& @rrr sZ **1-A :     q!a%)O  : :: : :: 1q5 :q:: H)graphsrcV^8d\P!R4hV^8Xd\P!^4#\\P!^4V^, 4#)a/Generator for the n_th Mycielski Graph. The Mycielski family of graphs is an infinite set of graphs. :math:`M_1` is the singleton graph, :math:`M_2` is two vertices with an edge, and, for :math:`i > 2`, :math:`M_i` is the Mycielskian of :math:`M_{i-1}`. More information can be found at http://mathworld.wolfram.com/MycielskiGraph.html Parameters ---------- n : int The desired Mycielski Graph. Returns ------- M : graph The n_th Mycielski Graph Notes ----- The first graph in the Mycielski sequence is the singleton graph. The Mycielskian of this graph is not the :math:`P_2` graph, but rather the :math:`P_2` graph with an extra, isolated vertex. The second Mycielski graph is the :math:`P_2` graph, so the first two are hard coded. The remaining graphs are generated using the Mycielski operation. zmust satisfy n >= 1)r NetworkXError empty_graphr path_graph)rs&rrrGsP@ 1u455Av~~a  2==+QU33r%)) __doc__networkxrnetworkx.utilsr__all__ _dispatchablerrr r%rr1sx . + ,Z \"%5 &#!5 pT2&43&4r%