def _is_satisfied(self, haves, want, earliest):
        o = self.store[want]
        pending = collections.deque([o])
        while pending:
            commit = pending.popleft()
            if commit.id in haves:
                return True
            if commit.type_name != "commit":
                # non-commit wants are assumed to be satisfied
                continue
            for parent in commit.parents:
                parent_obj = self.store[parent]
                # TODO: handle parents with later commit times than children
                if parent_obj.commit_time >= earliest:
                    pending.append(parent_obj)
        return False
Returns the log likelihood of the given network.
dataset/ETHPy150Open natestedman/Observatory/observatory/lib/dulwich/server.py/ProtocolGraphWalker._is_satisfied--crossover with--dataset/ETHPy150Open abhik/pebl/src/pebl/prior.py/Prior.loglikelihood