<li><ahref="../../../com/mxgraph/analysis/mxDistanceCostFunction.html"title="class in com.mxgraph.analysis"><spanclass="strong">Prev Class</span></a></li>
<li><ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis"><spanclass="strong">Next Class</span></a></li>
<tdclass="colLast"><code><strong><ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a></strong></code>
<divclass="block">Implements a node of the Fibonacci heap.</div>
</td>
</tr>
</table>
</li>
</ul>
<!-- =========== FIELD SUMMARY =========== -->
<ulclass="blockList">
<liclass="blockList"><aname="field_summary">
<!---->
</a>
<h3>Field Summary</h3>
<tableclass="overviewSummary"border="0"cellpadding="3"cellspacing="0"summary="Field Summary table, listing fields, and an explanation">
<thclass="colFirst"scope="col">Modifier and Type</th>
<thclass="colLast"scope="col">Field and Description</th>
</tr>
<trclass="altColor">
<tdclass="colFirst"><code>protected <ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a></code></td>
<tdclass="colFirst"><code>protected java.util.Map<java.lang.Object,<ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a>></code></td>
<tdclass="colLast"><code><strong><ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.html#cascadingCut(com.mxgraph.analysis.mxFibonacciHeap.Node)">cascadingCut</a></strong>(<ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a> y)</code>
<divclass="block">Performs a cascading cut operation.</div>
<tdclass="colLast"><code><strong><ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.html#cut(com.mxgraph.analysis.mxFibonacciHeap.Node, com.mxgraph.analysis.mxFibonacciHeap.Node)">cut</a></strong>(<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>
<divclass="block">The reverse of the link operation: removes x from the child list of y.</div>
</td>
</tr>
<trclass="rowColor">
<tdclass="colFirst"><code>void</code></td>
<tdclass="colLast"><code><strong><ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.html#decreaseKey(com.mxgraph.analysis.mxFibonacciHeap.Node, double)">decreaseKey</a></strong>(<ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a> x,
double k)</code>
<divclass="block">Decreases the key value for a heap node, given the new value to take on.</div>
</td>
</tr>
<trclass="altColor">
<tdclass="colFirst"><code>void</code></td>
<tdclass="colLast"><code><strong><ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.html#delete(com.mxgraph.analysis.mxFibonacciHeap.Node)">delete</a></strong>(<ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a> x)</code>
<divclass="block">Deletes a node from the heap given the reference to the node.</div>
</td>
</tr>
<trclass="rowColor">
<tdclass="colFirst"><code><ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a></code></td>
<divclass="block">Returns the node that represents element.</div>
</td>
</tr>
<trclass="altColor">
<tdclass="colFirst"><code>void</code></td>
<tdclass="colLast"><code><strong><ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.html#insert(com.mxgraph.analysis.mxFibonacciHeap.Node, double)">insert</a></strong>(<ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a> node,
double key)</code>
<divclass="block">Inserts a new data element into the heap.</div>
<tdclass="colLast"><code><strong><ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.html#link(com.mxgraph.analysis.mxFibonacciHeap.Node, com.mxgraph.analysis.mxFibonacciHeap.Node)">link</a></strong>(<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>
<divclass="block">Make node y a child of node x.</div>
</td>
</tr>
<trclass="rowColor">
<tdclass="colFirst"><code><ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a></code></td>
<divclass="block">Returns the smallest element in the heap.</div>
</td>
</tr>
<trclass="altColor">
<tdclass="colFirst"><code><ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a></code></td>
<divclass="block">Returns the size of the heap which is measured in the number of elements
contained in the heap.</div>
</td>
</tr>
<trclass="altColor">
<tdclass="colFirst"><code>static <ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.html"title="class in com.mxgraph.analysis">mxFibonacciHeap</a></code></td>
<tdclass="colLast"><code><strong><ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.html#union(com.mxgraph.analysis.mxFibonacciHeap, com.mxgraph.analysis.mxFibonacciHeap)">union</a></strong>(<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>
<divclass="block">Joins two Fibonacci heaps into a new one.</div>
<pre>protected java.util.Map<java.lang.Object,<ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a>> nodes</pre>
<divclass="block">Maps from elements to nodes</div>
</li>
</ul>
<aname="min">
<!---->
</a>
<ulclass="blockList">
<liclass="blockList">
<h4>min</h4>
<pre>protected <ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a> min</pre>
<pre>public <ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a> getNode(java.lang.Object element,
<pre>public void decreaseKey(<ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a> x,
double k)</pre>
<divclass="block">Decreases the key value for a heap node, given the new value to take on.
<dl><dt><spanclass="strong">Parameters:</span></dt><dd><code>x</code> - Node whose value should be decreased.</dd><dd><code>k</code> - New key value for node x.</dd>
<pre>public void delete(<ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a> x)</pre>
<divclass="block">Deletes a node from the heap given the reference to the node. The trees
<pre>public void insert(<ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a> node,
double key)</pre>
<divclass="block">Inserts a new data element into the heap. No heap consolidation is
<dl><dt><spanclass="strong">Parameters:</span></dt><dd><code>node</code> - new node to insert into heap</dd><dd><code>key</code> - key value associated with data object</dd></dl>
</li>
</ul>
<aname="min()">
<!---->
</a>
<ulclass="blockList">
<liclass="blockList">
<h4>min</h4>
<pre>public <ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a> min()</pre>
<divclass="block">Returns the smallest element in the heap. This smallest element is the
<dl><dt><spanclass="strong">Returns:</span></dt><dd>Returns the heap node with the smallest key.</dd></dl>
</li>
</ul>
<aname="removeMin()">
<!---->
</a>
<ulclass="blockList">
<liclass="blockList">
<h4>removeMin</h4>
<pre>public <ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a> removeMin()</pre>
<divclass="block">Removes the smallest element from the heap. This will cause the trees in
<pre>public static <ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.html"title="class in com.mxgraph.analysis">mxFibonacciHeap</a> union(<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>
<divclass="block">Joins two Fibonacci heaps into a new one. No heap consolidation is
<pre>protected void cascadingCut(<ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis">mxFibonacciHeap.Node</a> y)</pre>
<divclass="block">Performs a cascading cut operation. This cuts y from its parent and then
<pre>protected void cut(<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>
<divclass="block">The reverse of the link operation: removes x from the child list of y.
<dl><dt><spanclass="strong">Parameters:</span></dt><dd><code>x</code> - The child of y to be removed from y's child list.</dd><dd><code>y</code> - The parent of x about to lose a child.</dd></dl>
<pre>protected void link(<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><dt><spanclass="strong">Parameters:</span></dt><dd><code>y</code> - The node to become child.</dd><dd><code>x</code> - The node to become parent.</dd></dl>
<li><ahref="../../../com/mxgraph/analysis/mxDistanceCostFunction.html"title="class in com.mxgraph.analysis"><spanclass="strong">Prev Class</span></a></li>
<li><ahref="../../../com/mxgraph/analysis/mxFibonacciHeap.Node.html"title="class in com.mxgraph.analysis"><spanclass="strong">Next Class</span></a></li>