Return the depth of each node in the dag.
Return the depth of each node in the dag. a node that has no dependencies has depth == 0 else it is max of parent + 1
Behavior is not defined if the graph is not a DAG (for now, it runs forever, may throw later)
Return the depth first enumeration of reachable nodes, NOT INCLUDING INPUT, unless it can be reached via neighbors
All the nodes we can reach from this start, including the initial nodes
Return a NeighborFn for the graph of reversed edges defined by this set of nodes and nf We avoid Sets which use hash-codes which may depend on addresses which are not stable from one run to the next.