private void unblock(V v) {
		blockedSet.remove(v);
		Set<V> set = blockedBackEdgesMap.get(v);
		if (set == null) {
			return;
		}
		for (V u : set) {
			if (blockedSet.contains(u)) {
				unblock(u);
			}
		}
		set.clear();
	}
Finds the circuits in the graph passed at construction time.

@param uniqueCircuits true signals to return only unique circuits, where no two 
       circuits will contain the same vertex
@param monitor the task monitor
@throws CancelledException if the monitor is cancelled
Ghidra/Framework/Graph/src/main/java/ghidra/graph/algo/JohnsonCircuitsAlgorithm.java