private void outputCircuit(Stack<Node> stack) throws CancelledException {
		List<V> path = new ArrayList<>();
		for (Node vv : stack) {
			path.add(vv.v);
		}
		setStatus(path, STATUS.IN_PATH);
		accumulator.add(path);

		monitor.checkCancelled(); // pause for listener
	}
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