core :: DisjointSetNode :: _parent
If parent == self then the node is a rootcore :: DisjointSetNode :: defaultinit
core :: DisjointSetNode :: parent
If parent == self then the node is a rootcore :: DisjointSetNode :: parent=
If parent == self then the node is a rootcore :: DisjointSetNode :: rank=
The rank to keep the structure balanced.core $ DisjointSetNode :: SELF
Type of this instance, automatically specialized in every classcore :: DisjointSetNode :: _parent
If parent == self then the node is a rootcore :: Object :: class_factory
Implementation used byget_class
to create the specific class.
core :: DisjointSetNode :: defaultinit
core :: Object :: defaultinit
core :: Object :: is_same_instance
Return true ifself
and other
are the same instance (i.e. same identity).
core :: Object :: is_same_serialized
Isself
the same as other
in a serialization context?
core :: Object :: is_same_type
Return true ifself
and other
have the same dynamic type.
core :: Object :: native_class_name
The class name of the object in CString format.core :: Object :: output_class_name
Display class name on stdout (debug only).core :: DisjointSetNode :: parent
If parent == self then the node is a rootcore :: DisjointSetNode :: parent=
If parent == self then the node is a rootcore :: DisjointSetNode :: rank=
The rank to keep the structure balanced.
# A node in the hierarchical representation of subsets
private class DisjointSetNode
# If parent == self then the node is a root
var parent: DisjointSetNode = self
# The rank to keep the structure balanced.
# The term rank is used instead of depth since
# path compression is used, see `DisjointSet::nfind`
var rank = 0
end
lib/core/collection/union_find.nit:235,1--244,3