Artack\Color\ConverterGraph

Complexity

Total Complexity

5

Size/Duplication

Total Lines	50
Duplicated Lines	0 %

Test Coverage

Coverage

100%

Importance

Changes	1
Bugs	0	Features	0

3 Methods

Rating	Name	Duplication	Size	Complexity
A	findVertex()	0	11	2
A	getConverterChain()	0	15	2
A	__construct()	0	3	1

<?php

declare(strict_types=1);

namespace Artack\Color;

use Artack\Color\Converter\ConverterInterface;
use Fhaculty\Graph\Edge\Base;
use Fhaculty\Graph\Graph;
use Fhaculty\Graph\Vertex;
use Graphp\Algorithms\ShortestPath\Dijkstra;

class ConverterGraph
{
    private $converterGraph;

    public function __construct(Graph $converterGraph)
    {
        $this->converterGraph = $converterGraph;
    }

    /**
     * @param string $fromFqcn
     * @param string $toFqcn
     *
     * @return ConverterInterface[]
     */
    public function getConverterChain(string $fromFqcn, string $toFqcn): array
    {
        $fromVertex = $this->findVertex($fromFqcn);
        $toVertex = $this->findVertex($toFqcn);

        $walk = (new Dijkstra($fromVertex))->getWalkTo($toVertex);

        $converters = [];

        /** @var Base $edge */
        foreach ($walk->getEdges() as $edge) {
            $converters[] = $edge->getAttribute(Factory::GRAPH_EDGE_KEY_CONVERTER);
        }

        return $converters;
    }

    /**
     * @param string $key
     *
     * @return Vertex
     *
     * @throws \RuntimeException
     */
    private function findVertex(string $key): Vertex
    {
        $vertices = array_filter($this->converterGraph->getVertices()->getVector(), function (Vertex $vertex) use ($key) {
            return $vertex->getId() === $key;
        });

        if (1 !== \count($vertices)) {
            throw new \RuntimeException('did not find vertex by '.$key);
        }

        return array_pop($vertices);
    }
}