Path 1: 122 calls (0.99)

→ node Pass (36) If (35) Return (18) Expr (12) Assign (6) For (5) With (3) FunctionDef (2) TryExcept (2) While (1)

↩ return Pass (36) If (35) Return (18) Expr (12) Assign (6) For (5) With (3) FunctionDef (2) TryExcept (2) While (1)

4 run 1 not run

1def _append_node(self, node: _AppendableNodeT) -> _AppendableNodeT | None:
2        if not self.tail or not self.graph:
3            return None
4        self.graph.connect(self.tail, node)
5        self.tail = node
6        return node
            

Path 2: 1 calls (0.01)

→ node Assign (1)

↩ return None (1)

2 run 3 not run

1def _append_node(self, node: _AppendableNodeT) -> _AppendableNodeT | None:
2        if not self.tail or not self.graph:
3            return None
4        self.graph.connect(self.tail, node)
5        self.tail = node
6        return node