public GraphPath<V> getCommonStartPath(GraphPath<V> other) {
		int n = Math.min(size(), other.size());
		for (int i = 0; i < n; i++) {
			if (!get(i).equals(other.get(i))) {
				return subPath(0, i);
			}
		}
		return subPath(0, n);
	}
Return all vertices that two GraphPaths have in common. For example if you have
a-b-c-d-e-f and a-b-c-d-k-l-z, the common start path will be a-b-c-d. If there is no common
start path, an empty GraphPath object is returned.

@param other the other GraphPath to get the common start path of
@return a new GraphPath object containing the common start path vertices
Ghidra/Framework/Graph/src/main/java/ghidra/graph/GraphPath.java