Edge Routing Algorithms

Edge Routing Algorithms
Prev	Chapter 5. Automatic Graph Layout	Next

All edge routing algorithms provided by yFiles implement interface LayoutStage. LayoutStage makes it easy to use an edge routing algorithm as a postprocessing step to any of the major layout algorithms, for example.

yFiles supports different edge routing styles:

Organic Routing

Organic edge routing is described in the section called “Organic Edge Routing”.

Figure 5.97. Sample organic edge routings

This style is encapsulated in class OrganicEdgeRouter.

Orthogonal Routing

Orthogonal edge routing is described in the section called “Polyline Edge Routing”, the section called “Orthogonal Edge Routing”, and the section called “Channel Edge Routing”. A specialized edge routing algorithm that generates bus-style representations by bundling edges of complete (sub)graphs can be found in the section called “Orthogonal Bus-style Edge Routing”. Polyline edge routing also supports octilinear routing, a variation of orthogonal routing.

Figure 5.98. Sample orthogonal edge routings

This style is encapsulated in classes EdgeRouter, OrthogonalEdgeRouter, and ChannelEdgeRouter. Class BusRouter encapsulates the bus-routing functionality.