423bef1c42ff06214c3fc6f759e4b7da6a59309f,opt_einsum/paths.py,,optimal,#Any#Any#Any#Any#,8

Before Change

        comb_iter = []
        for x in range(len(input_sets) - iteration):
            for y in range(x + 1, len(input_sets) - iteration):
                comb_iter.append((x, y))

        for curr in full_results:
            cost, positions, remaining = curr
            for con in comb_iter:

After Change

        iter_results = []

        // Compute all unique pairs
        comb_iter = tuple(combinations(range(len(input_sets) - iteration), 2))

        for curr in full_results:
            cost, positions, remaining = curr

Instances