Some nodes are unreachable in the graph either by traversing from the input nodes to from the output nodes. Because they are not dependent, they have no impact on the produced output and can be pruned without causing any change to the declared behavior of the graph.