def _computeRestrictedGraph(self, objectId, dependencyGraph):
        """Compute the subgraph of nodes reachable from `objectId`"""
        tr = dict()

        stack = [objectId]
        visited = set()

        while stack:
            toVisit = stack.pop()
            if visited not in toVisit:
                tr[toVisit] = dependencyGraph[toVisit]
                stack.extend(dependencyGraph[toVisit])
                visited.add(toVisit)

        return tr
dataset/ETHPy150Open ufora/ufora/ufora/FORA/python/PurePython/Converter.py/Converter._computeRestrictedGraph/swapped operands of `not in`