def get_independent_nodes(dag):
    """Get a list of all node in the graph with no dependencies."""
    nodes = set(dag.keys())
    dependent_nodes = set([node for downstream_nodes in dag.values() for node in downstream_nodes])
    return set(nodes - dependent_nodes)
def get_independent_nodes ( dag ) : nodes = set ( dag . keys ( ) ) dependent_nodes = set ( [ node for downstream_nodes in dag . values ( ) for node in downstream_nodes ] ) return set ( nodes - dependent_nodes )
Get a list of all node in the graph with no dependencies.