The Graph Layout Toolkit has undergone substantial development. Some of the algorithms are significantly faster, library interdependence has been reduced, and considerable memory savings have been attained. Connected Component Layout A connected component of a graph is a set of nodes and edges that are connected among themselves but disconnected from the rest of the graph. When performing a layout of a graph with several connected components, it is not only more convenient to use this approach, but it is also more efficient. Algorithms to achieve incremental connected component layout have been introduced.
Incremental layout helps retain a recognizable layout of a graph as changes are made.
The Graph Layout Toolkit now provides support for automatic positioning of several labels per edge. Labeling solutions above and below horizontal lines are found more efficiently. Options to permit controlled overlapping of edge labels have been introduced to support drawings with limited space. Ports In the Hierarchical Library port sharing and port distribution improvements have been introduced. In the Orthogonal Library, edges are now distributed more evenly along the borders of each node.