private V findRoot() {
		V theRoot = unifySources(mutableGraph, navigator);
		unifySinks(mutableGraph, navigator);
		return theRoot;
	}
Constructor.

@param g the graph
@param monitor the monitor
@throws CancelledException if the algorithm is cancelled
@throws IllegalArgumentException if there are no source vertices in the graph
Ghidra/Framework/Graph/src/main/java/ghidra/graph/algo/ChkDominanceAlgorithm.java