SiroDiaz / DataStructures

DataStructures/Sets/DisjointSet.php

Doc Comments +1 added lines, -5 removed lines

@@ -33,7 +33,7 @@ 
      * set is created.
      *
      * @param mixed $data the data to store.
-     * @return DataStructures\Trees\Nodes\DisjointNode the node created.
+     * @return DisjointNode the node created.
      */
     public function makeSet($data) : DisjointNode {
         $newSet = new DisjointNode($data);
@@ -46,8 +46,6 @@ 
      * Returns the representative node (the root of $node in the tree) and
      * also applies path compression.
      *
-     * @param DataStructures\Trees\Nodes\DisjointNode $node the node from
-     *  where start to search the root.
      * @return DataStructures\Trees\Nodes\DisjointNode the parent node.
      */
     public function find($vertex) {
@@ -67,8 +65,6 @@ 
      * one). If both have the same rank it doesn't matter what tree
      * is joined to the other tree but the rank will increase.
      *
-     * @param DataStructures\Trees\Nodes\DisjointNode $x The set.
-     * @param DataStructures\Trees\Nodes\DisjointNode $y The other set.
      */
     public function union($vertex1, $vertex2) {
         if($this->subsets[$vertex2]->parent < $this->subsets[$vertex1]->parent) {