Update documentation about the examples, hopefully clarifying a little bit.
This commit is contained in:
@@ -449,8 +449,8 @@ std::cout << std::endl;
|
||||
|
||||
---
|
||||
|
||||
Build two `BallTree`s on subsets of the corel dataset and compute various
|
||||
bounding quantities.
|
||||
Build two `BallTree`s on subsets of the corel dataset and compute minimum and
|
||||
maximum distances between different nodes in the tree.
|
||||
|
||||
```c++
|
||||
// See https://datasets.mlpack.org/corel-histogram.csv.
|
||||
|
||||
@@ -1376,8 +1376,8 @@ std::cout << "Center of tree: " << center.t();
|
||||
|
||||
---
|
||||
|
||||
Build two `BinarySpaceTree`s on subsets of the corel dataset and compute various
|
||||
bounding quantities.
|
||||
Build two `BinarySpaceTree`s on subsets of the corel dataset and compute minimum
|
||||
and maximum distances between different nodes in the tree.
|
||||
|
||||
```c++
|
||||
// See https://datasets.mlpack.org/corel-histogram.csv.
|
||||
|
||||
@@ -443,8 +443,8 @@ std::cout << "Center of kd-tree: " << center.t();
|
||||
|
||||
---
|
||||
|
||||
Build two `KDTree`s on subsets of the corel dataset and compute various
|
||||
bounding quantities.
|
||||
Build two `KDTree`s on subsets of the corel dataset and compute minimum and
|
||||
maximum distances between different nodes in the tree.
|
||||
|
||||
```c++
|
||||
// See https://datasets.mlpack.org/corel-histogram.csv.
|
||||
|
||||
Reference in New Issue
Block a user