void setDone() {
			if (found) {
				setParentFound();
			}
			else {
				// block back edges
				for (E e : getOutEdges(v)) {
					V u = e.getEnd();
					blockBackEdge(u, v);
				}
				setStatus(v, STATUS.BLOCKED);
			}
		}
Simple class to maintain a relationship between a given node and its children that need
processing.  It also knows if it has been found in a path from start to end.
Ghidra/Framework/Graph/src/main/java/ghidra/graph/algo/IterativeFindPathsAlgorithm.java