protected class SugiyamaOriginalPositionCalculator.IntermediateNode extends NodeWrapper
Modifier and Type | Field and Description |
---|---|
double |
currentPosition |
int |
siblingsToLeft |
int |
siblingsToRight |
Constructor and Description |
---|
IntermediateNode(Node wrappedNode,
java.util.List<? extends Node> siblings) |
addEdge, equals, getEdges, getMetaInformation, getOldPosition, getPosition, getValue, getWrappedNode, hashCode, removeEdge, setMetaInformation, setOldPosition, setPosition, setValue, toString
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
distance, distanceSquared, getEdgeForNeighbor, getIncomingEdges, getNeighbors, getOutgoingEdges, getPredecessors, getSuccessors, hasSuccessor, setOldPosition
public int siblingsToLeft
public int siblingsToRight
public double currentPosition
public void calculateBothSiblingCounts(java.util.List<? extends Node> siblings)
public double minimalDistanceFromLeftBorder(double minDistanceBetweenNodes)
public double minimalDistanceFromRightBorder(double minDistanceBetweenNodes)
public double minimalDistanceFromNode(SugiyamaOriginalPositionCalculator.IntermediateNode other, double minDistanceBetweenNodes)
public boolean isLeftOf(SugiyamaOriginalPositionCalculator.IntermediateNode other)
public int priorityUp()
public int priorityDown()
public double getCurrentPosition()
public void setCurrentPosition(double currentPosition)
public double desiredDownPosition(java.util.List<SugiyamaOriginalPositionCalculator.IntermediateNode> previousLevel)
public double desiredUpPosition(java.util.List<SugiyamaOriginalPositionCalculator.IntermediateNode> nextLevel)
public double desiredPosition(java.util.List<SugiyamaOriginalPositionCalculator.IntermediateNode> otherLevel, java.util.function.Predicate<SugiyamaOriginalPositionCalculator.IntermediateNode> filter)
public double closestValidPositionTo(double desiredPosition, SugiyamaOriginalPositionCalculator.IntermediateNode other, double minDistanceBetweenNodes)