* Copyright (c) 2010, University of California, Santa Barbara

* All rights reserved.

*

* Redistribution and use in source and binary forms, with or without modification, are

* permitted provided that the following conditions are met:

*

*    * Redistributions of source code must retain the above copyright notice, this list of

*      conditions and the following disclaimer.

*    * Redistributions in binary form must reproduce the above copyright notice, this list of

*      conditions and the following disclaimer in the documentation and/or other materials

*      provided with the distribution.

*

* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR

* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND

* FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR

* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL

* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,

* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER

* IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF

* THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

*

*****************************************************************************************************/

* A node representation.

*

* @author Brynjar Gretarsson

*

*/

  /** The Constant serialVersionUID. */

  private static final long serialVersionUID = -702075942060618434L;

  /** The Constant MAX_FORCE. */

  public static float MAX_FORCE = 5;

  /** The MI n_ force. */

  public static float MIN_FORCE = 0.005f;

  /** The HIGHE r_ min. */

  public static float HIGHER_MIN = 0.1f;

  // private static final float THRESHOLD = 2;

  /** The Constant NODE_SIZE. */

  public static final float NODE_SIZE = 1.0f;

  /** The Constant MAX_NODE_SIZE. */

  public static final float MAX_NODE_SIZE = 15.0f;

  // private Vector2D previousPosition = new Vector2D();

  /** The position. */

  private Vector2D position = new Vector2D();

 

  public float dx = 0;

  public float dy = 0;

  public boolean justMadeLocal = false;

  public int repulsion = 10;

  /** The original position. */

  private Vector2D originalPosition = null;

  /** The display position. */

  private Vector2D displayPosition = null;

  /** The icon. */

  private String icon = "";

  /** The icon image. */

  private Map<Integer, Image> iconImage = new HashMap<Integer, Image>();

  // private List<BBNode> neighborList = new ArrayList<BBNode>();

  /** The sub graph. */

  private SubGraph subGraph;

  /** The sub node ids. */

  private List<Integer> subNodeIds = new ArrayList<Integer>();

  /** The previous force strength. */

  private float previousForceStrength = 0;

  /** The force. */

  protected Vector2D force = new Vector2D( 0, 0 );

  // private Vector2D oldForce = new Vector2D( 0, 0 );

  /** The acceleration. */

  private Vector2D acceleration = new Vector2D( 0, 0 );

  /** The velocity. */

  private Vector2D velocity = new Vector2D( 0, 0 );

  /** The Constant DEFAULT_TIMESTEP. */

  public static float DEFAULT_TIMESTEP = 0.6f;

  /** The time step. */

  public static float timeStep[] = { DEFAULT_TIMESTEP / 2.0f, DEFAULT_TIMESTEP };

  /** The mass. */

  private float mass = 1.0f;

  // private boolean anchor = false;

  // private boolean selected = false;

  /** The positioned. */

  private boolean positioned = false;

  /** The fixed. */

  private boolean fixed = false;

  /** The expandable. */

  private boolean expandable = false;

  /** The hide label background. */

  private boolean hideLabelBackground = false;

  /** The curved label. */

  private boolean curvedLabel = false;

  /** The radius. */

  private float radius = NODE_SIZE;

  /** The distance from cluster. */

  private int distanceFromCluster = Integer.MAX_VALUE;

  // Interpolation method variables

  // This is the actual distance based on the edge lengths

  /** The actual distance from selected node. */

  private float actualDistanceFromSelectedNode = Integer.MAX_VALUE;

  // This is the number of hops

  /** The distance from selected node. */

  private int distanceFromSelectedNode = Integer.MAX_VALUE;

  /** The distance from node with id. */

  private Map<Integer, Integer> distanceFromNodeWithId = new HashMap<Integer, Integer>();

  /** The nodes at distance. */

  private Map<Integer, Map<Integer, DNVNode>> nodesAtDistance = new HashMap<Integer, Map<Integer, DNVNode>>();

  /** The interpolation weight. */

  private Map<Integer, Float> interpolationWeight = new HashMap<Integer, Float>();

  /** The parent node. */

  private DNVNode parentNode = null;

  /** The first child. */

  private DNVNode firstChild = null;

  /** The facebook can add. */

  private boolean facebookCanAdd = false;

  // Used for the facebook layout

  /** The distance from center node. */

  private float distanceFromCenterNode = Float.POSITIVE_INFINITY;

  /** The diameter of subnodes. */

  private float diameterOfSubnodes = 1;

  private Map<Integer, DNVEdge> edgesByNeighborId = new HashMap<Integer, DNVEdge>();

  /** The neighbors. */

  protected Map<Integer, DNVNode> neighbors = new HashMap<Integer, DNVNode>();

  /** The from edges. */

  protected Map<Integer, DNVEdge> fromEdges = new HashMap<Integer, DNVEdge>();

  /** The to edges. */

  protected Map<Integer, DNVEdge> toEdges = new HashMap<Integer, DNVEdge>();

  /** The selected neighbors. */

  protected Map<Integer, DNVNode> selectedNeighbors = new HashMap<Integer, DNVNode>();

  /** The visible neighbors. */

  protected Map<Integer, DNVNode> visibleNeighbors = new HashMap<Integer, DNVNode>();

  /** The visible from edges. */

  protected Map<Integer, DNVEdge> visibleFromEdges = new HashMap<Integer, DNVEdge>();

  /** The visible to edges. */

  protected Map<Integer, DNVEdge> visibleToEdges = new HashMap<Integer, DNVEdge>();

  // private Map<Integer, DNVNode> repelledNodes = new HashMap<Integer,

  // DNVNode>();

  // blackbook id - added by alex

  /** The decorator. */

  private ResourceDecorator decorator;

  /** The details expanded. */

  private boolean detailsExpanded = true;

  /** The position change callback. */

  private PositionChangeCallBack positionChangeCallback = null;

  /**

   * Logger.

   *

   * @param graph

   *            the graph

   */

  // // private static Log logger = LogFactory.getLog( DNVNode.class );

 

  public static void p(Object o)

  {

    System.out.println(o);

  }

 

  public static void pe(Object o)

  {

    System.err.println(o);

  }

  // alex

  public DNVNode()

  {

    super();

    initAttributesForTGL();

  }

  public DNVNode( DNVGraph graph )

  {

    super( graph );

    initialize( position, "", graph );

  }

  /**

   * Instantiates a new dNV node.

   *

   * @param decorator

   *            the decorator

   * @param graph

   *            the graph

   */

  public DNVNode( ResourceDecorator decorator, DNVGraph graph )

  {

    super( graph );

    this.decorator = decorator;

    setColor( decorator.getDatasourceColor() );

    this.bbId = decorator.getUri();

    initialize( position, decorator.getLabel(), graph );

    setProperty( "Description", decorator.getDescription() );

    setProperty( "URI", decorator.getUri() );

    ResourceDetails details = decorator.getDetails();

    if( details != null )

    {

      String contents = details.getLabel() + "\n\n" + details.getValue();

      setProperty( "Contents", contents );

      setProperty( "Field", details.getField() );

      setProperty( "Label", details.getLabel() );

    }

    else

    {

      setProperty( "Contents", decorator.getDescription() );

    }

    initAttributesForTGL();

  }

  /**

   * Instantiates a new dNV node.

   *

   * @param position

   *            the position

   * @param graph

   *            the graph

   */

  public DNVNode( Vector2D position, DNVGraph graph )

  {

    super( graph );

    initialize( position, "", graph );

  }

  /**

   * Instantiates a new dNV node.

   *

   * @param position

   *            the position

   * @param label

   *            the label

   * @param graph

   *            the graph

   */

  public DNVNode( Vector2D position, String label, DNVGraph graph )

  {

    super( graph );

    initialize( position, label, graph );

  }

  /**

   * Instantiates a new dNV node.

   *

   * @param level

   *            the level

   * @param size

   *            the size

   * @param position

   *            the position

   * @param graph

   *            the graph

   */

  public DNVNode( String level, String size, Vector2D position, DNVGraph graph )

  {

    super( graph );

    this.level = Integer.parseInt( level );

    this.position = position;

    this.radius = Float.parseFloat( size );

    this.mass = this.radius;

    initialize( this.position, "", graph );

  }

  /**

   * Instantiates a new dNV node.

   *

   * @param level

   *            the level

   * @param size

   *            the size

   * @param graph

   *            the graph

   */

  public DNVNode( String level, String size, DNVGraph graph )

  {