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

net.wigis.graph.dnv.DNVGraph.addNode()
This method should be used both to add nodes and edges. @param level the level @param entity the entity


        DNVEdge dnvEdge = new DNVEdge( dnvGraph );
        dnvEdge.setFrom( fromNode );
        dnvEdge.setId( new Integer( edge_id + 10000000 ) );
        dnvEdge.setTo( toNode );
        dnvGraph.addNode( 0, dnvEdge );
        line = br.readLine();
      }
    }
    catch( NullPointerException npe )
    {

View Full Code Here

    for( int i = 0; i < numberOfVertices; i++ )
    {
      tempNode = new DNVNode( new Vector2D( (float)Math.random(), (float)Math.random() ), graph );
      tempNode.setColor( color );
      unconnectedNodes.add( tempNode );
      graph.addNode( 0, tempNode );
      if( ( i + 1 ) % 10000 == 0 )
      {
        timer.setEnd();
        System.out.println( "node " + ( i + 1 ) + " - Total time: " + timer.getTotalTime( Timer.SECONDS ) + " seconds. Last segment: "
            + timer.getLastSegment( Timer.SECONDS ) + " seconds." );

View Full Code Here

          tempNode2 = graph.getNodes( 0 ).get( tempIndex );
        }
      }


      tempEdge = new DNVEdge( 0, DNVEdge.DEFAULT_RESTING_DISTANCE, false, tempNode, tempNode2, graph );
      graph.addNode( 0, tempEdge );
      if( ( i + 1 ) % 10000 == 0 )
      {
        timer.setEnd();
        System.out.println( "edge " + ( i + 1 ) + " - Total time: " + timer.getTotalTime( Timer.SECONDS ) + " seconds. Last segment: "
            + timer.getLastSegment( Timer.SECONDS ) + " seconds." );

View Full Code Here

    DNVNode tempNode;
    for( int i = 0; i < numberOfNodes; i++ )
    {
      tempNode = new DNVNode( new Vector2D( (float)Math.random(), (float)Math.random() ), graph );
      tempNode.setId( i );
      graph.addNode( 0, tempNode );
    }


    int degreeBy2 = meanDegree / 2;
    DNVNode tempNode2;
    DNVEdge tempEdge;

View Full Code Here

            tempEdge = edgeMap.get( index + "_" + i );
            if( tempEdge == null )
            {
              tempEdge = new DNVEdge( tempNode, tempNode2, graph );
              tempEdge.setId( edgeId++ );
              graph.addNode( 0, tempEdge );
              edgeMap.put( i + "_" + index, tempEdge );
              edgeMap.put( index + "_" + i, tempEdge );
            }
          }
        }

View Full Code Here

            while( index == i )
              index = (int)( Math.random() * numberOfNodes );
            tempNode2 = (DNVNode)graph.getNodeById( index );
            tempEdge = new DNVEdge( tempNode, tempNode2, graph );
            tempEdge.setId( edgeId++ );
            graph.addNode( 0, tempEdge );
          }
        }
      }
    }

View Full Code Here

      //build a new node, assign parent to the nodes in the triangle
      if(buildNewNode){
        DNVNode parent = new DNVNode(compressedGraph);
        parentToTriangle.put(parent, tri);
        triangleToParent.put(tri,parent);
        compressedGraph.addNode(0, parent);
        for(DNVNode node : tri.vertices){
          nodeToParent.put(node, parent);
          untraveledNode.remove(node);
        }
      }

View Full Code Here

      if(!nodeToParent.containsKey(line.nodes.getMiddle())){
        //System.out.println("add new node");
        DNVNode parent = new DNVNode(compressedGraph);
        parentToLine.put(parent, line);
        lineToParent.put(line,parent);
        compressedGraph.addNode(0, parent);
        for(DNVNode node : line.vertices){
          nodeToParent.put(node, parent);        
        }
      }else{
        DNVNode nodeLeft = line.nodes.getLeft();

View Full Code Here

    for(DNVNode node : untraveledNode){
      if(node.getConnectivity() > 1){
        System.out.println("connectivity > 1, shouldn't be happening");
      }
      DNVNode parent = new DNVNode(compressedGraph);
      compressedGraph.addNode(0, parent);
      nodeToParent.put(node, parent);
    }
    for(DNVEdge edge : untraveledEdge){
      if(! (edge.getFrom().getConnectivity() == 1 && edge.getTo().getConnectivity() == 1)){
        System.out.println("weird edge");

View Full Code Here

          node.setProperty("propertyLoss", row.getCell(100).getStringCellValue());
          propertyLossHash.put(propertyLoss.getStringCellValue(), row.getCell(100).getStringCellValue());
          //System.out.println("property loss " + row.getCell(100).getStringCellValue());
        }
        //System.out.println();
        graph.addNode(0, node);
      }
      String countryHashString = "";
      for(String key : countrySet){
        countryHashString += key + "\t";
      }

View Full Code Here

0 1 2

TOP

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.