public static <V, E extends GEdge<V>> void findPaths(GDirectedGraph<V, E> g, V start, V end,
			Accumulator<List<V>> accumulator, TimeoutTaskMonitor monitor)
			throws CancelledException, TimeoutException {

		FindPathsAlgorithm<V, E> algo = new IterativeFindPathsAlgorithm<>();
		algo.findPaths(g, start, end, accumulator, monitor);
	}
Finds all paths from <code>start</code> to <code>end</code> in the given graph.  <B>This version
of <code>findPaths()</code> takes a {@link TimeoutTaskMonitor}, which allows for the 
client to control the duration of work.</B>   This is useful for finding paths on very
large, dense graphs.

<P><B><U>Warning:</U></B> for large, dense graphs (those with many interconnected 
vertices) this algorithm could run indeterminately, possibly causing the JVM to 
run out of memory.

@param g the graph
@param start the start vertex
@param end the end vertex
@param accumulator the accumulator into which results will be placed
@param monitor the timeout task monitor
@throws CancelledException if the operation is cancelled
@throws TimeoutException if the operation passes the timeout period
Ghidra/Framework/Graph/src/main/java/ghidra/graph/GraphAlgorithms.java