Class FRLayout2<V,E>
- java.lang.Object
-
- edu.uci.ics.jung.algorithms.layout.AbstractLayout<V,E>
-
- edu.uci.ics.jung.algorithms.layout.FRLayout2<V,E>
-
- All Implemented Interfaces:
com.google.common.base.Function<V,java.awt.geom.Point2D>,Layout<V,E>,IterativeContext,java.util.function.Function<V,java.awt.geom.Point2D>
public class FRLayout2<V,E> extends AbstractLayout<V,E> implements IterativeContext
Implements the Fruchterman-Reingold force-directed algorithm for node layout. This is an experimental attempt at optimizingFRLayout; if it is successful it will be folded back intoFRLayout(and this class will disappear).Behavior is determined by the following settable parameters:
- attraction multiplier: how much edges try to keep their vertices together
- repulsion multiplier: how much vertices try to push each other apart
- maximum iterations: how many iterations this algorithm will use before stopping
- Author:
- Tom Nelson, Scott White, Yan-Biao Boey, Danyel Fisher
- See Also:
- "Fruchterman and Reingold, 'Graph Drawing by Force-directed Placement'", "http://i11www.ilkd.uni-karlsruhe.de/teaching/SS_04/visualisierung/papers/fruchterman91graph.pdf"
-
-
Field Summary
Fields Modifier and Type Field Description protected com.google.common.cache.LoadingCache<V,java.awt.geom.Point2D>frVertexData-
Fields inherited from class edu.uci.ics.jung.algorithms.layout.AbstractLayout
graph, initialized, locations, size
-
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description protected voidcalcAttraction(E e)protected voidcalcPositions(V v)protected voidcalcRepulsion(V v1)booleandone()voidinitialize()Initializes fields in the node that may not have been set during the constructor.booleanisIncremental()voidreset()voidsetAttractionMultiplier(double attraction)voidsetMaxIterations(int maxIterations)voidsetRepulsionMultiplier(double repulsion)voidsetSize(java.awt.Dimension size)When a visualization is resized, it presumably wants to fix the locations of the vertices and possibly to reinitialize its data.voidstep()Moves the iteration forward one notch, calculation attraction and repulsion between vertices and edges and cooling the temperature.-
Methods inherited from class edu.uci.ics.jung.algorithms.layout.AbstractLayout
apply, getGraph, getSize, getX, getY, isLocked, lock, lock, offsetVertex, setGraph, setInitializer, setLocation, setLocation
-
-
-
-
Field Detail
-
frVertexData
protected com.google.common.cache.LoadingCache<V,java.awt.geom.Point2D> frVertexData
-
-
Method Detail
-
setSize
public void setSize(java.awt.Dimension size)
Description copied from class:AbstractLayoutWhen a visualization is resized, it presumably wants to fix the locations of the vertices and possibly to reinitialize its data. The current method calls initializeLocations followed by initialize_local.
-
setAttractionMultiplier
public void setAttractionMultiplier(double attraction)
-
setRepulsionMultiplier
public void setRepulsionMultiplier(double repulsion)
-
initialize
public void initialize()
Description copied from interface:LayoutInitializes fields in the node that may not have been set during the constructor. Must be called before the iterations begin.- Specified by:
initializein interfaceLayout<V,E>
-
step
public void step()
Moves the iteration forward one notch, calculation attraction and repulsion between vertices and edges and cooling the temperature.- Specified by:
stepin interfaceIterativeContext
-
calcPositions
protected void calcPositions(V v)
-
calcAttraction
protected void calcAttraction(E e)
-
calcRepulsion
protected void calcRepulsion(V v1)
-
setMaxIterations
public void setMaxIterations(int maxIterations)
-
isIncremental
public boolean isIncremental()
- Returns:
- true
-
done
public boolean done()
- Specified by:
donein interfaceIterativeContext- Returns:
- true once the current iteration has passed the maximum count.
-
-