Package net.wigis.graph.dnv

Examples of net.wigis.graph.dnv.DNVNode

403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
  {
    float min = Float.POSITIVE_INFINITY;
    if( nodeList != null )
    {
      Iterator<DNVNode> nodes = nodeList.iterator();
      DNVNode tempNode = null;
      float temp;
      while( nodes.hasNext() )
      {
        tempNode = nodes.next();
        temp = tempNode.getPosition( display ).getX();
        if( temp < min )
          min = temp;
      }

      return min;
View Full Code Here
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
  public static float getMinYPosition( Collection<DNVNode> nodeList, boolean display )
  {
    if( nodeList != null )
    {
      Iterator<DNVNode> nodes = nodeList.iterator();
      DNVNode tempNode = null;
      float min = Float.POSITIVE_INFINITY;
      float temp;
      while( nodes.hasNext() )
      {
        tempNode = nodes.next();
        temp = tempNode.getPosition( display ).getY();
        if( temp < min )
          min = temp;
      }

      return min;
View Full Code Here
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
   *            the i
   * @return the center of gravity
   */
  public static Vector2D getCenterOfGravity( Iterator<DNVNode> i )
  {
    DNVNode tempNode = null;
    float totalX = 0;
    float totalY = 0;
    float number = 0;
    Vector2D position;
    Object temp;
    while( i.hasNext() )
    {
      temp = i.next();
      if( temp instanceof DNVNode )
        tempNode = (DNVNode)temp;
      if( tempNode != null )
      {
        position = tempNode.getPosition();
        totalX += position.getX();
        totalY += position.getY();
        number++;
      }
    }
View Full Code Here
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
   *            the i
   * @return the average x position
   */
  public static float getAverageXPosition( Iterator<DNVNode> i )
  {
    DNVNode tempNode = null;
    float total = 0;
    float number = 0;
    Object temp;
    float subnodes = 0;
    while( i.hasNext() )
    {
      temp = i.next();
      if( temp instanceof DNVNode )
        tempNode = (DNVNode)temp;
      subnodes = tempNode.getTotalNumberOfSubNodes();
      total += tempNode.getPosition().getX() * subnodes;
      number += subnodes;
    }

    return total / number;

View Full Code Here
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
   *            the i
   * @return the average y position
   */
  public static float getAverageYPosition( Iterator<DNVNode> i )
  {
    DNVNode tempNode = null;
    float total = 0;
    float number = 0;
    Object temp;
    float subnodes = 0;
    while( i.hasNext() )
    {
      temp = i.next();
      if( temp instanceof DNVNode )
        tempNode = (DNVNode)temp;
      subnodes = tempNode.getTotalNumberOfSubNodes();
      total += tempNode.getPosition().getY() * subnodes;
      number += subnodes;
    }

    return total / number;

View Full Code Here
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
        nodes.next().updateEdgelengthsAndMass( processedEdges, false );
    }

    nodes = graph.getNodes( level ).iterator();
    int size = graph.getGraphSize( level );
    DNVNode tempNode;
    DNVNode parentNode;
    int siblings = 0;
    int i = 0;
    System.out.println( "     Setting the positions for " + size + " nodes." );
    float distance;
    Timer distanceTimer = new Timer( Timer.NANOSECONDS );
    Timer placingTimer = new Timer( Timer.NANOSECONDS );
    while( nodes.hasNext() )
    {
      tempNode = nodes.next();
      parentNode = tempNode.getParentNode();
      if( parentNode != null )
      {
        center = parentNode.getPosition();
        siblings = parentNode.getNumberOfSubNodes();
      }
      else
      {
        center = new Vector2D( (float)Math.random(), (float)Math.random() );
        siblings = 1;
View Full Code Here
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
   */
  public static float getDistanceFromFirstSibling( DNVNode node )
  {
    float distance = 0;

    DNVNode otherNode = node.getFirstSibling();
    if( otherNode != null )
    {
      if( otherNode == node )
        return 0;

      distance = findShortestPathDistance( node, otherNode );
      if( distance == Float.POSITIVE_INFINITY )
        System.out.println( "Unable to find path between nodes " + node.getId() + " and " + otherNode.getId() );
    }

    return distance;
  }
View Full Code Here
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
   *            the level
   */
  public static void removeIsolatedNodes( DNVGraph graph, Integer level )
  {
    List<DNVNode> nodes = graph.getNodes( level );
    DNVNode tempNode;
    for( int i = 0; i < nodes.size(); i++ )
    {
      tempNode = nodes.get( i );
      if( tempNode.getNeighbors().size() == 0 )
      {
        graph.removeNode( level, tempNode );
      }
    }
  }
View Full Code Here
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
   * @return the edge to node of type
   */
  public static DNVEdge getEdgeToNodeOfType( DNVGraph graph, DNVNode node, String type )
  {
    Iterator<DNVEdge> edges;
    DNVNode neighbor;
    DNVEdge edge;
    try
    {
      edges = node.getFromEdges().iterator();
      while( edges.hasNext() )
      {
        edge = edges.next();
        neighbor = edge.getTo();
        if( neighbor.getType().equals( type ) )
        {
          return edge;
        }
      }
    }
    catch( NullPointerException npe )
    {}

    try
    {
      edges = node.getToEdges().iterator();
      while( edges.hasNext() )
      {
        edge = edges.next();
        neighbor = edge.getFrom();
        if( neighbor.getType().equals( type ) )
        {
          return edge;
        }
      }
    }
View Full Code Here
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
      sort = new RestingDistanceSort();
    else
      sort = new DistanceSort( position );
    Iterator<DNVNode> nodes = graph.getNodes( level ).iterator();
    List<DNVNode> nodesList = new ArrayList<DNVNode>();
    DNVNode tempNode;
    while( nodes.hasNext() )
    {
      tempNode = nodes.next();
      if( tempNode.getType().equals( type ) && !tempNode.equals( node ) )
        nodesList.add( tempNode );
    }

    Collections.sort( nodesList, sort );
View Full Code Here
TOP

Related Classes of net.wigis.graph.dnv.DNVNode

  • blackbook.ejb.client.visualization.proxy.ResourceDetails
  • net.wigis.graph.data.citeseer.SearchBean
  • net.wigis.graph.data.GenerateDNVGraphFromDB
  • net.wigis.graph.data.uploader.ReadCSVtoDNVGraph
  • net.wigis.graph.data.uploader.SimpleEdgeTuplesToDNVGraph
  • net.wigis.graph.data.uploader.XMLToDNV
  • net.wigis.graph.data.utilities.ConvertDNVToTomSawyer
  • net.wigis.graph.data.utilities.ConvertJavaDependenciesToDNV
  • net.wigis.graph.data.utilities.ConvertPlainPairsToDNV
  • net.wigis.graph.data.utilities.ConvertPNNLDataToDNV
    • Copyright © 2018 www.massapicom. 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.