Algorithms

Analysis

yFiles for Java Algorithms provides essential classes and data types for graph analysis tasks. These include highly efficient implementations of advanced data types such as Graph and Priority Queue. Furthermore, the algorithms library contains a wide variety of graph and network algorithms which in turn form an indispensable toolkit for a range of network analysis tasks.

Layout

The algorithms library offers a perfect suite of graph layout algorithms which deliver you unrivaled opportunities. Diverse layout styles including hierarchic, orthogonal, or circular are provided as easy to integrate components that can be configured programmatically to suit most layout demands. In addition, yFiles for Java Algorithms provides edge routing algorithms that make it possible to easily route edges into existing diagrams. The different layout styles also now include several incremental algorithms, for example incremental hierarchical layout.

Viewer

The yFiles for Java Viewer component provides powerful Java Swing controls for displaying graphs, and makes available excellent graph interaction capabilities with the controls, convenient printing capabilities, and export to a variety of output formats.

Visualization

The controls can display arbitrary graphical objects based on a graphics engine tailored to support both flexible customization and high performance rendering of complex graphics.