(self)
return g
Get a local transition graph. A local transition graph is a transition graph that only contains nodes that
        belong to the current function. All edges, except for the edges going out from the current function or coming
        from outside the current function, are included.

        The generated graph is cached in self._local_transition_graph.

        :return:    A local transition graph.
        :rtype:     networkx.DiGraph
Get a local transition graph. A local transition graph is a transition graph that only contains nodes that
        belong to the current function. All edges, except for the edges going out from the current function or coming
        from outside the current function, are included.
Get a local transition graph . A local transition graph is a transition graph that only contains nodes that belong to the current function . All edges except for the edges going out from the current function or coming from outside the current function are included .
def graph(self):
        """
        Get a local transition graph. A local transition graph is a transition graph that only contains nodes that
        belong to the current function. All edges, except for the edges going out from the current function or coming
        from outside the current function, are included.

        The generated graph is cached in self._local_transition_graph.

        :return:    A local transition graph.
        :rtype:     networkx.DiGraph
        """

        if self._local_transition_graph is not None:
            return self._local_transition_graph

        g = networkx.DiGraph()
        if self.startpoint is not None:
            g.add_node(self.startpoint)
        for block in self._local_blocks.values():
            g.add_node(block)
        for src, dst, data in self.transition_graph.edges(data=True):
            if 'type' in data:
                if data['type'] in ('transition', 'exception') and ('outside' not in data or data['outside'] is False):
                    g.add_edge(src, dst, **data)
                elif data['type'] == 'fake_return' and 'confirmed' in data and \
                        ('outside' not in data or data['outside'] is False):
                    g.add_edge(src, dst, **data)

        self._local_transition_graph = g

        return g
def graph ( self ) : if self . _local_transition_graph is not None : return self . _local_transition_graph g = networkx . DiGraph ( ) if self . startpoint is not None : g . add_node ( self . startpoint ) for block in self . _local_blocks . values ( ) : g . add_node ( block ) for src , dst , data in self . transition_graph . edges ( data = True ) : if 'type' in data : if data [ 'type' ] in ( 'transition' , 'exception' ) and ( 'outside' not in data or data [ 'outside' ] is False ) : g . add_edge ( src , dst , * * data ) elif data [ 'type' ] == 'fake_return' and 'confirmed' in data and ( 'outside' not in data or data [ 'outside' ] is False ) : g . add_edge ( src , dst , * * data ) self . _local_transition_graph = g return g