public Vector allPathsContaining(Vertex v) {
		int i, maxsize = 0;
		Vector pathSet = new Vector();
		for (i = 0; i < paths.size(); i++) {
			Vector tmpPath = (Vector) paths.elementAt(i);
			if (tmpPath.contains(v)) {
				if (tmpPath.size() > maxsize) {
					maxsize = tmpPath.size();
					pathSet.add(0, tmpPath);
				}
				else {
					pathSet.add(paths.elementAt(i));
				}
			}
		}
		return pathSet;
	}
this returns all paths that contain v which we need to consider when
looking for the dominator of v.  It places the longest path as the
first element in the vector pathSet.
Ghidra/Framework/Generic/src/main/java/ghidra/util/graph/Dominator.java