Node::getAdjacents() - Code Metrics - Inspection of "Bugfix: preventing duplicate edges from appearing..." - phpmetrics/PhpMetrics - Measure and Improve Code Quality continuously with Scrutinizer

Completed

Pull Request — master (#304)

by Atlas

created 2017-09-15 08:34 UTC

Node::getAdjacents() A

↳ Parent: Node

Complexity

Conditions	4
Paths	5

Size

Total Lines	13
Code Lines	8

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
cc	4
eloc	8
nc	5
nop	0
dl	0
loc	13
rs	9.2
c	0
b	0
f	0

<?php

/*
 * (c) Jean-François Lépine <https://twitter.com/Halleck45>
 *
 * For the full copyright and license information, please view the LICENSE
 * file that was distributed with this source code.
 */

namespace Hal\Component\Tree;

class Node
{

    /**
     * @var mixed
     */
    private $data;

    /**
     * @var string
     */
    private $key;

    /**
     * @var Edge[]
     */
    private $edges = array();

    /**
     * @var bool
     */
    public $visited = false;

    /**
     * @var bool
     */
    public $cyclic = false;

    /**
     * Node constructor.
     * @param $key
     * @param mixed $data
     */
    public function __construct($key, $data = null)
    {
        $this->key = $key;
        $this->data = $data;
    }

    /**
     * @return string
     */
    public function getKey()
    {
        return $this->key;
    }

    /**
     * @return array
     */
    public function getAdjacents()
    {
        $adjacents = [];
        foreach ($this->edges as $edge) {
            if ($edge->getFrom()->getKey() != $this->getKey()) {
                $adjacents[$edge->getFrom()->getKey()] = $edge->getFrom();
            }
            if ($edge->getTo()->getKey() != $this->getKey()) {
                $adjacents[$edge->getTo()->getKey()] = $edge->getTo();
            }
        }
        return $adjacents;
    }

    /**
     * @return Edge[]
     */
    public function getEdges()
    {
        return $this->edges;
    }

    /**
     * @param Edge $edge
     * @return $this
     */
    public function addEdge(Edge $edge)
    {
        array_push($this->edges, $edge);
        return $this;
    }

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

    /**
     * @param mixed $data
     * @return Node
     */
    public function setData($data)
    {
        $this->data = $data;
        return $this;
    }

    /**
     * @return string Unique id for this node independent of class name or node type
     */
    public function getUniqueId()
    {
        return spl_object_hash($this);
    }
}


1			<?php
2
3			/*
4			* (c) Jean-François Lépine <https://twitter.com/Halleck45>
5			*
6			* For the full copyright and license information, please view the LICENSE
7			* file that was distributed with this source code.
8			*/
9
10			namespace Hal\Component\Tree;
11
12			class Node
13			{
14
15			/**
16			* @var mixed
17			*/
18			private $data;
19
20			/**
21			* @var string
22			*/
23			private $key;
24
25			/**
26			* @var Edge[]
27			*/
28			private $edges = array();
29
30			/**
31			* @var bool
32			*/
33			public $visited = false;
34
35			/**
36			* @var bool
37			*/
38			public $cyclic = false;
39
40			/**
41			* Node constructor.
42			* @param $key
43			* @param mixed $data
44			*/
45			public function __construct($key, $data = null)
46			{
47			$this->key = $key;
48			$this->data = $data;
49			}
50
51			/**
52			* @return string
53			*/
54			public function getKey()
55			{
56			return $this->key;
57			}
58
59			/**
60			* @return array
61			*/
62			public function getAdjacents()
63			{
64			$adjacents = [];
65			foreach ($this->edges as $edge) {
66			if ($edge->getFrom()->getKey() != $this->getKey()) {
67			$adjacents[$edge->getFrom()->getKey()] = $edge->getFrom();
68			}
69			if ($edge->getTo()->getKey() != $this->getKey()) {
70			$adjacents[$edge->getTo()->getKey()] = $edge->getTo();
71			}
72			}
73			return $adjacents;
74			}
75
76			/**
77			* @return Edge[]
78			*/
79			public function getEdges()
80			{
81			return $this->edges;
82			}
83
84			/**
85			* @param Edge $edge
86			* @return $this
87			*/
88			public function addEdge(Edge $edge)
89			{
90			array_push($this->edges, $edge);
91			return $this;
92			}
93
94			/**
95			* @return mixed
96			*/
97			public function getData()
98			{
99			return $this->data;
100			}
101
102			/**
103			* @param mixed $data
104			* @return Node
105			*/
106			public function setData($data)
107			{
108			$this->data = $data;
109			return $this;
110			}
111
112			/**
113			* @return string Unique id for this node independent of class name or node type
114			*/
115			public function getUniqueId()
116			{
117			return spl_object_hash($this);
118			}
119			}
120

phpmetrics / PhpMetrics

Pull Request — master (#304)

Node::getAdjacents() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like