Uses of Class
com.yworks.yfiles.layout.router.polyline.PartitionCell

Packages that use PartitionCell

Package	Description
com.yworks.yfiles.layout.router.polyline	Provides classes and interfaces for automatic polyline routing of the edges of a graph.

Uses of PartitionCell in com.yworks.yfiles.layout.router.polyline

Methods in com.yworks.yfiles.layout.router.polyline that return PartitionCell

Modifier and Type	Method and Description
PartitionCell	EdgeCellInfo.getCell() Gets the partition cell within which the edge is routed.
PartitionCell	CellSegmentInfo.getCell() Gets the partition cell within which this part of the edge segment lies.
PartitionCell	CellEntrance.getCell() Gets the partition cell of this CellEntrance instance.
PartitionCell	PathSearchContext.getCombinedSourceCell() Gets an artificial partition cell with the size of the bounding box of all source cells of the current edge.
PartitionCell	PathSearchContext.getCombinedTargetCell() Gets an artificial partition cell with the size of the bounding box of all target cells of the current edge.
PartitionCell	PathSearchContext.getSourceCell(int index) Returns the source cell with the given index in the list of all cells that are covered by the source node of the current edge.
PartitionCell	PathSearchContext.getTargetCell(int index) Returns the target cell with the given index in the list of all cells that are covered by the target node of the current edge.

Methods in com.yworks.yfiles.layout.router.polyline with parameters of type PartitionCell

Modifier and Type	Method and Description
void	PathSearchContext.addSourceCell(PartitionCell cell) Adds an additional source cell of the current edge if it is not already contained in the list of source cells.
void	PathSearchContext.addTargetCell(PartitionCell cell) Adds an additional target cell of the current edge if it is not already contained in the list of target cells.
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 void	DynamicObstacleDecomposition.fireCreateCellEvent(PartitionCell createdCell) Notifies all registered dynamic decomposition listeners that the given partition cell has been created.
protected void	DynamicObstacleDecomposition.fireFinalizeCellEvent(PartitionCell finalizedCell) Notifies all registered dynamic decomposition listeners that the given partition cell has been finalized.
protected void	DynamicObstacleDecomposition.fireSubdividedEvent(PartitionCell cell, List<Object> subCells) Notifies all registered dynamic decomposition listeners of a subdivision of a given partition cell.
List<Object>	IPartition.getNeighbors(PartitionCell cell) Returns a list of all PartitionCells that are neighbors of the given cell, i.e., those cells that have a common border segment with the given cell.
List<Object>	GraphPartition.getNeighbors(PartitionCell cell) Returns a list of all PartitionCells that are neighbors of the given cell, i.e., those cells that have a common border segment with the given cell.
List<Object>	DynamicObstacleDecomposition.getNeighbors(PartitionCell cell) Returns the neighbor partition cells of the given cell.
List<Object>	GraphPartition.getNodes(PartitionCell cell) Returns a list of all Nodes whose bounds intersect or cover the bounds of the given cell.
List<Object>	IObstaclePartition.getObstacles(PartitionCell cell) Returns all Obstacles that cover the given PartitionCell.
List<Object>	GraphPartition.getObstacles(PartitionCell cell) Returns all Obstacles covering the given PartitionCell by delegating to the corresponding method of the inner partition.
List<Object>	DynamicObstacleDecomposition.getObstacles(PartitionCell cell) Returns all Obstacles that cover the given partition cell.
protected void	PathSearch.handleNeighbor(CellEntrance currentEntrance, PartitionCell neighborCell, PathSearchContext context) Adds CellEntrances for every interval through which the neighboring cell can be entered from the current entrance to the queue.
boolean	PathSearchContext.isSourceCell(PartitionCell cell) Determines whether or not the given cell is a source cell of the current edge.
boolean	PathSearchContext.isTargetCell(PartitionCell cell) Determines whether or not the given cell is a target cell of the current edge.
void	IDecompositionListener.onCellCreated(PartitionCell createdCell) Callback after the new given PartitionCell has been created.
void	GraphPartitionExtensionAdapter.onCellCreated(PartitionCell createdCell)
void	GraphPartition.onCellCreated(PartitionCell createdCell) Re-dispatches the event of the creation of a new PartitionCell to all registered IDecompositionListeners.
void	IDecompositionListener.onCellFinalized(PartitionCell finalizedCell) Callback after the given PartitionCell has been finalized and won't be further subdivided.
void	GraphPartitionExtensionAdapter.onCellFinalized(PartitionCell finalizedCell)
void	GraphPartition.onCellFinalized(PartitionCell finalizedCell) Re-dispatches the event of having completed the process of subdivisions of a given PartitionCell to all registered IDecompositionListeners.
void	IDecompositionListener.onCellSubdivided(PartitionCell cell, List<Object> subCells) Callback after the given PartitionCell has been subdivided into several sub-cells.
void	GraphPartitionExtensionAdapter.onCellSubdivided(PartitionCell cell, List<Object> subCells)
void	GraphPartition.onCellSubdivided(PartitionCell cell, List<Object> subCells) Re-dispatches the event of the subdivision of a given PartitionCell into several sub-cells to all registered IDecompositionListeners.

Constructors in com.yworks.yfiles.layout.router.polyline with parameters of type PartitionCell

Constructor and Description
CellEntrance(PartitionCell cell) Creates a new CellEntrance instance for a given PartitionCell.
CellSegmentInfo(Edge edge, int segmentIndex, Direction direction, Interval locationRange, Interval minExtension, Interval maxExtension, PartitionCell cell) Creates a new CellSegmentInfo instance.
EdgeCellInfo(Edge edge, PartitionCell cell, OrthogonalInterval enterInterval, OrthogonalInterval exitInterval, Direction enterDirection, Direction exitDirection, int enterSegmentNo) Creates a new EdgeCellInfo instance.