Method walk_dfs

quantmind/knowledge/_tree.py:66–74

Depth-first traversal starting at the root.

(self)

        node = self.nodes[node_id]
        return [self.nodes[c] for c in node.children_ids]

    def walk_dfs(self) -> Iterator[TreeNode]:
        """Depth-first traversal starting at the root."""
        stack: list[UUID] = [self.root_node_id]
        while stack:
            node_id = stack.pop()
            node = self.nodes[node_id]
            yield node
            # Reverse so children are visited in declared order.
            stack.extend(reversed(node.children_ids))

    def find_path(self, node_id: UUID) -> list[TreeNode]: