This is a powerful layout algorithm that can route the edges of a diagram using polyline edge segments while keeping the positions of the nodes in the diagram fixed. It is able to either produce orthogonal edge routes (each edge has only vertical and horizontal line segments) or octilinear edge routes (the slope of each edge segment is a multiple of 45 degree). The routed edges will usually not cross through any nodes.

The abilities of this router makes it a perfect layouter for interactive or incremental scenarios where

## Layout Options

### Scope

Determines the set of edges that the router should process.

- All Edges
- Routes all edges in the graph
- Selected Edges
- Routes only the selected edges in the graph
- Edges at Selected Nodes
- Routes only the edges connected to selected nodes

### Optimization Strategy

Determines the optimization strategy used for routing the edges.

- Balanced
- The layout algorithm tries to produce balanced results.
- Minimize Bends
- The main objective of the layout algorithm is to minimize the number of edge bends.
- Minimize Crossings
- The main objective of the layout algorithm is to minimize the number of edge crossings.

### Monotonic Path Restrictions

Specifies which kind of monotonic path restrictions should be applied.

- None
- Specifies that there are no restrictions.
- Monotonic Horizontal
- Specifies restrictions for the horizontal direction, i.e., each horizontal edge segment is directed from the source to the target.
- Monotonic Vertical
- Specifies restrictions for the vertical direction, i.e., each vertical edge segment is directed from the source to the target.
- Monotonic Both
- Specifies restrictions for the horizontal and vertical direction, i.e., each horizontal as well as each vertical edge segment is directed from the source to the target.

### Edge to Edge Distance

Specifies the minimal distance between any two edge segments.