|
@@ -2,6 +2,7 @@ package test;
|
|
|
|
|
|
import javax.swing.JFrame;
|
|
import javax.swing.JFrame;
|
|
import javax.swing.JTree;
|
|
import javax.swing.JTree;
|
|
|
|
+import javax.swing.tree.DefaultTreeModel;
|
|
|
|
|
|
import bk.BKNodePlacement;
|
|
import bk.BKNodePlacement;
|
|
import graph.LayeredGraphNode;
|
|
import graph.LayeredGraphNode;
|
|
@@ -17,7 +18,7 @@ class TestProcessor {
|
|
|
|
|
|
public static void main(String[] args) throws InterruptedException {
|
|
public static void main(String[] args) throws InterruptedException {
|
|
|
|
|
|
- RandomGraphGenerator r = new RandomGraphGenerator( 0.2, 0.8, 3, 15, 2, 15, 3 );
|
|
|
|
|
|
+ RandomGraphGenerator r = new RandomGraphGenerator( 0.2, 0.8, 3, 5, 2, 5, 3 );
|
|
LayeredGraphNode graph = r.createRandomNode( null, 0, true );
|
|
LayeredGraphNode graph = r.createRandomNode( null, 0, true );
|
|
SweepCrossingMinimizer cminzer = new SweepCrossingMinimizer();
|
|
SweepCrossingMinimizer cminzer = new SweepCrossingMinimizer();
|
|
for( int i = 0; i < 10; i++ )
|
|
for( int i = 0; i < 10; i++ )
|
|
@@ -31,14 +32,32 @@ class TestProcessor {
|
|
BKNodePlacement algorithm = new BKNodePlacement();
|
|
BKNodePlacement algorithm = new BKNodePlacement();
|
|
JTree pseudoTree = new JTree();
|
|
JTree pseudoTree = new JTree();
|
|
PseudoCodeNode tree = algorithm.createPseudocodeTree( pseudoTree );
|
|
PseudoCodeNode tree = algorithm.createPseudocodeTree( pseudoTree );
|
|
|
|
+ pseudoTree.setModel( new DefaultTreeModel( tree ) );
|
|
JFrame frame = new JFrame( "NodeShuffler" );
|
|
JFrame frame = new JFrame( "NodeShuffler" );
|
|
PseudoCodeProcessor processor = new StepInProcessor( tree, graph, frame );
|
|
PseudoCodeProcessor processor = new StepInProcessor( tree, graph, frame );
|
|
|
|
+ tree.setController( processor.getController() );
|
|
|
|
+ processor.start();
|
|
|
|
+ processor.join();
|
|
|
|
+ processor = new StepInProcessor( tree, graph, frame );
|
|
|
|
+ tree.setController( processor.getController() );
|
|
|
|
+ for( int i = pseudoTree.getRowCount() - 1; i > 0; i-- )
|
|
|
|
+ pseudoTree.collapseRow( i );
|
|
|
|
+ processor.getController().setStepOption( 1 );
|
|
|
|
+ processor.start();
|
|
|
|
+ processor.join();
|
|
|
|
+ processor = new StepOverProcessor( tree, graph, frame );
|
|
|
|
+ tree.setController( processor.getController() );
|
|
processor.start();
|
|
processor.start();
|
|
processor.join();
|
|
processor.join();
|
|
processor = new StepOverProcessor( tree, graph, frame );
|
|
processor = new StepOverProcessor( tree, graph, frame );
|
|
|
|
+ tree.setController( processor.getController() );
|
|
|
|
+ for( int i = pseudoTree.getRowCount() - 1; i > 0; i-- )
|
|
|
|
+ pseudoTree.collapseRow( i );
|
|
|
|
+ processor.getController().setStepOption( 1 );
|
|
processor.start();
|
|
processor.start();
|
|
processor.join();
|
|
processor.join();
|
|
processor = new RandomProcessor( tree, graph, frame );
|
|
processor = new RandomProcessor( tree, graph, frame );
|
|
|
|
+ tree.setController( processor.getController() );
|
|
processor.start();
|
|
processor.start();
|
|
processor.join();
|
|
processor.join();
|
|
System.out.println( "Tests Finished." );
|
|
System.out.println( "Tests Finished." );
|