public boolean isTree() {
		return (treeEdges.size() == graph.numEdges());
	}
Return true iff the every edge is a tree edge. Will always be false
if the entire graph is not explored.
Ghidra/Framework/Generic/src/main/java/ghidra/util/graph/DepthFirstSearch.java