class GraphAlgorithms {

	public static <V, E extends GEdge<V>> GDirectedGraph<V, GEdge<V>> findDominanceTree(
			GDirectedGraph<V, E> g, TaskMonitor monitor) throws CancelledException {
		ChkDominanceAlgorithm<V, E> algorithm = new ChkDominanceAlgorithm<>(g, monitor);
		return algorithm.getDominanceTree();
	}

	private  GraphAlgorithms();

}