Main.java 800 B

123456789101112131415161718192021222324252627
  1. import Algorithms.InitializeNodePositions;
  2. import Algorithms.RandomGraphGenerator;
  3. import Algorithms.SweepCrossingMinimizer;
  4. import IO.Reader;
  5. import Model.LayeredGraphNode;
  6. import View.MainView;
  7. /**
  8. * The main executable class. Starts the application.
  9. * @author kolja
  10. *
  11. */
  12. public class Main {
  13. public static void main(String[] args) {
  14. //Reader r = new Reader( "save.graph" );
  15. //LayeredGraphNode graph = r.readInputGraph();
  16. RandomGraphGenerator r = new RandomGraphGenerator( 0.1, 0.2, 5,5, 5, 5, 2 );
  17. LayeredGraphNode graph = r.createRandomNode( null, 0 );
  18. SweepCrossingMinimizer cminzer = new SweepCrossingMinimizer();
  19. for( int i = 0; i < 10; i++ )
  20. cminzer.minimizeCrossings( graph );
  21. InitializeNodePositions.placeNodes( graph );
  22. new MainView( graph );
  23. }
  24. }