DataStructures\Trees\Nodes\DisjointNode

Complexity

Total Complexity

1

Size/Duplication

Total Lines	11
Duplicated Lines	0 %

Coupling/Cohesion

Components	0
Dependencies	0

Importance

Changes	1
Bugs	0	Features	1

1 Method

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	5	1

<?php
/**
 * DataStructures for PHP
 *
 * @link      https://github.com/SiroDiaz/DataStructures
 * @copyright Copyright (c) 2017 Siro Díaz Palazón
 * @license   https://github.com/SiroDiaz/DataStructures/blob/master/README.md (MIT License)
 */
namespace DataStructures\Trees\Nodes;

/**
 * DisjointNode.
 *
 * The DisjointNode class represents the disjoint set node. It uses a pointer to the
 * next parent node and a rank attribute used to add the little tree to the bigger.
 * The trees with just one element have a rank of 0.
 * Using rank the execution time for operations makeSet, union, and find is of O(log n).
 * Rank is used instead of depth.
 *
 * @author Siro Diaz Palazon <siro_diaz@yahoo.com>
 */
class DisjointNode {
    public $parent;
    public $rank;
    public $data;

    public function __construct($rank, $data) {
        $this->parent = null;
        $this->rank = $rank;
        $this->data = $data;
    }
}