Package | Description |
---|---|
com.yworks.yfiles.layout.router.polyline |
Provides classes and interfaces for automatic polyline routing of the edges of a graph.
|
Modifier and Type | Method and Description |
---|---|
CellEntrance |
Path.getEntrance(int position)
Returns the
CellEntrance at the given position of this path. |
CellEntrance |
CellEntrance.getPreviousEntrance()
Gets the previous
CellEntrance along the path that was traversed in order to reach the cell . |
Modifier and Type | Method and Description |
---|---|
void |
IEnterIntervalCalculator.appendEnterIntervals(CellEntrance currentEntrance,
PartitionCell enteredCell,
OrthogonalInterval commonInterval,
List<Object> allEnterIntervals,
PathSearchContext context)
Appends additional enter intervals to the given list of enter intervals for moving from the
partition cell
of the current CellEntrance to the neighboring cell. |
protected void |
PathSearch.calculateCosts(CellEntrance currentEntrance,
PartitionCell enteredCell,
OrthogonalInterval[] enterIntervals,
EdgeCellInfo[] lastEdgeCellInfos,
PathSearchContext context,
double[] costs,
double[] maxAllowedCosts)
Calculates the costs for moving from the current
CellEntrance to the neighboring PartitionCell using
different enter intervals. |
protected double |
PathSearchExtension.calculateCosts(CellEntrance currentEntrance,
PartitionCell enteredCell,
OrthogonalInterval enterInterval,
EdgeCellInfo edgeCellInfo,
double maxAllowedCosts)
Calculates the costs for entering the given
PartitionCell via the given enter OrthogonalInterval . |
protected double |
PathSearchExtension.calculateHeuristicCosts(CellEntrance entrance)
Calculates the heuristic costs for the given
CellEntrance that describe the minimal costs that will arise to
finish the path if the given cell entrance is used as next step. |
protected double |
PathSearch.calculateHeuristicCosts(CellEntrance entrance,
PathSearchContext context)
Returns the estimated costs for the rest of the path when using the given
CellEntrance for the next step in the
path search. |
protected double |
PathSearchExtension.calculateStartEntranceCost(CellEntrance startEntrance)
Returns the cost for starting the path in the given entrance.
|
EdgeCellInfo |
EdgeInfo.getEdgeCellInfo(CellEntrance entrance)
Returns the
EdgeCellInfo of the given CellEntrance in the path. |
protected void |
PathSearch.handleNeighbor(CellEntrance currentEntrance,
PartitionCell neighborCell,
PathSearchContext context)
Adds
CellEntrance s for every interval through which the neighboring cell can be entered from the current entrance
to the queue. |
protected boolean |
PathSearchExtension.isValidTargetEntrance(CellEntrance entrance)
Determines whether or not this extension considers the given
CellEntrance as a valid target entrance, i.e., the
path may end with the given entrance. |
int |
Path.positionOf(CellEntrance entrance)
Returns the position of the first occurrence of the given
CellEntrance in this path, or -1 if this path
does not contain this CellEntrance . |
void |
Path.setEntrance(int position,
CellEntrance entrance)
Replaces the
CellEntrance at the given position of this path with the given CellEntrance . |
void |
CellEntrance.setPreviousEntrance(CellEntrance value)
Sets the previous
CellEntrance along the path that was traversed in order to reach the cell . |
Constructor and Description |
---|
CellEntrance(CellEntrance other)
Creates a new
CellEntrance instance that is a copy of a given other CellEntrance . |