src/main/java/com/mxgraph/analysis/mxFibonacciHeap.java
public void insert(Node node, double key)
	{
		node.key = key;

		// concatenate node into min list
		if (min != null)
		{
			node.left = min;
			node.right = min.right;
			min.right = node;
			node.right.left = node;

			if (key < min.key)
			{
				min = node;
			}
		}
		else
		{
			min = node;
		}

		size++;
	}
/**
	 * Inserts a new data element into the heap. No heap consolidation is
	 * performed at this time, the new node is simply inserted into the root
	 * list of this heap.
	 * 
	 * <p>
	 * Running time: O(1) actual
	 * </p>
	 * 
	 * @param node
	 *            new node to insert into heap
	 * @param key
	 *            key value associated with data object
	 */
Inserts a new data element into the heap. No heap consolidation is
performed at this time, the new node is simply inserted into the root
list of this heap.



@param node
new node to insert into heap
@param key
key value associated with data object
Inserts a new data element into the heap . No heap consolidation is performed at this time the new node is simply inserted into the root list of this heap . @param node new node to insert into heap @param key key value associated with data object
public void insert(Node node, double key)
	{
		node.key = key;
		if (min != null)
		{
			node.left = min;
			node.right = min.right;
			min.right = node;
			node.right.left = node;
			if (key < min.key)
			{
				min = node;
			}
		}
		else
		{
			min = node;
		}
		size++;
	}
public void insert ( Node node , double key ) { node . key = key ; if ( min != null ) { node . left = min ; node . right = min . right ; min . right = node ; node . right . left = node ; if ( key < min . key ) { min = node ; } } else { min = node ; } size ++ ; }
Inserts a new data element into the heap.
Inserts a new data element into the heap .
// concatenate node into min list