📄 datastructures.disjsetsfast.html
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<!--NewPage-->
<html>
<head>
<!-- Generated by javadoc on Sun Sep 27 09:53:38 EDT 1998
-->
<title>
Class DataStructures.DisjSetsFast
</title>
</head>
<body>
<a name="_top_"></a>
<pre>
<a href="packages.html">All Packages</a> <a href="tree.html">Class Hierarchy</a> <a href="Package-DataStructures.html">This Package</a> <a href="DataStructures.DSL.html">Previous</a> <a href="DataStructures.LeftistHeap.html">Next</a> <a href="Index.html">Index</a> </pre>
<hr>
<h1>
Class DataStructures.DisjSetsFast
</h1>
<pre>
java.lang.Object
|
+----DataStructures.DisjSetsFast
</pre>
<hr>
<dl>
<dt>public class <b>DisjSetsFast</b>
<dt>extends Object</dl>
Disjoint set class, using union by rankand path compression.Elements in the set are numbered starting at 0.
<p>
<hr>
<a name="index"></a><h2>
<img src="images/constructor-index.gif" width=275 height=38 alt="Constructor Index">
</h2>
<dl>
<dt><img src="images/yellow-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#DisjSetsFast(int)"><b>DisjSetsFast</b></a>(int)
<dd>Construct the disjoint sets object.
</dl>
<h2>
<img src="images/method-index.gif" width=207 height=38 alt="Method Index">
</h2>
<dl>
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#find(int)"><b>find</b></a>(int)
<dd>Perform a find with path compression.
<dt><img src="images/green-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#main(java.lang.String[])"><b>main</b></a>(String[])
<dd>
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#union(int, int)"><b>union</b></a>(int, int)
<dd>Union two disjoint sets using the height heuristic.
</dl>
<a name="constructors"></a><h2>
<img src="images/constructors.gif" width=231 height=38 alt="Constructors">
</h2>
<a name="DisjSetsFast"></a><a name="DisjSetsFast"></a><a name="DisjSetsFast(int)"><img src="images/yellow-ball.gif" width=12 height=12 alt=" o ">
</a><b>DisjSetsFast</b>
<pre>
public DisjSetsFast(int numElements)</pre>
<dl>
<dd>Construct the disjoint sets object.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>numElements - the initial number of disjoint sets.
</dl>
</dd>
</dl>
<a name="methods"></a><h2>
<img src="images/methods.gif" width=151 height=38 alt="Methods">
</h2>
<a name="union"></a><a name="union(int, int)"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>union</b>
<pre>
public void union(int root1, int root2)</pre>
<dl>
<dd>Union two disjoint sets using the height heuristic.For simplicity, we assume root1 and root2 are distinctand represent set names.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>root1 - the root of set 1.
<dd>root2 - the root of set 2.
</dl>
</dd>
</dl>
<a name="find"></a><a name="find(int)"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>find</b>
<pre>
public int find(int x)</pre>
<dl>
<dd>Perform a find with path compression.Error checks omitted again for simplicity.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>x - the element being searched for.
<dt><b>Returns:</b>
<dd>the set containing x.</dl>
</dd>
</dl>
<a name="main"></a><a name="main(java.lang.String[])"><img src="images/green-ball.gif" width=12 height=12 alt=" o ">
</a><b>main</b>
<pre>
public static void main(String[] args)</pre>
<dl>
</dl>
<hr>
<pre>
<a href="packages.html">All Packages</a> <a href="tree.html">Class Hierarchy</a> <a href="Package-DataStructures.html">This Package</a> <a href="DataStructures.DSL.html">Previous</a> <a href="DataStructures.LeftistHeap.html">Next</a> <a href="Index.html">Index</a> </pre>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -