659ebabe13dfebd9449c7eb50eafe108b47d8ab1,reframe/frontend/dependency.py,,toposort,#Any#,151

Before Change

        unvisited = [r]
        visited[r] = util.OrderedSet()
        while unvisited:
            node = unvisited.pop(0)
            adjacent = revgraph[node]
            unvisited += [n for n in adjacent if n not in visited]
            visited[r].add(node)

    // Combine all individual sequences into a single one

After Change

        while unvisited:
            // Next node is one whose all dependencies are visited
            node = None
            for n in unvisited:
                if test_deps[n] <= visited[r]:
                    node = n
                    break

            // If node is None, graph has a cycle and this is a bug; this
            // function assumes acyclic graphs only
            assert node is not None

            unvisited.remove(node)
            adjacent = rev_deps[node]

Instances