diff --git a/src/data-structures/splay-tree.js b/src/data-structures/splay-tree.js
index dfadb1ee..20b80716 100644
--- a/src/data-structures/splay-tree.js
+++ b/src/data-structures/splay-tree.js
@@ -44,7 +44,7 @@
 
   /**
    * Splay tree.
-   * http://en.wikipedia.org/wiki/Splay_tree
+   * {@link http://en.wikipedia.org/wiki/Splay_tree}
    * @public
    * @constructor
    */
diff --git a/src/sets/quickfind.js b/src/sets/quickfind.js
index 272dd72c..a5a465b1 100644
--- a/src/sets/quickfind.js
+++ b/src/sets/quickfind.js
@@ -5,7 +5,7 @@
  * The algorithm is inspired by Robert Sedgewick's Java implementation.
  * <br>
  * The algorithm is inspired by Robert Sedgewick's Java implementation.
- * For further reading http://algs4.cs.princeton.edu/home/.
+ * {@link http://algs4.cs.princeton.edu/home/}
  *
  * @example
  *
diff --git a/src/sets/quickunion.js b/src/sets/quickunion.js
index ecb88327..0d8bb402 100644
--- a/src/sets/quickunion.js
+++ b/src/sets/quickunion.js
@@ -4,7 +4,7 @@
  * Allows to check whether the path between two nodes exists.
  * <br>
  * The algorithm is inspired by Robert Sedgewick's Java implementation.
- * For further reading http://algs4.cs.princeton.edu/home/.
+ * {@link http://algs4.cs.princeton.edu/home/}
  *
  * @example
  *
diff --git a/src/sets/weightquickunion.js b/src/sets/weightquickunion.js
index 47079193..2fc9b099 100644
--- a/src/sets/weightquickunion.js
+++ b/src/sets/weightquickunion.js
@@ -4,7 +4,7 @@
  * Allows to check whether the path between two nodes exists.
  * <br>
  * The algorithm is inspired by Robert Sedgewick's Java implementation.
- * For further reading http://algs4.cs.princeton.edu/home/.
+ * {@link http://algs4.cs.princeton.edu/home/}
  *
  * @example
  *