EDU.auburn.VGJ.algorithm.cgd
Class CGDAlgorithm

java.lang.Object
  extended byEDU.auburn.VGJ.algorithm.cgd.CGDAlgorithm
All Implemented Interfaces:
GraphAlgorithm

public class CGDAlgorithm
extends java.lang.Object
implements GraphAlgorithm

An algorithm for laying out a graph by Clan-based Graph Deconposition.

Here is the source.


Constructor Summary
CGDAlgorithm()
           
CGDAlgorithm(boolean show)
           
 
Method Summary
 int addDummy_(ClanTree treenode, int top, int bottom, ClanTree edgesource, ClanTree edgesink)
           
 java.lang.String compute(Graph graph, GraphUpdate update)
          Apply the algorithm to graph.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

CGDAlgorithm

public CGDAlgorithm()

CGDAlgorithm

public CGDAlgorithm(boolean show)
Method Detail

compute

public java.lang.String compute(Graph graph,
                                GraphUpdate update)
Description copied from interface: GraphAlgorithm
Apply the algorithm to graph. The return value should be null if successful, and an error message if unsuccessful.

Specified by:
compute in interface GraphAlgorithm
Parameters:
update - an object that allows the display to be updated from within the algorithm
See Also:
GraphUpdate

addDummy_

public int addDummy_(ClanTree treenode,
                     int top,
                     int bottom,
                     ClanTree edgesource,
                     ClanTree edgesink)