Bisarca\Graph\Graph\Descriptor\LoopTrait

Complexity

Total Complexity

7

Size/Duplication

Total Lines	46
Duplicated Lines	0 %

Coupling/Cohesion

Components	0
Dependencies	0

Importance

Changes

0

3 Methods

Rating	Name	Duplication	Size	Complexity
	getEdgeSet()	0	1	?
A	hasLoop()	0	10	3
A	hasLoopOn()	0	13	4

<?php

/*
 * This file is part of the bisarca/graph package.
 *
 * (c) Emanuele Minotto <minottoemanuele@gmail.com>
 *
 * For the full copyright and license information, please view the LICENSE
 * file that was distributed with this source code.
 */

namespace Bisarca\Graph\Graph\Descriptor;

use Bisarca\Graph\Edge\Set;
use Bisarca\Graph\Vertex\VertexInterface;

trait LoopTrait
{
    /**
     * Gets the edges set.
     *
     * @return Set
     */
    abstract public function getEdgeSet(): Set;

    /**
     * Checks if the graph has an edge that is a loop.
     *
     * @return bool
     */
    public function hasLoop(): bool
    {
        $loop = false;

        foreach ($this->getEdgeSet() as $edge) {
            $loop = $loop || $edge->isLoop();
        }

        return $loop;
    }

    /**
     * Checks if the graph has an edge that is a loop and with a vertex $vertex.
     *
     * @param VertexInterface $vertex
     *
     * @return bool
     */
    public function hasLoopOn(VertexInterface $vertex): bool
    {
        $loop = false;

        foreach ($this->getEdgeSet() as $edge) {
            $loop = $loop || (
                $edge->isLoop() &&
                $vertex === $edge->getVertexStart()
            );
        }

        return $loop;
    }
}