diff --git a/src/algorithm/neighbour/cover_tree.rs b/src/algorithm/neighbour/cover_tree.rs
index 08e06cc..43e366e 100644
--- a/src/algorithm/neighbour/cover_tree.rs
+++ b/src/algorithm/neighbour/cover_tree.rs
@@ -45,7 +45,7 @@ pub struct CoverTree<T, F: RealNumber, D: Distance<T, F>> {
 impl<T: Debug, F: RealNumber, D: Distance<T, F>> CoverTree<T, F, D> {
     /// Construct a cover tree.
     /// * `data` - vector of data points to search for.
-    /// * `distance` - distance metric to use for searching. This function should extend [`Distance`](../algorithm/neighbour/index.html) interface.
+    /// * `distance` - distance metric to use for searching. This function should extend [`Distance`](../../../math/distance/index.html) interface.
     pub fn new(mut data: Vec<T>, distance: D) -> CoverTree<T, F, D> {
         let mut tree = CoverTree {
             base: F::two(),
diff --git a/src/algorithm/neighbour/linear_search.rs b/src/algorithm/neighbour/linear_search.rs
index 2164e48..00e09d9 100644
--- a/src/algorithm/neighbour/linear_search.rs
+++ b/src/algorithm/neighbour/linear_search.rs
@@ -40,7 +40,7 @@ pub struct LinearKNNSearch<T, F: RealNumber, D: Distance<T, F>> {
 impl<T, F: RealNumber, D: Distance<T, F>> LinearKNNSearch<T, F, D> {
     /// Initializes algorithm.
     /// * `data` - vector of data points to search for.
-    /// * `distance` - distance metric to use for searching. This function should extend [`Distance`](../algorithm/neighbour/index.html) interface.
+    /// * `distance` - distance metric to use for searching. This function should extend [`Distance`](../../../math/distance/index.html) interface.
     pub fn new(data: Vec<T>, distance: D) -> LinearKNNSearch<T, F, D> {
         LinearKNNSearch {
             data: data,