private void setStatus(V v, STATUS s) {
		if (blockedSet.contains(v) && s == STATUS.WAITING) {
			listener.statusChanged(v, STATUS.BLOCKED);
		}
		else {
			listener.statusChanged(v, s);
		}
	}
Finds all paths between two vertices for a given graph.

<P>Note: this algorithm is based on the {@link JohnsonCircuitsAlgorithm}, modified to be
iterative instead of recursive. 

@param <V> the vertex type
@param <E> the edge type
Ghidra/Framework/Graph/src/main/java/ghidra/graph/algo/IterativeFindPathsAlgorithm.java