Graphviz FDP

Preview Image

Property Value
Identifier: org.eclipse.elk.graphviz.fdp
Meta Data Provider: layouter.GraphvizMetaDataProvider


Spring model layouts similar to those of Neato, but does this by reducing forces rather than working with energy. Fdp implements the Fruchterman-Reingold heuristic including a multigrid solver that handles larger graphs and clustered undirected graphs.

Category: Force

Layout algorithms that follow physical analogies by simulating a system of attractive and repulsive forces. The first successful method of this kind was proposed by Eades in 1984.

Supported Graph Features

Name Description
Self Loops Edges connecting a node with itself.
Multi Edges Multiple edges with the same source and target node.
Edge Labels Labels that are associated with edges.
Clusters Edges that connect nodes from different clusters, but not the cluster parent nodes.

Supported Options

Option Default Value
Adapt Port Positions true
Concentrate Edges false
Debug Mode false
Edge Label Spacing 2
Edge Routing EdgeRouting.SPLINES
Interactive false
Label Angle -25
Label Distance 1
Max. Iterations 600
Node Size Constraints EnumSet.noneOf(SizeConstraint)
Node Size Options EnumSet.of(SizeOptions.DEFAULT_MINIMUM_SIZE)
Node Spacing 40
Overlap Removal OverlapMode.PRISM
Padding new ElkPadding(10)
Separate Connected Components false