private Set<V> doUnblock(V v) {

		blockedSet.remove(v);
		setStatus(v, STATUS.WAITING);
		Set<V> set = blockedBackEdgesMap.get(v);
		return set;
	}
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