<AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true"title="class or interface in java.lang">java.lang.Object</A>
<IMGSRC="../../../resources/inherit.gif"ALT="extended by "><B>com.mxgraph.analysis.mxFibonacciHeap</B>
</PRE>
<HR>
<DL>
<DT><PRE>public class <B>mxFibonacciHeap</B><DT>extends <AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true"title="class or interface in java.lang">Object</A></DL>
<CODE>protected <AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A></CODE></FONT></TD>
<CODE>protected <AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/util/Map.html?is-external=true"title="class or interface in java.util">Map</A><<AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true"title="class or interface in java.lang">Object</A>,<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A>></CODE></FONT></TD>
<TD><CODE><B><AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.html#cascadingCut(com.mxgraph.analysis.mxFibonacciHeap.Node)">cascadingCut</A></B>(<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> y)</CODE>
<BR>
Performs a cascading cut operation.</TD>
<TD><CODE><B><AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.html#cut(com.mxgraph.analysis.mxFibonacciHeap.Node, com.mxgraph.analysis.mxFibonacciHeap.Node)">cut</A></B>(<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> x,
<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> y)</CODE>
<BR>
The reverse of the link operation: removes x from the child list of y.</TD>
<TD><CODE><B><AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.html#decreaseKey(com.mxgraph.analysis.mxFibonacciHeap.Node, double)">decreaseKey</A></B>(<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> x,
double k)</CODE>
<BR>
Decreases the key value for a heap node, given the new value to take on.</TD>
<TD><CODE><B><AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.html#delete(com.mxgraph.analysis.mxFibonacciHeap.Node)">delete</A></B>(<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> x)</CODE>
<BR>
Deletes a node from the heap given the reference to the node.</TD>
<CODE> <AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A></CODE></FONT></TD>
<TD><CODE><B><AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.html#getNode(java.lang.Object, boolean)">getNode</A></B>(<AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true"title="class or interface in java.lang">Object</A> element,
boolean create)</CODE>
<BR>
Returns the node that represents element.</TD>
<TD><CODE><B><AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.html#insert(com.mxgraph.analysis.mxFibonacciHeap.Node, double)">insert</A></B>(<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> node,
double key)</CODE>
<BR>
Inserts a new data element into the heap.</TD>
<TD><CODE><B><AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.html#link(com.mxgraph.analysis.mxFibonacciHeap.Node, com.mxgraph.analysis.mxFibonacciHeap.Node)">link</A></B>(<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> y,
<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> x)</CODE>
<BR>
Make node y a child of node x.</TD>
<CODE> <AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A></CODE></FONT></TD>
<CODE> <AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A></CODE></FONT></TD>
<CODE>static <AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.html"title="class in com.mxgraph.analysis">mxFibonacciHeap</A></CODE></FONT></TD>
<TD><CODE><B><AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.html#union(com.mxgraph.analysis.mxFibonacciHeap, com.mxgraph.analysis.mxFibonacciHeap)">union</A></B>(<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.html"title="class in com.mxgraph.analysis">mxFibonacciHeap</A> h1,
<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.html"title="class in com.mxgraph.analysis">mxFibonacciHeap</A> h2)</CODE>
<BR>
Joins two Fibonacci heaps into a new one.</TD>
<THALIGN="left"><B>Methods inherited from class java.lang.<AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true"title="class or interface in java.lang">Object</A></B></TH>
</TR>
<TRBGCOLOR="white"CLASS="TableRowColor">
<TD><CODE><AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true#clone()"title="class or interface in java.lang">clone</A>, <AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true#equals(java.lang.Object)"title="class or interface in java.lang">equals</A>, <AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true#finalize()"title="class or interface in java.lang">finalize</A>, <AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true#getClass()"title="class or interface in java.lang">getClass</A>, <AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true#hashCode()"title="class or interface in java.lang">hashCode</A>, <AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true#notify()"title="class or interface in java.lang">notify</A>, <AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true#notifyAll()"title="class or interface in java.lang">notifyAll</A>, <AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true#toString()"title="class or interface in java.lang">toString</A>, <AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true#wait()"title="class or interface in java.lang">wait</A>, <AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true#wait(long)"title="class or interface in java.lang">wait</A>, <AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true#wait(long, int)"title="class or interface in java.lang">wait</A></CODE></TD>
protected <AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/util/Map.html?is-external=true"title="class or interface in java.util">Map</A><<AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true"title="class or interface in java.lang">Object</A>,<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A>><B>nodes</B></PRE>
<DL>
<DD>Maps from elements to nodes
<P>
<DL>
</DL>
</DL>
<HR>
<ANAME="min"><!----></A><H3>
min</H3>
<PRE>
protected <AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A><B>min</B></PRE>
public <AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A><B>getNode</B>(<AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/Object.html?is-external=true"title="class or interface in java.lang">Object</A> element,
public void <B>decreaseKey</B>(<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> x,
double k)</PRE>
<DL>
<DD>Decreases the key value for a heap node, given the new value to take on.
The structure of the heap may be changed and will not be consolidated.
<p>
Running time: O(1) amortized
</p>
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>x</CODE> - Node whose value should be decreased.<DD><CODE>k</CODE> - New key value for node x.
<DT><B>Throws:</B>
<DD><CODE><AHREF="http://download.oracle.com/javase/1.5.0/docs/api/java/lang/IllegalArgumentException.html?is-external=true"title="class or interface in java.lang">IllegalArgumentException</A></CODE> - Thrown if k is larger than x.key value.</DL>
public void <B>delete</B>(<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> x)</PRE>
<DL>
<DD>Deletes a node from the heap given the reference to the node. The trees
in the heap will be consolidated, if necessary. This operation may fail
to remove the correct element if there are nodes with key value
-Infinity.
<p>
Running time: O(log n) amortized
</p>
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>x</CODE> - The node to remove from the heap.</DL>
public void <B>insert</B>(<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> node,
double key)</PRE>
<DL>
<DD>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>
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>node</CODE> - new node to insert into heap<DD><CODE>key</CODE> - key value associated with data object</DL>
</DD>
</DL>
<HR>
<ANAME="min()"><!----></A><H3>
min</H3>
<PRE>
public <AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A><B>min</B>()</PRE>
<DL>
<DD>Returns the smallest element in the heap. This smallest element is the
one with the minimum key value.
<p>
Running time: O(1) actual
</p>
<P>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the heap node with the smallest key.</DL>
</DD>
</DL>
<HR>
<ANAME="removeMin()"><!----></A><H3>
removeMin</H3>
<PRE>
public <AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A><B>removeMin</B>()</PRE>
<DL>
<DD>Removes the smallest element from the heap. This will cause the trees in
the heap to be consolidated, if necessary.
Does not remove the data node so that the current key remains stored.
<p>
Running time: O(log n) amortized
</p>
<P>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the node with the smallest key.</DL>
</DD>
</DL>
<HR>
<ANAME="size()"><!----></A><H3>
size</H3>
<PRE>
public int <B>size</B>()</PRE>
<DL>
<DD>Returns the size of the heap which is measured in the number of elements
contained in the heap.
<p>
Running time: O(1) actual
</p>
<P>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the number of elements in the heap.</DL>
public static <AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.html"title="class in com.mxgraph.analysis">mxFibonacciHeap</A><B>union</B>(<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.html"title="class in com.mxgraph.analysis">mxFibonacciHeap</A> h1,
<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.html"title="class in com.mxgraph.analysis">mxFibonacciHeap</A> h2)</PRE>
<DL>
<DD>Joins two Fibonacci heaps into a new one. No heap consolidation is
performed at this time. The two root lists are simply joined together.
<p>
Running time: O(1) actual
</p>
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>h1</CODE> - The first heap.<DD><CODE>h2</CODE> - The second heap.
<DT><B>Returns:</B><DD>Returns a new heap containing h1 and h2.</DL>
protected void <B>cascadingCut</B>(<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> y)</PRE>
<DL>
<DD>Performs a cascading cut operation. This cuts y from its parent and then
does the same for its parent, and so on up the tree.
<p>
Running time: O(log n); O(1) excluding the recursion
</p>
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>y</CODE> - The node to perform cascading cut on.</DL>
</DD>
</DL>
<HR>
<ANAME="consolidate()"><!----></A><H3>
consolidate</H3>
<PRE>
protected void <B>consolidate</B>()</PRE>
<DL>
<DD>Consolidates the trees in the heap by joining trees of equal degree until
there are no more trees of equal degree in the root list.
protected void <B>cut</B>(<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> x,
<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> y)</PRE>
<DL>
<DD>The reverse of the link operation: removes x from the child list of y.
This method assumes that min is non-null.
<p>
Running time: O(1)
</p>
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>x</CODE> - The child of y to be removed from y's child list.<DD><CODE>y</CODE> - The parent of x about to lose a child.</DL>
protected void <B>link</B>(<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> y,
<AHREF="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</A> x)</PRE>
<DL>
<DD>Make node y a child of node x.
<p>
Running time: O(1) actual
</p>
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>y</CODE> - The node to become child.<DD><CODE>x</CODE> - The node to become parent.</DL>
