phylogenie 2.1.14__tar.gz → 2.1.16__tar.gz

{phylogenie-2.1.14 → phylogenie-2.1.16}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: phylogenie
-Version: 2.1.14
+Version: 2.1.16
 Summary: Generate phylogenetic datasets with minimal setup effort
 Author: Gabriele Marino
 Author-email: gabmarino.8601@gmail.com

{phylogenie-2.1.14 → phylogenie-2.1.16}/phylogenie/plot.py

@@ -6,7 +6,7 @@ import matplotlib.pyplot as plt
 from matplotlib.axes import Axes
 
 from phylogenie.tree import Tree
-from phylogenie.utils import get_node_depths
+from phylogenie.utils import get_node_depth_levels, get_node_depths
 
 
 class Coloring(str, Enum):
@@ -22,15 +22,14 @@ def plot_tree(
     coloring: str | Coloring | None = None,
     cmap: str | None = None,
     show_legend: bool = True,
-    x_feature: str | None = None,
 ) -> Axes:
     if ax is None:
         ax = plt.gca()
 
     xs = (
-        get_node_depths(tree)
-        if x_feature is None
-        else {node: node.get(x_feature) for node in tree}
+        get_node_depth_levels(tree)
+        if any(node.branch_length is None for node in tree)
+        else get_node_depths(tree)
     )
     ys = {node: i for i, node in enumerate(tree.inorder_traversal())}
 

{phylogenie-2.1.14 → phylogenie-2.1.16}/phylogenie/tree.py

@@ -1,4 +1,5 @@
-from collections.abc import Iterator
+from collections import deque
+from collections.abc import Callable, Iterator
 from typing import Any
 
 
@@ -55,6 +56,10 @@ class Tree:
             return 0
         return 1 + max(child.height_level for child in self.children)
 
+    @property
+    def n_leaves(self) -> int:
+        return len(self.get_leaves())
+
     def set(self, key: str, value: Any) -> None:
         self._features[key] = value
 
@@ -102,6 +107,13 @@ class Tree:
             yield from child.postorder_traversal()
         yield self
 
+    def breadth_first_traversal(self) -> Iterator["Tree"]:
+        queue: deque["Tree"] = deque([self])
+        while queue:
+            node = queue.popleft()
+            yield node
+            queue.extend(node.children)
+
     def get_node(self, name: str) -> "Tree":
         for node in self:
             if node.name == name:
@@ -114,10 +126,10 @@ class Tree:
     def get_leaves(self) -> tuple["Tree", ...]:
         return tuple(node for node in self if node.is_leaf())
 
-    def ladderize(self, feature: str) -> None:
-        self._children.sort(key=lambda x: x.get(feature))
+    def ladderize(self, criterion: Callable[["Tree"], Any]) -> None:
+        self._children.sort(key=criterion)
         for child in self.children:
-            child.ladderize(feature)
+            child.ladderize(criterion)
 
     def copy(self):
         new_tree = Tree(self.name, self.branch_length)

{phylogenie-2.1.14 → phylogenie-2.1.16}/pyproject.toml

@@ -1,6 +1,6 @@
 [tool.poetry]
 name = "phylogenie"
-version = "2.1.14"
+version = "2.1.16"
 description = "Generate phylogenetic datasets with minimal setup effort"
 authors = ["Gabriele Marino <gabmarino.8601@gmail.com>"]
 readme = "README.md"