OrthogonalLayout Class

Implements an orthogonal graph layout algorithm. Each link is drawn as a chain of alternating horizontal and vertical segments. Nodes are placed in a way that facilitates few links bends and crossings.

Namespace: com.mindfusion.diagramming
Package: com.mindfusion.diagramming

 Syntax

Java

public class OrthogonalLayout extends AbstractLayout

 Remarks

This algorithm is designed for planar graphs where the nodes have at most four incident links, and produces best results with such graphs as input. It can arrange any arbitrary graph as well, by adding some dummy nodes and links to planarize the graph and reduce its vertex degree, and removing them after the layout. However this might lead to using larger area than necessary, due to the space occupied by dummy elements.

 Inheritance Hierarchy

java.lang.Object
    com.mindfusion.diagramming.AbstractLayout
        com.mindfusion.diagramming.OrthogonalLayout