Automatic Layout Features

Optimization criteria for graph layout algorithms are numerous. They range from minimizing the length of edge paths to minimizing the number of bends, and from placing highly connected components tightly together to arranging nodes in a hierarchical top-to-bottom manner. In addition to the unemotional nature of such optimization, a graph layout algorithm also aims to make its outcome aesthetically pleasing for the user.

The yFiles graph layout algorithms support sophisticated features when calculating a graph’s layout. Most notably, they support grouped graphs and the arrangement of their grouped nodes. Bus-like edge paths can be generated for edges connecting to a common node. The starting and end points of an edge path can be constrained to a specific side of a node or even to explicit coordinates. Additionally, many algorithms include labeling as an integrated part of layout generation.