Package net.wigis.graph.dnv

Examples of net.wigis.graph.dnv.DNVNode

212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
   * @param nodes
   *            the nodes
   */
  public static void applyForces( Iterator<DNVNode> nodes )
  {
    DNVNode tempDNV;
    // float tempDiff;
    while( nodes.hasNext() )
    {
      tempDNV = nodes.next();
      forceStrength.add( tempDNV.getForce() );
      if( !tempDNV.hasProperty( "pinned" ) )
      {
        tempDNV.applyForce( 0.7f, true );
      }
    }
  }
View Full Code Here
237
238
239
240
241
242
243
244
245
246
247
   * @param level
   *            the level
   */
  public static void accumulateForces( DNVGraph graph, Iterator<DNVNode> nodes, int level )
  {
    DNVNode tempDNV;
    while( nodes.hasNext() )
    {
      tempDNV = nodes.next();
      accumulateForce( graph, tempDNV, level );
    }
View Full Code Here
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
   * @return the vector2 d
   */
  private static Vector2D accumulateRepellingForce( DNVGraph graph, DNVNode dnvNode, Integer level, Vector2D tempForce, Vector2D source,
      List<DNVNode> allNodes )
  {
    DNVNode tempNode;
    for( int i = 0; i < allNodes.size(); i++ )
    {
      tempNode = allNodes.get( i );
      if( tempNode != dnvNode /* && !tempNode.isAnchor() */)
      {
        tempForce = getRepellingForce( tempNode.getPosition(), source );
        tempForce.dotProduct( tempNode.getMass() );
        if( tempForce.length() > MIN_STRENGTH && tempNode.canRevive() )
          graph.setNodeActive( level, tempNode.getId(), tempNode );
        dnvNode.addForce( tempForce );
      }
    }
    return tempForce;
  }
View Full Code Here
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
      }
    }

    Map<Integer, DNVNode> nodeToParent = new HashMap<Integer, DNVNode>();
    Map<Integer, List<DNVNode>> parentToNode = new HashMap<Integer, List<DNVNode>>();
    DNVNode newNode;
    Vector2D position;
    Vector3D color;
    for( String neighborListId : nodesByNeighborlist.keySet() )
    {
      tempList = nodesByNeighborlist.get( neighborListId );
      position = new Vector2D( 0, 0 );
      color = new Vector3D( 0, 0, 0 );
      if( tempList != null && tempList.size() > 0 )
      {
        newNode = new DNVNode( graph );
        newNode.setFirstChild( tempList.get( 0 ) );
        newNode.setSubNodes( tempList );
        graph.addNode( currentLevel + 1, newNode );
        parentToNode.put( newNode.getId(), tempList );
        for( DNVNode childNode : tempList )
        {
          nodeToParent.put( childNode.getId(), newNode );
          position.add( childNode.getPosition() );
          color.add( childNode.getColor() );
          childNode.setParentNode( newNode );
        }
        position.dotProduct( 1.0f / (float)tempList.size() );
        color.dotProduct( 1.0f / (float)tempList.size() );
        if( tempList.size() == 1 )
        {
          newNode.setLabel( tempList.get( 0 ).getLabel() );
          newNode.setIcon( tempList.get( 0 ).getIcon() );
          newNode.setLabelColor( tempList.get( 0 ).getLabelColor() );
          newNode.setLabelOutlineColor( tempList.get( 0 ).getLabelOutlineColor() );
          newNode.setForceLabel( tempList.get( 0 ).isForceLabel() );
        }
        else
        {
          newNode.setLabel( "" + tempList.size() );
        }
        newNode.setColor( color );
        newNode.setPosition( position );
      }
    }

    for( DNVNode tempNode : currentNodes )
    {
      DNVNode parentNode = tempNode.getParentNode();
      DNVNode parentNode2;
      // DNVEdge newEdge;
      DNVNode tempNode2;
      List<DNVEdge> edgeList = tempNode.getFromEdges();
      for( DNVEdge tempEdge : edgeList )
      {
        tempNode2 = tempEdge.getTo();
        parentNode2 = tempNode2.getParentNode();
        if( parentNode2 != null && !parentNode2.getId().equals( parentNode.getId() ) && parentNode != parentNode2 )
        {
          if( !parentNode.isNeighbor( parentNode2 ) )
          {
            createEdge( graph, currentLevel, parentNode, parentNode2, tempEdge );
          }
        }
      }

      edgeList = tempNode.getToEdges();
      for( DNVEdge tempEdge : edgeList )
      {
        tempNode2 = tempEdge.getFrom();
        parentNode2 = tempNode2.getParentNode();
        if( parentNode2 != null && !parentNode2.getId().equals( parentNode.getId() ) && parentNode != parentNode2 )
        {
          if( !parentNode.isNeighbor( parentNode2 ) )
          {
            createEdge( graph, currentLevel, parentNode2, parentNode, tempEdge );
View Full Code Here
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
   * @return the vector2 d
   */
  private static Vector2D accumulateEdgeForce( DNVGraph graph, DNVNode dnvNode, Integer level, List<DNVEdge> fromEdges, List<DNVEdge> toEdges,
      Vector2D tempForce, Vector2D source )
  {
    DNVNode tempNeighbor;
    DNVEdge tempEdge;
    for( int i = 0; i < fromEdges.size(); i++ )
    {
      tempEdge = fromEdges.get( i );
      tempNeighbor = tempEdge.getTo();
      tempForce = getSpringForce( tempNeighbor.getPosition(), source, tempEdge.getRestingDistance(), tempEdge.getK() );
      if( tempForce.length() > MIN_SPRING_STRENGTH && tempNeighbor.canRevive() )
        graph.setNodeActive( level, tempNeighbor.getId(), tempNeighbor );
      dnvNode.addForce( tempForce );
    }

    for( int i = 0; i < toEdges.size(); i++ )
    {
      tempEdge = toEdges.get( i );
      tempNeighbor = tempEdge.getFrom();
      tempForce = getSpringForce( tempNeighbor.getPosition(), source, tempEdge.getRestingDistance(), tempEdge.getK() );
      if( tempForce.length() > MIN_SPRING_STRENGTH && tempNeighbor.canRevive() )
        graph.setNodeActive( level, tempNeighbor.getId(), tempNeighbor );
      dnvNode.addForce( tempForce );
    }
    return tempForce;
  }
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
72
    String line;
    String from;
    String to;

    DNVGraph graph = new DNVGraph();
    DNVNode fromNode;
    DNVNode toNode;
    DNVEdge edge;

    while( ( line = br.readLine() ) != null )
    {
      if( line.indexOf( "->" ) != -1 )
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
92
93
        Object key = degreeOrderedListDK2.get(0);
        degreeOrderedListDK2.remove(0);
       
        ArrayList<Tuple<Integer, Integer, DNVEdge>> nodeEdgeIndex = degreeNodeEdgeIndexTableDK2.get(key);
        for(Tuple<Integer, Integer, DNVEdge> tuple : nodeEdgeIndex){
          DNVNode node1 = graph.getNode(0, tuple.getLeft());
          impNodes.add(node1);
          DNVNode node2 = graph.getNode(0, tuple.getMiddle());
          nodes.add(node1);
          nodes.add(node2);         
          //nodes.add(node2);
          DNVEdge edge = tuple.getRight();
          edges.add(edge);   
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
  private static DNVEntity getNode( String bbid, DNVGraph graph )
  {
    DNVEntity node = graph.getNodeByBbId( bbid );
    if( node == null )
    {
      node = new DNVNode( graph );
      node.setLabel( bbid );
      node.setBbId( bbid );
      ( (DNVNode)node ).setPosition( (float)( Math.random() * 100.0 ), (float)( Math.random() * 100.0 ) );
      graph.addNode( 0, node );
    }
View Full Code Here
31
32
33
34
35
36
37
38
39
40
41
    makeLetter( graph, nodeColor, "i1_dot", i1_dotPositions );
    makeLetter( graph, nodeColor, "i2", i2Positions );
    makeLetter( graph, nodeColor, "i2_dot", i2_dotPositions );
    makeLetter( graph, nodeColor, "s", sPositions );
    List<DNVNode> nodes = generateSeries( graph, 7, nodeColor, "G" );
    DNVNode node = addNode( graph, nodeColor, "G", nodes );
    addEdge( graph, "G", nodes.get( 5 ), node );
    applyPositions( gPositions, nodes );
   
    graph.writeGraph( Settings.GRAPHS_PATH + "WiGis.dnv" );
  }
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
   * @param graph
   * @param length
   */
  private static List<DNVNode> generateSeries( DNVGraph graph, int length, String nodeColor, String type )
  {
    DNVNode previousNode = null;
    List<DNVNode> list = new ArrayList<DNVNode>();
    for( int i = 0; i < length; i++ )
    {
      DNVNode node = addNode( graph, nodeColor, type, list );
      if( previousNode != null )
      {
        addEdge( graph, type, previousNode, node );
      }
     
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.