(self, begin, end)
return networkx.all_simple_paths(self.graph, n_begin, n_end)
Get the possible (networkx) simple paths between two nodes or addresses
        corresponding to nodes.
        Input: addresses or node instances
        Return: a list of lists of nodes representing paths.
Get the possible (networkx) simple paths between two nodes or addresses
        corresponding to nodes.
        Input: addresses or node instances
        Return: a list of lists of nodes representing paths.
Get the possible ( networkx ) simple paths between two nodes or addresses corresponding to nodes . Input : addresses or node instances Return : a list of lists of nodes representing paths .
def _get_nx_paths(self, begin, end):
        """
        Get the possible (networkx) simple paths between two nodes or addresses
        corresponding to nodes.
        Input: addresses or node instances
        Return: a list of lists of nodes representing paths.
        """
        if type(begin) is int and type(end) is int:  # pylint:disable=unidiomatic-typecheck
            n_begin = self.get_any_node(begin)
            n_end = self.get_any_node(end)

        elif isinstance(begin, VFGNode) and isinstance(end, VFGNode):  # pylint:disable=unidiomatic-typecheck
            n_begin = begin
            n_end = end
        else:
            raise AngrVFGError("from and to should be of the same type")

        return networkx.all_simple_paths(self.graph, n_begin, n_end)
def _get_nx_paths ( self , begin , end ) : if type ( begin ) is int and type ( end ) is int : # pylint:disable=unidiomatic-typecheck n_begin = self . get_any_node ( begin ) n_end = self . get_any_node ( end ) elif isinstance ( begin , VFGNode ) and isinstance ( end , VFGNode ) : # pylint:disable=unidiomatic-typecheck n_begin = begin n_end = end else : raise AngrVFGError ( "from and to should be of the same type" ) return networkx . all_simple_paths ( self . graph , n_begin , n_end )