Package net.wigis.graph.dnv.utilities

Examples of net.wigis.graph.dnv.utilities.Vector3D

46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
    int nodeCnt = 0;
   
   
    //map each nodeId to appropriate level
    for(int index : gaps){     
      Vector3D color = new Vector3D( (float)Math.max( 0.3, Math.random() ), (float)Math.max( 0.3, Math.random() ), (float)Math.max( 0.3, Math
          .random() ) );
      ArrayList<DNVNode> levelNodes = new ArrayList<DNVNode>();
      for(int i = lastVistedIndex; i < index; i++){
        Integer degree = (Integer) degreeOrderedListDK1.get(i);
        for(DNVNode node : degreeNodeTableDK1.get(degree)){
          nodeIdToLevel.put(node.getId(), currentLevel);
          levelNodes.add(node);
          node.setColor(color);
        }
      }
      levelToNodeList.put(currentLevel, levelNodes);
      System.out.println("gap" + index + "current level " + currentLevel + " number of nodes " + levelNodes.size());
      nodeCnt += levelNodes.size();
      currentLevel--;
      lastVistedIndex = index;
    }
    Vector3D color = new Vector3D( (float)Math.max( 0.3, Math.random() ), (float)Math.max( 0.3, Math.random() ), (float)Math.max( 0.3, Math
        .random() ) );
    ArrayList<DNVNode> levelNodes = new ArrayList<DNVNode>();
    for(int i = lastVistedIndex; i < degreeOrderedListDK1.size(); i++){
      Integer degree = (Integer) degreeOrderedListDK1.get(i);
      for(DNVNode node : degreeNodeTableDK1.get(degree)){
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
    newNode.setLevel( newLevel.intValue() );
    newNode.setFirstChild( tempNode );
    graph.addNode( newLevel, newNode );
    if( multicolor && newLevel == 1 )
    {
      Vector3D color = new Vector3D( (float)Math.max( 0.3, Math.random() ), (float)Math.max( 0.3, Math.random() ), (float)Math.max( 0.3, Math
          .random() ) );
      newNode.setColor( color );
    }
    else
    {
      Vector3D color = new Vector3D( tempNode.getColor() );
      newNode.setColor( color );
    }

    nodeDistance.put( tempNode.getId(), Integer.valueOf( 0 ) );
    nodeToParent.put( tempNode.getId(), newNode );
View Full Code Here
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
    {
      tempLine = line.substring( line.indexOf( checkString ) + checkString.length() );
      tempLine = tempLine.substring( 0, tempLine.indexOf( "\"" ) );
      if( !tempLine.equals( "null" ) )
      {
        labelColor = new Vector3D( tempLine );
        if( labelColor.getX() > 1 )
          labelColor.setX( 1 );
        if( labelColor.getY() > 1 )
          labelColor.setY( 1 );
        if( labelColor.getZ() > 1 )
          labelColor.setZ( 1 );
        if( labelColor.getX() < 0 )
          labelColor.setX( 0 );
        if( labelColor.getY() < 0 )
          labelColor.setY( 0 );
        if( labelColor.getZ() < 0 )
          labelColor.setZ( 0 );
      }
    }
    checkString = " LabelOutlineColor=\"";
    if( line.contains( checkString ) )
    {
      tempLine = line.substring( line.indexOf( checkString ) + checkString.length() );
      tempLine = tempLine.substring( 0, tempLine.indexOf( "\"" ) );
      if( !tempLine.equals( "null" ) )
      {
        labelOutlineColor = new Vector3D( tempLine );
        if( labelOutlineColor.getX() > 1 )
          labelOutlineColor.setX( 1 );
        if( labelOutlineColor.getY() > 1 )
          labelOutlineColor.setY( 1 );
        if( labelOutlineColor.getZ() > 1 )
          labelOutlineColor.setZ( 1 );
        if( labelOutlineColor.getX() < 0 )
          labelOutlineColor.setX( 0 );
        if( labelOutlineColor.getY() < 0 )
          labelOutlineColor.setY( 0 );
        if( labelOutlineColor.getZ() < 0 )
          labelOutlineColor.setZ( 0 );
      }
    }
    checkString = " OutlineColor=\"";
    if( line.contains( checkString ) )
    {
      tempLine = line.substring( line.indexOf( checkString ) + checkString.length() );
      tempLine = tempLine.substring( 0, tempLine.indexOf( "\"" ) );
      if( !tempLine.equals( "null" ) )
      {
        outlineColor = new Vector3D( tempLine );
        if( outlineColor.getX() > 1 )
          outlineColor.setX( 1 );
        if( outlineColor.getY() > 1 )
          outlineColor.setY( 1 );
        if( outlineColor.getZ() > 1 )
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
    node = nodes.get( 0 );
    int maxNumDocuments = Integer.parseInt( node.getProperty( "numDocuments" ) );
    System.out.println( "Max number of docs " + maxNumDocuments );
    for( DNVNode tempNode : nodes )
    {
      Vector3D color = new Vector3D( LIGHT_GREEN );
      if( tempNode.hasProperty( "numDocuments" ) )
      {
        Vector3D difference = new Vector3D( LIGHT_RED );
        difference.subtract( color );
        difference.dotProduct( (float)(Integer.parseInt( tempNode.getProperty( "numDocuments" ) ) )/(float)maxNumDocuments );
        color.add( difference );
        color.setX( (float)Math.max( 0, color.getX() ) );
        color.setY( (float)Math.max( 0, color.getY() ) );
        color.setZ( (float)Math.max( 0, color.getZ() ) );
        color.setX( (float)Math.min( 1, color.getX() ) );
View Full Code Here
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
    newNode.setLevel( newLevel.intValue() );
    newNode.setFirstChild( tempNode );
    graph.addNode( newLevel, newNode );
    if( multicolor && newLevel == 1 )
    {
      Vector3D color = new Vector3D( (float)Math.max( 0.3, Math.random() ), (float)Math.max( 0.3, Math.random() ), (float)Math.max( 0.3, Math
          .random() ) );
      newNode.setColor( color );
    }
    else
    {
      Vector3D color = new Vector3D( tempNode.getColor() );
      newNode.setColor( color );
    }

    nodeDistance.put( tempNode.getId(), Integer.valueOf( 0 ) );
    nodeToParent.put( tempNode.getId(), newNode );
View Full Code Here
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
    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() );
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
        {
          System.out.println( n.getNodeName() + " " );
          dnvnode.setLabel( "TRANS: " + clean( n.getTextContent() ) );
          dnvnode.setRadius( 2 );
          dnvnode.setPosition( (float)Math.random(), (float)Math.random() );
          dnvnode.setColor( new Vector3D( 0.1f, 0.5f, 0.9f ) );
          System.out.println( n.getTextContent() + " " );
        }
        // file case
        else if( n.getNodeName().equals( "localId" ) )
        {
          System.out.println( n.getNodeName() + " " );
          dnvnode.setLabel( "FILE: " + clean( n.getTextContent() ) );
          dnvnode.setRadius( 3 );
          dnvnode.setPosition( (float)Math.random(), (float)Math.random() );
          dnvnode.setColor( new Vector3D( 0.0f, 0.9f, 0.1f ) );
          System.out.println( n.getTextContent() + " " );
        }

        else if( n.getNodeName().equals( "from" ) )
        {
View Full Code Here
3611
3612
3613
3614
3615
3616
3617
3618
3619
3620
3621
      List<DNVNode> nodes = getNodes(0);
      if(propertyValues == null){
        return;
      }
      String[] valuesArr = propertyValues.split("\t");
      Vector3D color = new Vector3D( (float)Math.max( 0.3, Math.random() ), (float)Math.max( 0.3, Math.random() ), (float)Math.max( 0.3, Math.random() ) );
      HashMap<String, DNVNode> propertyToNode = new HashMap<String, DNVNode>();
      for(int i = 0; i < valuesArr.length; i++){
        DNVNode newNode = new DNVNode(this);
        newNode.setColor( color );
        propertyToNode.put(valuesArr[i], newNode);
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
    ArrayList<Vector3D> chunkColors = new ArrayList<Vector3D>();
    ArrayList<Double> chunkSizes = new ArrayList<Double>();
    ArrayList<String> currentChunk = null;
    ArrayList<Integer> offsets = new ArrayList<Integer>();
    int currentOffset = 0;
    Vector3D currentColor;
    double currentSize;
    final int OFFSET_DIFFERENCE = 100000;
    String line = "";
    try
    {
View Full Code Here
217
218
219
220
221
222
223
224
225
226
    {
      String workString = line.substring( line.indexOf( "@COLOR" ) );
      workString = workString.substring( workString.indexOf( "[" ) );
      workString = workString.substring( 0, workString.indexOf( "]" ) + 1 );
      workString = workString.trim();
      return new Vector3D( workString );
    }

    return DEFAULT_COLOR;
  }
View Full Code Here
TOP

Related Classes of net.wigis.graph.dnv.utilities.Vector3D

  • net.wigis.graph.data.citeseer.SearchBean
  • net.wigis.graph.data.uploader.ReadCSVtoDNVGraph
  • net.wigis.graph.data.uploader.XMLToDNV
  • net.wigis.graph.data.utilities.ConvertPurdueDataToDNV
  • net.wigis.graph.data.utilities.DetermineAuthorExpertise
  • net.wigis.graph.dnv.animations.RecursiveEdgeAnimation
  • net.wigis.graph.dnv.clustering.ConnectedClustering
  • net.wigis.graph.dnv.clustering.DK1Clustering
  • net.wigis.graph.dnv.clustering.KMostConnected
  • net.wigis.graph.dnv.clustering.StructuralEquivalenceClustering
    • 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.