Examples of DNVNode

net.wigis.graph.dnv.DNVNode
A node representation. @author Brynjar Gretarsson

Examples of net.wigis.graph.dnv.DNVNode

  {
    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

Examples of net.wigis.graph.dnv.DNVNode

  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

Examples of net.wigis.graph.dnv.DNVNode

   *            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

Examples of net.wigis.graph.dnv.DNVNode

   *            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

Examples of net.wigis.graph.dnv.DNVNode

   *            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

Examples of net.wigis.graph.dnv.DNVNode

        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

Examples of net.wigis.graph.dnv.DNVNode

   */
  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

Examples of net.wigis.graph.dnv.DNVNode

   *            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

Examples of net.wigis.graph.dnv.DNVNode

   * @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

Examples of net.wigis.graph.dnv.DNVNode

      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

0 1 2 3 4 5

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.