/** * Relaxation step. Moves all nodes a smidge. */ @Override public void step() { super.step(); currentIteration++; testAverageDeltas(); }
/** * Had to override this one as well, to ensure that setRoot() is called. */ @Override public void initialize() { super.initialize(); setRoot(getGraph()); }
/** * Had to override this one as well, to ensure that setRoot() is called. */ @Override public void initialize() { super.initialize(); setRoot(); }
/** * Returns the graph for which this layout is defined. * @return the graph for which this layout is defined * @see edu.uci.ics.jung.algorithms.layout.Layout#getGraph() */ public Graph<V, E> getGraph() { return delegate.getGraph(); }
/** * @param v * @param location * @see edu.uci.ics.jung.algorithms.layout.Layout#setLocation(java.lang.Object, java.awt.geom.Point2D) */ public void setLocation(V v, Point2D location) { delegate.setLocation(v, location); }
/** * @param initializer * @see edu.uci.ics.jung.algorithms.layout.Layout#setInitializer(org.apache.commons.collections15.Transformer) */ public void setInitializer(Transformer<V, Point2D> initializer) { delegate.setInitializer(initializer); }
/** * @see edu.uci.ics.jung.algorithms.layout.Layout#reset() */ public void reset() { delegate.reset(); }
public void setGraph(Graph<V,E> graph) { this.graph = graph; if(size != null && graph != null) { initialize(); } }
/** * @see edu.uci.ics.jung.algorithms.layout.Layout#lock(Object, boolean) */ public void lock(V v, boolean state) { delegate.lock(v, state); }
/** * Gets the edge nearest to the location of the (x,y) location selected. * Calls the longer form of the call. */ public E getEdge(Layout<V,E> layout, double x, double y) { return getEdge(layout, x, y, this.maxDistance); }
/** * Gets the vertex nearest to the location of the (x,y) location selected, * within a distance of <tt>maxDistance</tt>. Iterates through all * visible vertices and checks their distance from the click. Override this * method to provde a more efficient implementation. */ public V getVertex(Layout<V,E> layout, double x, double y) { return getVertex(layout, x, y, this.maxDistance); }
@Override public void setSize(Dimension size) { this.size = size; setRootPolars(); }
/** * Returns a string with information about the current status of the algorithm. */ public String getStatus() { return status + this.getSize(); }
@Override public void setSize(Dimension size) { this.size = size; buildTree(); }
/** * @see edu.uci.ics.jung.algorithms.layout.Layout#getGraph() */ public Graph<V, E> getGraph() { return delegate.getGraph(); }
/** * @param initializer * @see edu.uci.ics.jung.algorithms.layout.Layout#setInitializer(org.apache.commons.collections15.Transformer) */ public void setInitializer(Transformer<V, Point2D> initializer) { delegate.setInitializer(initializer); }
/** * Relaxation step. Moves all nodes a smidge. */ @Override public void step() { super.step(); currentIteration++; testAverageDeltas(); }
@Override public void setSize(Dimension size) { this.size = size; setRootPolars(); }
/** * @return a string with information about the current status of the algorithm. */ public String getStatus() { return status + this.getSize(); }