class GraphAlgorithms {

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

		IterativeFindPathsAlgorithm<V, E> algo = new IterativeFindPathsAlgorithm<>();
		algo.findPaths(g, start, end, accumulator, monitor);
	}

	private  GraphAlgorithms();

}