PHPAlgorithms\Dijkstra\Path

Complexity

Total Complexity

8

Size/Duplication

Total Lines	43
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	1

Importance

Changes	1
Bugs	0	Features	0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	__get()	0	8	2
A	addNode()	0	14	2
A	checkDistance()	0	6	3
A	copy()	0	7	1

<?php

namespace PHPAlgorithms\Dijkstra;

use PHPAlgorithms\Dijkstra\Exceptions\PathException;

class Path {
    private $nodes = array();
    private $distance = 0;

    public function __get($name)
    {
        if (isset($this->{$name})) {
            return $this->{$name};
        }

        return null;
    }

    public function addNode($point, $distance = 0)
    {
        if ($point instanceof Point) {
            $point = $point->id;

The property id does not seem to exist in PHPAlgorithms\Dijkstra\Point.

        }

        $this->nodes[] = $point;

        $this->checkDistance($distance);

        $this->distance += $distance;

        return $this;
    }

    public function checkDistance($distance)
    {
        if (!is_numeric($distance) && ($distance <= 0)) {
            throw new PathException('Distance must be numeric value greater than 0');
        }
    }

    public function copy(self $path)
    {
        $this->nodes = $path->nodes;
        $this->distance = $path->distance;

        return $this;
    }
}