h SrSSKrSSKr\R"S5r\R "S5S\R "S5S\R"S5S \R"5S 0r \R "S5S \R "S5S \R"S5S \R"5S\R"S5S0r \RRS\ R55S5r\RRS\ R!55S5r\RRS\ R55S5r\RRS\ R!55S5rg)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 + xGexpectedc\[R"U5RU5(degN)nxtutte_polynomialequalsr s \/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/tests/test_polynomials.pytest_tutte_polynomialrs$  q ! ( ( 2 22 2r c[R"U5n[R"X5n[R"U5n[R X-5R U5(deg)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)rrdisjoint_unionrsimplifyr)r t_gHt_hs rtest_tutte_polynomial_disjointr sV  a C !A  a C >>#) $ + +C 0 00 0rc\[R"U5RU5(degr )rchromatic_polynomialrr s rtest_chromatic_polynomialr+s$ " "1 % , ,X 6 66 6rc[R"U5n[R"X5n[R"U5n[R X-5R U5(deg)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)r x_grx_hs r"test_chromatic_polynomial_disjointr!0sV ! !! $C !A ! !! $C >>#) $ + +C 0 00 0r)__doc__pytestnetworkxr importorskiprcomplete_graph cycle_graph diamond_graph_test_tutte_graphs path_graph_test_chromatic_graphsmark parametrizeitemsrkeysrrr!rrr1sG G$ a#aMNN13> a#a9NN1@6MM!; *,>,D,D,FG3H305578191*,B,H,H,JK7L7499;<1=1r