def isdag(d, keys):
 return (not getcycle(d, keys))

def isdag ( d , keys ) : return ( not getcycle ( d , keys ) )
does dask form a directed acyclic graph when calculating keys? keys may be a single key or list of keys .