Function
Static Public Summary | ||
public |
LinkedListNode(value: *) |
|
public |
Node(value: *) |
|
public |
Node(value: *) |
|
public |
RankedTreeNode(value: *) |
|
public |
find(node: *): * |
|
public |
find(node: *): * |
|
public |
find(node: *): * |
|
public |
find(node: *): * |
|
public |
find(node: *): * |
|
public |
find(node: *): * |
|
public |
linkedlistbackfind(node: *): * |
|
public |
rankedtreeunion(a: *, b: *): * |
|
public |
union(a: *, b: *): * |
|
public |
union(a: *, b: *): * |
|
public |
union(a: *, b: *): * |
|
public |
union(a: *, b: *): * |
Static Private Summary | ||
private |
_makeset(Node: *): * |
|
private |
_prototype(DisjointSet: *, union: *, find: *) |
Static Public
public LinkedListNode(value: *) source
import LinkedListNode from '@union-find/non-contiguous/src/fundamentals/LinkedListNode.js'
Params:
Name | Type | Attribute | Description |
value | * |
public Node(value: *) source
import {Node} from '@union-find/non-contiguous/src/adt/Forest.js'
Params:
Name | Type | Attribute | Description |
value | * |
public Node(value: *) source
import {Node} from '@union-find/non-contiguous/src/adt/LinkedListWithHeadAndLength.js'
Params:
Name | Type | Attribute | Description |
value | * |
public RankedTreeNode(value: *) source
import RankedTreeNode from '@union-find/non-contiguous/src/fundamentals/RankedTreeNode.js'
Params:
Name | Type | Attribute | Description |
value | * |
public find(node: *): * source
import {find} from '@union-find/non-contiguous/src/adt/Forest.js'
Params:
Name | Type | Attribute | Description |
node | * |
Return:
* |
public find(node: *): * source
import {find} from '@union-find/non-contiguous/src/adt/ForestAmortizedHalving.js'
Params:
Name | Type | Attribute | Description |
node | * |
Return:
* |
public find(node: *): * source
import {find} from '@union-find/non-contiguous/src/adt/ForestAmortizedRecursive.js'
Params:
Name | Type | Attribute | Description |
node | * |
Return:
* |
public find(node: *): * source
import {find} from '@union-find/non-contiguous/src/adt/ForestAmortizedSplitting.js'
Params:
Name | Type | Attribute | Description |
node | * |
Return:
* |
public find(node: *): * source
import {find} from '@union-find/non-contiguous/src/adt/ForestAmortizedTwoPasses.js'
Params:
Name | Type | Attribute | Description |
node | * |
Return:
* |
public find(node: *): * source
import {find} from '@union-find/non-contiguous/src/adt/LinkedList.js'
Params:
Name | Type | Attribute | Description |
node | * |
Return:
* |
public linkedlistbackfind(node: *): * source
import linkedlistbackfind from '@union-find/non-contiguous/src/fundamentals/linkedlistbackfind.js'
Params:
Name | Type | Attribute | Description |
node | * |
Return:
* |
public rankedtreeunion(a: *, b: *): * source
import rankedtreeunion from '@union-find/non-contiguous/src/fundamentals/rankedtreeunion.js'
Params:
Name | Type | Attribute | Description |
a | * | ||
b | * |
Return:
* |
public union(a: *, b: *): * source
import {union} from '@union-find/non-contiguous/src/adt/Forest.js'
Params:
Name | Type | Attribute | Description |
a | * | ||
b | * |
Return:
* |
public union(a: *, b: *): * source
import {union} from '@union-find/non-contiguous/src/adt/LinkedList.js'
Params:
Name | Type | Attribute | Description |
a | * | ||
b | * |
Return:
* |
public union(a: *, b: *): * source
import {union} from '@union-find/non-contiguous/src/adt/LinkedListWithHead.js'
Params:
Name | Type | Attribute | Description |
a | * | ||
b | * |
Return:
* |
public union(a: *, b: *): * source
import {union} from '@union-find/non-contiguous/src/adt/LinkedListWithHeadAndLength.js'
Params:
Name | Type | Attribute | Description |
a | * | ||
b | * |
Return:
* |
Static Private
private _makeset(Node: *): * source
import _makeset from '@union-find/non-contiguous/src/fundamentals/_makeset.js'
Params:
Name | Type | Attribute | Description |
Node | * |
Return:
* |
private _prototype(DisjointSet: *, union: *, find: *) source
import _prototype from '@union-find/non-contiguous/src/tools/_prototype.js'
Params:
Name | Type | Attribute | Description |
DisjointSet | * | ||
union | * | ||
find | * |