Mado\QueryBundle\Component\Meta\DijkstraWalker

Complexity

Total Complexity

6

Size/Duplication

Total Lines	49
Duplicated Lines	0 %

Importance

Changes

0

3 Methods

Rating	Name	Duplication	Size	Complexity
A	buildPathBetween()	0	22	3
A	__construct()	0	6	1
A	getPath()	0	9	2

<?php

namespace Mado\QueryBundle\Component\Meta;

/**
 * @since Class available since Release 2.1.0
 */
final class DijkstraWalker
{
    private $builder;

    private $dijkstra;

    private $path;

    public function __construct(
        DataMapper $builder,
        Dijkstra $dijkstra
    ) {
        $this->builder = $builder;
        $this->dijkstra = $dijkstra;
    }

    public function buildPathBetween($start, $end) : bool
    {
        $this->builder->rebuildRelationMap();

        $map = $this->builder->getMap();

        $this->builder->setMap($map);

        $percorso = $tutta = $this->dijkstra->shortestPaths($start, $end);

The assignment to $tutta is dead and can be removed.

        $prevRelations = $map[$start]['relations'];

        $this->path = '_embedded';

        foreach ($percorso[0] as $nodo => $meta) {
            if ($relationName = array_search($meta, $prevRelations)) {
                $this->path .= '.' . $relationName;
            }

            $prevRelations = $map[$meta]['relations'];
        }

        return true;
    }

    public function getPath() : string
    {
        if (!$this->path) {
            throw new \RuntimeException(
                'Oops! path was never builded.'
            );
        }

        return $this->path;
    }
}