Path 1: 13 calls (0.87)

→ node FunctionDef (13)

6 run 8 not run

1def visitFunctionDef(self, node: nodes.FunctionDef) -> None:
2        if self.graph is not None:
3            # closure
4            pathnode = self._append_node(node)
5            self.tail = pathnode
6            self.dispatch_list(node.body)
7            bottom = f"{self._bottom_counter}"
8            self._bottom_counter += 1
9            self.graph.connect(self.tail, bottom)
10            self.graph.connect(node, bottom)
11            self.tail = bottom
12        else:
13            self.graph = PathGraph(node)
14            self.tail = node
15            self.dispatch_list(node.body)
16            self.graphs[f"{self.classname}{node.name}"] = self.graph
17            self.reset()
            

Path 2: 2 calls (0.13)

→ node FunctionDef (2)

9 run 5 not run

1def visitFunctionDef(self, node: nodes.FunctionDef) -> None:
2        if self.graph is not None:
3            # closure
4            pathnode = self._append_node(node)
5            self.tail = pathnode
6            self.dispatch_list(node.body)
7            bottom = f"{self._bottom_counter}"
8            self._bottom_counter += 1
9            self.graph.connect(self.tail, bottom)
10            self.graph.connect(node, bottom)
11            self.tail = bottom
12        else:
13            self.graph = PathGraph(node)
14            self.tail = node
15            self.dispatch_list(node.body)
16            self.graphs[f"{self.classname}{node.name}"] = self.graph
17            self.reset()