This extension provides procedures for operating on disjoint sets. For an explanation of where and why this is useful, consult an algorithms textbook. (Chapter 22 of Cormen is a good starting point.)
The total running time of any sane sequence of disjoint set operations should be O(n) in this implementation.
Creates a new disjoint set object. NUM-ELEMENTS must be a positive integer. There are NUM-ELEMENTS partitions initially.
Returns #t if OBJ is a disjoint set object.
Returns the representative element of the set containing ELEM.
Unifies the sets containing elements ELEM1 and ELEM2. An error is signalled if the sets are already unified.
Another name for disjoint-set-unify!, above.
Returns #t if ELEM1 and ELEM2 are members of the same set.
Returns a list of all members of the set containing ELEM. NOTE: This procedure should be used only for debugging purposes, and is not considered a "sane" operation.
Returns the number of unique elements (not unique sets) in DISJOINT-SET.
Returns the number of unique sets currently in DISJOINT-SET.
Returns #t if all elements are in the same set.
Creates a list of lists, where each sublist corresponds to a unique set.
Copyright (C) 2007-2008, Lenny Frank. All rights reserved. Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the Software), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED AS-IS, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.