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

      List<DNVEntity> nodesAndEdges = history.get( historyIndex );
      for( DNVEntity entity : nodesAndEdges )
      {
        boolean visible = entity.isVisible();
        entity.setGraph( graph );
        graph.addNode( level, entity );
        entity.setVisible( visible );
      }


      for( DNVNode node : graph.getNodes( level ) )
      {

View Full Code Here

      DNVGraph graph = new DNVGraph();
      historyIndex++;
      List<DNVEntity> nodesAndEdges = history.get( historyIndex );
      for( DNVEntity entity : nodesAndEdges )
      {
        graph.addNode( level, entity );
      }
            
      for( DNVNode node : graph.getNodes( level ) )
      {
        node.verifyNeighbors();

View Full Code Here

      DNVNode node = new DNVNode( graph );
      node.setPosition( (float)output[0][i], (float)output[1][i] );
      node.setColor( 0.3f, 0.7f, 1 );
      node.setLabel( "" + i );
      node.setBbId( "" + i );
      graph.addNode( 0, node );
    }
    for( int i = 0; i < input.length; i++ )
    {
      for( int j = 0; j < i; j++ )
      {

View Full Code Here

        edge.setFrom( from );
        edge.setTo( to );
        edge.setLabel( "" + Math.round( 100.0 * input[i][j] ) / 100.0 );
        edge.setRestingDistance( (float)input[i][j] );
        edge.setK( 1 );
        graph.addNode( 0, edge );
      }
    }
    return graph;
  }
}

View Full Code Here

      toNode = (DNVNode)getNode( to, graph );
      edge = new DNVEdge( graph );
      edge.setFrom( fromNode );
      edge.setTo( toNode );
      edge.setDirectional( true );
      graph.addNode( 0, edge );
    }


    new FruchtermanReingold().runLayout( 100, 100, graph, 0.1f, 0, false, false );
    return graph;
  }

View Full Code Here

              node.setProperty( "Contents", "hasFamilyRelation" );
            }
            node.setPosition( (float)Math.random(), (float)Math.random() );
            node.setLabel( line[4] );
            
            graph.addNode( 0, node );
  //        }
        }
        else
        {
          System.out.println( "Multiple occurances of same node: " + line[0] );

View Full Code Here

        newNode.setPosition( position );
        newNode.setRadius( results.getFloat( "radius" ) );
        newNode.setMass( results.getFloat( "mass" ) );
        newNode.setLevel( 0 );
        newNode.setId( results.getInt( "idNodes" ) );
        graph.addNode( 0, newNode );
      }


      query = "SELECT * FROM edges WHERE idGraphs = " + idGraphs + ";";
      System.out.println( query );
      results = dbm.getResults( query );

View Full Code Here

        newEdge = new DNVEdge( 0, DNVEdge.DEFAULT_RESTING_DISTANCE, false, fromNode, toNode, graph );
        if( fromNode != null && toNode != null )
        {
          fromNode.addFromEdge( newEdge );
          toNode.addToEdge( newEdge );
          graph.addNode( 0, newEdge );
        }
        else
          System.out.println( "Error with a node for edge " + results.getInt( "fromNodeId" ) + "->" + results.getInt( "toNodeId" ) );


      }

View Full Code Here

        {
          fromNode = new DNVNode( new Vector2D( (float)Math.random(), (float)Math.random() ), dnvGraph );
          fromNode.setLevel( 0 );
          fromNode.setId( new Integer( fromId ) );
          fromNode.setLabel( "" + fromId );
          dnvGraph.addNode( 0, fromNode );
        }
        toNode = (DNVNode)dnvGraph.getNodeById( toId );
        if( toNode == null )
        {
          toNode = new DNVNode( new Vector2D( (float)Math.random(), (float)Math.random() ), dnvGraph );

View Full Code Here

        {
          toNode = new DNVNode( new Vector2D( (float)Math.random(), (float)Math.random() ), dnvGraph );
          toNode.setLevel( 0 );
          toNode.setId( new Integer( toId ) );
          toNode.setLabel( "" + toId );
          dnvGraph.addNode( 0, toNode );
        }


        DNVEdge dnvEdge = new DNVEdge( dnvGraph );
        dnvEdge.setFrom( fromNode );
        dnvEdge.setId( new Integer( edge_id + 10000000 ) );

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.