A descriptor for bus-related information to be associated with an edge.

This class provides helpers to convert between buses given by complete subgraphs and buses represented by specific hub nodes.

An orthogonal bus-style edge routing algorithm which combines the large number of edges of complete subgraphs in a concise, tree-like structure that consists of vertical and horizontal line segments.

This class represents an edge router.

This layouter is a s special version of OrthogonalEdgeRouter that can be used as a path finding strategy in ChannelEdgeRouter .

Class that routes edges within a vertical or horizontal channel All edges will then be routed in an orthogonal fashion.

Temporarily hides collinear bends on edge paths.

Layout stage for OrthogonalEdgeRouter that adds support for a bus-like routing style.

Layout stage for OrthogonalEdgeRouter that should be applied when routing edges in hierarchically grouped graphs.

This algorithm routes edges using an organic-like layout approach and style.

This class represents an orthogonal edge router.

This class represents an orthogonal edge router.

This class can be used to distribute overlapping edge segments of orthogonally routed edges.

Layout stage for OrthogonalEdgeRouter that should be applied when routing edges in a partition grid.

Performance optimization stage for OrthogonalEdgeRouter .

Performance optimization stage for OrthogonalEdgeRouter .

This LayoutStage will move edge ports, that are outside the corresponding nodes border, to the border.

Channel orientation specifier.

Constant that specifies monotonic path restrictions for edges.

Routing style specifier.

Sphere of action specifier.