Uses of Package
com.yworks.yfiles.layout.router.polyline

Packages that use com.yworks.yfiles.layout.router.polyline

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

Classes in com.yworks.yfiles.layout.router.polyline used by com.yworks.yfiles.layout

Class and Description
EdgeRouter This edge routing algorithm applies polyline routes to the edges of the graph.

Classes in com.yworks.yfiles.layout.router.polyline used by com.yworks.yfiles.layout.router.polyline

Class and Description
AbstractSegmentInfo This class stores location information for orthogonal edge segments.
Alignment
CellEntrance This class describes the location and the direction from which a given partition cell has been entered during a path search.
CellSegmentInfo This class stores information about the part of an edge segment that lies inside a specified partition cell.
Channel This class describes a channel, i.e., a set of vertical or horizontal edge segments whose locations depend on each other.
ChannelBasedPathRouting This class routes edges using their pre-calculated Path information.
DynamicObstacleDecomposition This class describes an IObstaclePartition that decomposes its area dynamically.
EdgeCellInfo This class encapsulates the information that determines the route of a specific edge within a specific partition cell.
EdgeInfo This class encapsulates the information required to route an edge with a path routing algorithm.
EdgeLayoutDescriptor This class is used by EdgeRouter to provide routing details for the edges of the graph.
EdgeRouter This edge routing algorithm applies polyline routes to the edges of the graph.
GraphPartition A GraphPartition partitions the bounding box of a graph into rectangles using the graph elements as Obstacles.
Grid This class provides support for routing edges on equidistant grid lines.
IDecompositionListener This interface is implemented by classes that require to be notified of changes in IPartitions.
IDynamicDecomposition This interface should be implemented by classes that dispatch notifications about changes in IPartitions.
IEnterIntervalCalculator This interface provides additional intervals in order to move from one partition cell into an adjacent one.
IGraphPartitionExtension This interface provides methods for extending the functionality of a GraphPartition.
Interval This class represents a one-dimensional closed interval.
IObstaclePartition This class implements a IPartition that takes a list of Obstacles as input to subdivide an area into PartitionCells.
IPartition This class divides a rectangular area into one or more PartitionCells.
Obstacle This class describes the obstacles that are used by implementations of IObstaclePartition to subdivide an area into PartitionCells.
OrthogonalInterval A horizontal or vertical Interval that additionally stores a y- (in the horizontal case) or x-coordinate (in the vertical case).
PartitionCell A PartitionCell represents a rectangular part of a IPartition as result of the decomposition process.
PartitionCell.PartitionCellBorder This class is a type-safe enumeration used for defining the border of a PartitionCell.
Path A Path represents the result of a path search as a list of consecutive CellEntrances.
PathSearch This is a pathfinding algorithm that calculates the shortest (i.e., the cheapest) paths for a set of edges through a GraphPartition.
PathSearchConfiguration This class contains the basic configuration used by path search algorithms.
PathSearchContext This class provides context information that is useful for the PathSearch algorithm.
PathSearchExtension Extensions are added to a PathSearch to influence the search process.
PathSearchResult This class manages the best Paths found for each edge and provides according EdgeInfos.
PenaltySettings This class provides the cost penalties that are applied for violating restrictions during a PathSearch.
RoutingType
SegmentGroup Represents a group of segments of different edges that shall be combined at their common source or target.
SegmentInfo A SegmentInfo holds information about the possible location of an orthogonal edge segment.