Have I correctly understood Kedro to be aimed at being a fairly generic computational graph, akin to Dask in that respect? It's from that perspective that I am asking; you could conceivably skip entire sub-graphs if ie an @idempotent decorator was used.