edu.uci.ics.jung.algorithms.layout3d
Class ISOMLayout<V,E>
java.lang.Object
edu.uci.ics.jung.algorithms.layout3d.AbstractLayout<V,E>
edu.uci.ics.jung.algorithms.layout3d.ISOMLayout<V,E>
- All Implemented Interfaces:
- Layout<V,E>, IterativeContext, org.apache.commons.collections15.Transformer<V,javax.vecmath.Point3f>
public class ISOMLayout<V,E>
- extends AbstractLayout<V,E>
- implements IterativeContext
Implements a self-organizing map layout algorithm, based on Meyer's
self-organizing graph methods.
- Author:
- Yan Biao Boey
Methods inherited from class edu.uci.ics.jung.algorithms.layout3d.AbstractLayout |
getGraph, getSize, getVertices, getX, getY, isLocked, lock, lock, offsetVertex, setGraph, setInitializer, setLocation, setLocation, setSize, transform |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
elementAccessor
protected GraphElementAccessor<V,E> elementAccessor
ISOMLayout
public ISOMLayout(Graph<V,E> g)
getStatus
public String getStatus()
- Returns the current number of epochs and execution status, as a string.
initialize
public void initialize()
- Description copied from class:
AbstractLayout
- Initializer, calls intialize_local and initializeLocations
to start construction process.
- Specified by:
initialize
in interface Layout<V,E>
- Specified by:
initialize
in class AbstractLayout<V,E>
step
public void step()
- Advances the current positions of the graph elements.
- Specified by:
step
in interface IterativeContext
getISOMVertexData
public ISOMLayout.ISOMVertexData getISOMVertexData(V v)
isIncremental
public boolean isIncremental()
- This one is an incremental visualization.
- Returns:
true
is the layout algorithm is incremental, false
otherwise
done
public boolean done()
- For now, we pretend it never finishes.
- Specified by:
done
in interface IterativeContext
- Returns:
true
is the increments are done, false
otherwise
reset
public void reset()
- Specified by:
reset
in interface Layout<V,E>
Copyright © 2009. All Rights Reserved.