Koriit\PHPDeps\Graph\Vertex

Complexity

Total Complexity

7

Size/Duplication

Total Lines	50
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	0

Importance

Changes

0

6 Methods

Rating	Name	Duplication	Size	Complexity
A	__construct()	0	5	1
A	getValue()	0	4	1
A	getNeighbours()	0	4	1
A	addNeighbour()	0	6	2
A	getIndex()	0	4	1
A	setIndex()	0	4	1

<?php
/**
 * @copyright 2018 Aleksander Stelmaczonek <al.stelmaczonek@gmail.com>
 * @license   MIT License, see license file distributed with this source code
 */

namespace Koriit\PHPDeps\Graph;

class Vertex
{
    /** @var mixed Held value */
    private $value;

    /** @var Vertex[] */
    private $neighbours;

    /** @var int The index in the graph */
    private $index = null;

    public function __construct($value, array $neighbours = [])
    {
        $this->value = $value;
        $this->neighbours = $neighbours;
    }

    /**
     * @return mixed
     */
    public function getValue()
    {
        return $this->value;
    }

    public function getNeighbours()
    {
        return $this->neighbours;
    }

    /**
     * @param Vertex $neighbour
     */
    public function addNeighbour(Vertex $neighbour)
    {
        if (!\in_array($neighbour, $this->neighbours)) {
            $this->neighbours[] = $neighbour;
        }
    }

    public function getIndex()
    {
        return $this->index;
    }

    public function setIndex($index)
    {
        $this->index = $index;
    }
}