|
Search this API | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface EnterIntervalCalculator
This interface provides additional intervals in order to move from one partition cell into an
adjacent one.
To find a Path for an edge, the PathSearch algorithm moves from the current partition cell to
an adjacent partition cell. By default, the orthogonal interval shared by these two cells is used. Implementations
of this interface may be added to the PathSearch to calculate additional enter intervals that might
accumulate lower costs for entering the adjacent cell.
PartitionCell,
PathSearch.addAdditionalEnterIntervalCalculator(EnterIntervalCalculator)![]() |
![]() |
| Method Summary | |
|---|---|
void |
appendEnterIntervals(CellEntrance currentEntrance,
PartitionCell enteredCell,
OrthogonalInterval commonInterval,
java.util.List 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. |
| Method Detail |
|---|
void appendEnterIntervals(CellEntrance currentEntrance,
PartitionCell enteredCell,
OrthogonalInterval commonInterval,
java.util.List allEnterIntervals,
PathSearchContext context)
partition cell of the current CellEntrance to the neighboring
cell.
currentEntrance - the current CellEntrance that is exitedenteredCell - the neighboring cell that will be enteredcommonInterval - the common interval of the left and entered partition cellsallEnterIntervals - the list to which additional enter intervals have to be appendedcontext - the context of the path search
|
© Copyright 2000-2025, yWorks GmbH. All rights reserved. |
||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||