union_find.hpp (3)

Classes

class mlpack::emst::UnionFind

A Union-Find data structure.

Namespaces

mlpack

Linear algebra utility functions, generally performed on matrices or vectors. mlpack::emst

Euclidean Minimum Spanning Trees.

Author:

Bill March ([email protected])

Implements a union-find data structure. This structure tracks the components of a graph. Each point in the graph is initially in its own component. Calling unionfind.Union(x, y) unites the components indexed by x and y. unionfind.Find(x) returns the index of the component containing point x.

This file is part of MLPACK 1.0.10.

MLPACK is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

MLPACK is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details (LICENSE.txt).

You should have received a copy of the GNU General Public License along with MLPACK. If not, see http://www.gnu.org/licenses/.

Definition in file union_find.hpp.

Generated automatically by Doxygen for MLPACK from the source code.