This is the cl-union-find Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Mon Feb 26 15:49:22 2024 GMT+0.
The main system appears first, followed by any subsystem dependency.
cl-union-findAn implementation of UNION-FIND datastructure
Marco Antoniotti
LGPL
union-find-pkg.lisp (file).
union-find.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
cl-union-find/union-find.lispunion-find-pkg.lisp (file).
cl-union-find (system).
collect-set (generic function).
find-set (function).
find-set-rep (function).
make-partition (function).
make-set (function).
partition (structure).
partition-p (function).
print-object (method).
print-set (function).
set-representative (structure).
set-representative-p (function).
union (function).
%make-partition (function).
%print-set-representative (function).
*accepted-equality-tests* (special variable).
copy-partition (function).
copy-set-representative (function).
link (function).
make-set-representative (function).
partition-element-sets-map (reader).
(setf partition-element-sets-map) (writer).
set-rep-item (reader).
(setf set-rep-item) (writer).
set-rep-parent (reader).
(setf set-rep-parent) (writer).
set-rep-partition (reader).
(setf set-rep-partition) (writer).
set-rep-rank (reader).
(setf set-rep-rank) (writer).
Packages are listed by definition order.
cl.util.union-findThis package contains an implementation of the well known
UNION-FIND data structure (with weighted path compression).
The data structure is very useful as a building block of many complex
algorithms.
union-find
cl-uf
union-find
cl-uf
common-lisp.
collect-set (generic function).
find-set (function).
find-set-rep (function).
make-partition (function).
make-set (function).
partition (structure).
partition-p (function).
print-set (function).
set-representative (structure).
set-representative-p (function).
union (function).
%make-partition (function).
%print-set-representative (function).
*accepted-equality-tests* (special variable).
copy-partition (function).
copy-set-representative (function).
link (function).
make-set-representative (function).
partition-element-sets-map (reader).
(setf partition-element-sets-map) (writer).
set-rep-item (reader).
(setf set-rep-item) (writer).
set-rep-parent (reader).
(setf set-rep-parent) (writer).
set-rep-partition (reader).
(setf set-rep-partition) (writer).
set-rep-rank (reader).
(setf set-rep-rank) (writer).
Definitions are sorted by export status, category, package, and then by lexicographic order.
A more ’high-level’ FIND operator which uses the actual set element X.
The traditional FIND operator of the UNION-FIND data structure.
The constructor for a Partition.
The constructor takes a sole keyword parameter :TEST (default to
#’EQUAL), which is used to map elements to sets (i.e. forests) in the
partition. The accepted values are #’EQ, #’EQL, #’EQUAL, and #’EQUALP.
The result it a newly created partition.
The public constructon for a Set Representative.
This is a utility function that PRINTS the result of COLLECT-SET on X.
The main UNION-FIND operator.
Note that this operator ’shadows’ CL:UNION.
This function collects all the elements of the set which contains X. The result is a list. Use this function with care.
partition) (x set-representative)) ¶The Union-Find Partion Structure.
The Partition structure serves as a collector of various auxiliary
data involved in the costruction and maintainance of disjoint sets
(represented as a forest of trees).
structure-object.
(or null hash-table)
The Set Representative Structure.
This structure type is the main building block for the UNION-FIND internal
representation of dijoint sets.
item.
rank.
| Jump to: | %
(
C F G L M P S U |
|---|
| Jump to: | %
(
C F G L M P S U |
|---|
| Jump to: | *
E I P R S |
|---|
| Jump to: | *
E I P R S |
|---|
| Jump to: | C F P S U |
|---|
| Jump to: | C F P S U |
|---|