Package net.wigis.graph.dnv

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

77
78
79
80
81
82
83
84
85
86
87
        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
92
93
94
95
96
97
98
99
100
101
102
        if( n.getNodeName().equals( "uuid" ) )
        {
          dnvnode = new DNVNode( g );
          uuid = clean( n.getTextContent() );
          g.addNode( 0, dnvnode );
          nodeIdMap.put( uuid, dnvnode );
        }
        // transformation case
        else if( n.getNodeName().equals( "name" ) )
        {
View Full Code Here
128
129
130
131
132
133
134
135
136
137
138
          Logger.write( "Fromid is: " + fromid );
          Logger.write( "toid is: " + toid );
          DNVEdge dnvedge = new DNVEdge( 0, 1.0f, false, ( nodeIdMap.get( fromid ) ), nodeIdMap.get( toid ), g );
          dnvedge.setId( edgeID );
          edgeID++;
          g.addNode( 0, dnvedge );
        }

      }

    }
View Full Code Here
154
155
156
157
158
159
160
161
162
163
164
          dnvNode.setLevel( 0 );
          dnvNode.setId( Integer.parseInt( currentLineArray.get( 0 ) ) );
          dnvNode.setLabel( currentLineArray.get( 1 ) );
          dnvNode.setColor( currentColor );
          dnvNode.setRadius( (float)currentSize );
          dnvGraph.addNode( 0, dnvNode );
        }
        else if( currentChunkType.equals( "@EDGES" ) )
        {
          fromId = Integer.parseInt( currentLineArray.get( 0 ) );
          toId = Integer.parseInt( currentLineArray.get( 1 ) );
View Full Code Here
167
168
169
170
171
172
173
174
175
176
177
          dnvEdge.setId( currentOffset + j );
          fromNode = (DNVNode)dnvGraph.getNodeById( fromId );
          toNode = (DNVNode)dnvGraph.getNodeById( toId );
          dnvEdge.setFrom( fromNode );
          dnvEdge.setTo( toNode );
          dnvGraph.addNode( 0, dnvEdge );
        }
      }
    }

    return dnvGraph;
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
          tupos.add(new Pair<Integer, Integer>(ind1, ind2));
          line = br.readLine();
        }
        for(int i = minIndex; i <= maxIndex; i++){
          DNVNode node = new DNVNode(graph);
          graph.addNode(0, node);
        }
        for(Pair<Integer, Integer> eIndex : tupos){
          DNVEdge edge = new DNVEdge(graph);
          edge.setFrom(graph.getNode(0, eIndex.getFirst() - minIndex));
          edge.setTo(graph.getNode(0, eIndex.getSecond() - minIndex));
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
        {
          fromNode = new DNVNode( graph );
          fromNode.setLabel( fromNodeInfo[0] );
          fromNode.setBbId( fromNodeInfo[1] );
          fromNode.setPosition( (float)Math.random(), (float)Math.random() );
          graph.addNode( 0, fromNode );
        }

        toNodeInfo = (String[])nodeFileList.get( to - 1 );
        toNode = (DNVNode)graph.getNodeByBbId( toNodeInfo[1] );
        if( toNode == null )
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
        {
          toNode = new DNVNode( graph );
          toNode.setLabel( toNodeInfo[0] );
          toNode.setBbId( toNodeInfo[1] );
          toNode.setPosition( (float)Math.random(), (float)Math.random() );
          graph.addNode( 0, toNode );
        }

        edgeInfo = (String[])linkFileList.get( lineIndex );
        edge = new DNVEdge( fromNode, toNode, graph );
        edge.setLabel( edgeInfo[1] + ", " + edgeInfo[3] + ", " + edgeInfo[5] + ", " + edgeInfo[6] + ", " + edgeInfo[7] );
View Full Code Here
136
137
138
139
140
141
142
143
144
145
146
        }

        edgeInfo = (String[])linkFileList.get( lineIndex );
        edge = new DNVEdge( fromNode, toNode, graph );
        edge.setLabel( edgeInfo[1] + ", " + edgeInfo[3] + ", " + edgeInfo[5] + ", " + edgeInfo[6] + ", " + edgeInfo[7] );
        graph.addNode( 0, edge );

        line = graphFileReader.readLine();
        lineIndex++;
      }
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.