/**
* Find the next incoming vertex from another object (in vertical) from a node in a given
* direction
*
* @param vertex The starting vertex
* @param dir The direction in which to search
* @return The next incoming vertex
*/
public static @Nullable TmfVertex findIncoming(TmfVertex vertex, EdgeDirection dir) {
TmfVertex currentVertex = vertex;
while (true) {
TmfEdge incoming = currentVertex.getEdge(EdgeDirection.INCOMING_VERTICAL_EDGE);
if (incoming != null) {
return currentVertex;
}
TmfEdge edge = currentVertex.getEdge(dir);
if (edge == null || edge.getType() != TmfEdge.EdgeType.EPS) {
break;
}
currentVertex = TmfVertex.getNeighborFromEdge(edge, dir);
}
return null;
}
/**
* Copy link of type TYPE between nodes FROM and TO in the graph PATH. The return value is the
* tail node for the new path.
*
* @param criticalPath The graph on which to add the link
* @param graph The original graph on which to calculate critical path
* @param anchor The anchor vertex from the path graph
* @param from The origin vertex in the main graph
* @param to The destination vertex in the main graph
* @param ts The timestamp of the edge
* @param type The type of the edge to create
* @return The destination vertex in the path graph
*/
public TmfVertex copyLink(
TmfGraph criticalPath,
TmfGraph graph,
TmfVertex anchor,
TmfVertex from,
TmfVertex to,
long ts,
TmfEdge.EdgeType type) {
IGraphWorker parentFrom = graph.getParentOf(from);
IGraphWorker parentTo = graph.getParentOf(to);
if (parentTo == null) {
throw new NullPointerException();
}
TmfVertex tmp = new TmfVertex(ts);
criticalPath.add(parentTo, tmp);
if (parentFrom == parentTo) {
anchor.linkHorizontal(tmp).setType(type);
} else {
anchor.linkVertical(tmp).setType(type);
}
return tmp;
}