+ j Rt^RIt^RIt]P!R4t]P !^4R]P !^4R]P!^4R]P!4R/t ]P !^4R]P !^4R]P!^4R ]P!4R ]P!^4R /t ]PPR] P44R 4t]PPR ] P!44R4t]PPR] P44R4t]PPR ] P!44R4tR#)zAUnit tests for the :mod:`networkx.algorithms.polynomials` module.Nsympy1z1x**3 + 3*x**2 + 4*x*y + 2*x + y**3 + 3*y**2 + 2*yzx**4 + x**3 + x**2 + x + yz$x**3 + 2*x**2 + 2*x*y + x + y**2 + yxzx**4 - 6*x**3 + 11*x**2 - 6*xz'x**5 - 5*x**4 + 10*x**3 - 10*x**2 + 4*xzx**4 - 5*x**3 + 8*x**2 - 4*xz#x**5 - 4*x**4 + 6*x**3 - 4*x**2 + xGc`\P!V4PV4'gQhR#N)nxtutte_polynomialequalsrexpecteds&&k/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/algorithms/tests/test_polynomials.pytest_tutte_polynomialrs$  q ! ( ( 2 22 2c\P!V4p\P!W4p\P!V4p\P W,4P V4'gQhR#)zTutte polynomial factors into the Tutte polynomials of its components. Verify this property with the disjoint union of two copies of the input graph. N)rr disjoint_unionrsimplifyr )rt_gHt_hs& r test_tutte_polynomial_disjointr sV  a C !A  a C >>#) $ + +C 0 00 0rc`\P!V4PV4'gQhR#r)rchromatic_polynomialr r s&&r test_chromatic_polynomialr+s$ " "1 % , ,X 6 66 6rc\P!V4p\P!W4p\P!V4p\P W,4P V4'gQhR#)zChromatic polynomial factors into the Chromatic polynomials of its components. Verify this property with the disjoint union of two copies of the input graph. N)rrrrrr )rx_grx_hs& r "test_chromatic_polynomial_disjointr0sV ! !! $C !A ! !! $C >>#) $ + +C 0 00 0rr )__doc__pytestnetworkxr importorskiprcomplete_graph cycle_graph diamond_graph_test_tutte_graphs path_graph_test_chromatic_graphsmark parametrizeitemsrkeysrrrrr r-sG G$ a#aMNN13> a#a9NN1@6MM!; *,>,D,D,FG3H305578191*,B,H,H,JK7L7499;<1=1r