diff env/lib/python3.9/site-packages/networkx/algorithms/tree/tests/test_operations.py @ 0:4f3585e2f14b draft default tip

"planemo upload commit 60cee0fc7c0cda8592644e1aad72851dec82c959"

--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/env/lib/python3.9/site-packages/networkx/algorithms/tree/tests/test_operations.py	Mon Mar 22 18:12:50 2021 +0000
@@ -0,0 +1,38 @@
+"""Unit tests for the :mod:`networkx.algorithms.tree.operations` module.
+
+"""
+
+import networkx as nx
+from networkx.testing import assert_nodes_equal
+from networkx.testing import assert_edges_equal
+
+
+class TestJoin:
+    """Unit tests for the :func:`networkx.tree.join` function."""
+
+    def test_empty_sequence(self):
+        """Tests that joining the empty sequence results in the tree
+        with one node.
+
+        """
+        T = nx.join([])
+        assert len(T) == 1
+        assert T.number_of_edges() == 0
+
+    def test_single(self):
+        """Tests that joining just one tree yields a tree with one more
+        node.
+
+        """
+        T = nx.empty_graph(1)
+        actual = nx.join([(T, 0)])
+        expected = nx.path_graph(2)
+        assert_nodes_equal(list(expected), list(actual))
+        assert_edges_equal(list(expected.edges()), list(actual.edges()))
+
+    def test_basic(self):
+        """Tests for joining multiple subtrees at a root node."""
+        trees = [(nx.full_rary_tree(2, 2 ** 2 - 1), 0) for i in range(2)]
+        actual = nx.join(trees)
+        expected = nx.full_rary_tree(2, 2 ** 3 - 1)
+        assert nx.is_isomorphic(actual, expected)