Method _has_self_loop

workflow/cycle_manager.py:90–95

Check if a node has a self-loop.

(self, node_id: str, nodes: Dict[str, Node])

        return self.cycles

    def _has_self_loop(self, node_id: str, nodes: Dict[str, Node]) -> bool:
        """Check if a node has a self-loop."""
        node = nodes.get(node_id)
        if not node:
            return False
        return any(edge_link.target.id == node_id for edge_link in node.iter_outgoing_edges())

    def _strong_connect(self, node_id: str, nodes: Dict[str, Node]) -> None:
        """Recursive part of Tarjan's algorithm."""