Package net.wigis.graph.dnv

Examples of net.wigis.graph.dnv.DNVGraph.writeGraph()


    if( firstSpaceIndex == -1 )
      firstSpaceIndex = searchQuery.length();
    String fileName = searchQuery.substring( 0, firstSpaceIndex ) + " " + now();
    String selectedFile = OUTPUT_FILE_PATH + CITESEER_SEARCH_PREFIX + fileName + OUTPUT_FILE_EXTENSION;
    // this.searchResults = null;
    g.writeGraph( selectedFile );
    FacesContext fc = FacesContext.getCurrentInstance();
    PaintBean pb = PaintBean.getCurrentInstance();
    GraphsBean gb = (GraphsBean)ContextLookup.lookup( "graphsBean", fc );
    if( gb != null )
      gb.buildFileList();
View Full Code Here


   
    public static void main(String[] args){
      BarabasiAlbertGenerator bsg = new BarabasiAlbertGenerator(500,10);
      bsg.evolveGraph(500);
      DNVGraph graph = bsg.create();
      graph.writeGraph("/Users/scarlettteng/dev/bs1000_5000graph.dnv");
    }
}
View Full Code Here

    // input = readMatrix( directory, file );
    // double [][] weights = generateRandomInput( numberOfNodes );
    int n = input[0].length; // number of data objects
    double[][] output = MDSJ.stressMinimization( input ); // apply MDS
    DNVGraph graph = generateGraph( input, n, output );
    graph.writeGraph( Settings.GRAPHS_PATH + "MDS_stressMinimization.dnv" );

    output = MDSJ.classicalScaling( input ); // apply MDS
    graph = generateGraph( input, n, output );
    graph.writeGraph( Settings.GRAPHS_PATH + "MDS_classicalMDS.dnv" );
View Full Code Here

    DNVGraph graph = generateGraph( input, n, output );
    graph.writeGraph( Settings.GRAPHS_PATH + "MDS_stressMinimization.dnv" );

    output = MDSJ.classicalScaling( input ); // apply MDS
    graph = generateGraph( input, n, output );
    graph.writeGraph( Settings.GRAPHS_PATH + "MDS_classicalMDS.dnv" );

    float width = GraphFunctions.getGraphWidth( graph, 0, false );

    new RandomLayout().runLayout( graph, 0, width );
    new FruchtermanReingold().runLayout( width, width, graph, 0.01f, 0, false, false );
View Full Code Here

    float width = GraphFunctions.getGraphWidth( graph, 0, false );

    new RandomLayout().runLayout( graph, 0, width );
    new FruchtermanReingold().runLayout( width, width, graph, 0.01f, 0, false, false );
    graph.writeGraph( Settings.GRAPHS_PATH + "MDS_FR.dnv" );
  }

  /**
   * Read matrix.
   *
 
View Full Code Here

   *             Signals that an I/O exception has occurred.
   */
  public static void main( String args[] ) throws IOException
  {
    DNVGraph graph = convert( Settings.GRAPHS_PATH + "dep.csv" );
    graph.writeGraph( Settings.GRAPHS_PATH + "dep.dnv" );
  }
}
View Full Code Here

  public static void main( String args[] )
  {
    GraphsPathFilter.init();
    DNVGraph graph = new DNVGraph( Settings.GRAPHS_PATH + "_UCI_venezuela.dnv" );
    new MDSLayout().runLayout( graph, 0, true );
    graph.writeGraph( Settings.GRAPHS_PATH + "_UCI_venezuela_MDS.dnv" );
  }

  public static final String LABEL = "MDS Layout";
 
  @Override
View Full Code Here

   
    new FruchtermanReingold().runLayout( 100, 100, graph, 0.01f, 0, false, false );

    System.out.println( "Graph has " + graph.getGraphSize( 0 ) + " nodes and " + graph.getEdgeMap( 0 ).size() + " edges." );

    graph.writeGraph( Settings.GRAPHS_PATH + "PADA/" + nodesFile + ".dnv" );
  }

  /**
   * @param string
   * @return
 
View Full Code Here

    DNVGraph graph = new DNVGraph( filename );

    runLayout( graph );

    graph.writeGraph( filename.substring( 0, filename.length() - 4 ) + "_laid_out.dnv" );

    System.out.println( "Done with layout for " + filename );
  }

  /**
 
View Full Code Here

   *            the arguments
   */
  public static void main( String args[] )
  {
    DNVGraph graph = generateGraph( "uk", true );
    graph.writeGraph( "C:\\BLACKBOOK\\bball\\SOA\\3.dnv" );
  }
}
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.