利用有向无环图DAG实现简单的任务依赖调度

from concurrent.futures import ThreadPoolExecutor
from dag import DAG
import time


class Scheduler:
    def __init__(self, dag):
        self.dag = dag
    def run_dag(self):
        while not self.done():
            runs = self.should_run()
            for run in runs:
                get_run(run)()
            time.sleep(1)
    def done(self, runs=None):
        if not runs:
            runs = self.dag.topological_sort()
        return all(get_run(run).done()=='done' for run in runs)
    def should_run(self):
        ret = []
        all_nodes = self.dag.topological_sort()
        for node in all_nodes:
            if get_run(node).done() == "pending" and (not self.dag.predecessors(node) or self.done(self.dag.predecessors(node))):
                ret.append(node)
        return ret

class MyDAG(DAG):
    def __init__(self, executor):
        super().__init__()