See: Description
| Interface | Description |
|---|---|
| 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. |
| 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. |
| Class | Description |
|---|---|
| AbstractSegmentInfo |
This class stores location information for orthogonal edge segments.
|
| 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. |
| GraphPartitionExtensionAdapter |
GraphPartitionExtensionAdapter provides an empty implementation of IGraphPartitionExtension. |
| Grid |
This class provides support for routing edges on equidistant grid lines.
|
| Interval |
This class represents a one-dimensional closed interval.
|
| 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. |
| PartitionCellKeys |
This class defines keys to obtain additional information about 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 | |
| PenaltySettings |
This class provides the cost penalties that are applied for violating restrictions during a
PathSearch. |
| PolylineEdgeRouterData |
Specifies custom data for the
EdgeRouter. |
| PolylineLayoutStage |
PolylineLayoutStage extends the orthogonal edge paths with polyline segments. |
| 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. |
| Enum | Description |
|---|---|
| Alignment | |
| RoutingType |
Provides classes and interfaces for automatic polyline routing of the edges of a graph.
The main class of this package is EdgeRouter that normally routes the edges in an orthogonal fashion, i.e., they only consist of horizontal and vertical segments. The edges can also be routed in a polyline fashion. During the routing process, the positions of the nodes are considered to be fixed and EdgeRouter will not modify their locations or their sizes in any way.
Sample output of the edge routing algorithm with default settings
Sample output of the edge routing algorithm with polyline routing and grouped edges
Sample output of the edge routing algorithm with polyline routing and group nodes