+ jcrRt^RIt^RIHtR.t]!^4]P !RRR7RRl44tR#)aGenerators for cographs A cograph is a graph containing no path on four vertices. Cographs or $P_4$-free graphs can be obtained from a single vertex by disjoint union and complementation operations. References ---------- .. [0] D.G. Corneil, H. Lerchs, L.Stewart Burlingham, "Complement reducible graphs", Discrete Applied Mathematics, Volume 3, Issue 3, 1981, Pages 163-174, ISSN 0166-218X. N)py_random_staterandom_cographT)graphs returns_graphc8a\P!^4o\V4Fsp\P!SP 4V3Rl4pVP ^^4^8Xd\P !SV4oK\\P!SV4oKu S#)aReturns a random cograph with $2 ^ n$ nodes. A cograph is a graph containing no path on four vertices. Cographs or $P_4$-free graphs can be obtained from a single vertex by disjoint union and complementation operations. This generator starts off from a single vertex and performs disjoint union and full join operations on itself. The decision on which operation will take place is random. Parameters ---------- n : int The order of the cograph. seed : integer, random_state, or None (default) Indicator of random number generation state. See :ref:`Randomness`. Returns ------- G : A random graph containing no path on four vertices. See Also -------- full_join union References ---------- .. [1] D.G. Corneil, H. Lerchs, L.Stewart Burlingham, "Complement reducible graphs", Discrete Applied Mathematics, Volume 3, Issue 3, 1981, Pages 163-174, ISSN 0166-218X. c(<V\S4,#N)len)xRs&]/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/generators/cographs.py random_cograph..=s !c!f*)nx empty_graphrange relabel_nodescopyrandint full_joindisjoint_union)nseediRRr s&& @r rrswJ qA 1X   affh(< = <<1  " Q#A!!!R(A  Hrr)__doc__networkxrnetworkx.utilsr__all__ _dispatchablerrr r"sH *  T2- 3- r