Two DataTrees are considered isomorphic if the set of paths to their descendent nodes are the same. Nothing about the data in each node is checked. Isomorphism is a necessary condition for two trees to be used in a nodewise binary operation, such as ``tree1
(self, other: DataTree)
| 1512 | return DataVariables(self.to_dataset()) |
| 1513 | |
| 1514 | def isomorphic(self, other: DataTree) -> bool: |
| 1515 | """ |
| 1516 | Two DataTrees are considered isomorphic if the set of paths to their |
| 1517 | descendent nodes are the same. |
| 1518 | |
| 1519 | Nothing about the data in each node is checked. |
| 1520 | |
| 1521 | Isomorphism is a necessary condition for two trees to be used in a nodewise binary operation, |
| 1522 | such as ``tree1 + tree2``. |
| 1523 | |
| 1524 | Parameters |
| 1525 | ---------- |
| 1526 | other : DataTree |
| 1527 | The other tree object to compare to. |
| 1528 | |
| 1529 | See Also |
| 1530 | -------- |
| 1531 | DataTree.equals |
| 1532 | DataTree.identical |
| 1533 | """ |
| 1534 | return diff_treestructure(self, other) is None |
| 1535 | |
| 1536 | def equals(self, other: DataTree) -> bool: |
| 1537 | """ |