ConverterGraph::getConverterChain() - Code Metrics - Inspection of "converterChain with ShortesPath algorithm" - ARTACK/color - Measure and Improve Code Quality continuously with Scrutinizer

Test Setup Failed

Push — master ( 5f1f5d...227952 )

by Patrick

created 2017-12-12 17:02 UTC

ConverterGraph::getConverterChain() A

↳ Parent: ConverterGraph

Complexity

Conditions	2
Paths	2

Size

Total Lines	15
Code Lines	7

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
cc	2
eloc	7
nc	2
nop	2
dl	0
loc	15
rs	9.4285
c	0
b	0
f	0

<?php

declare(strict_types=1);

namespace Artack\Color;

use Artack\Color\Converter\Convertible;
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 Convertible[]
     */
    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);
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace Artack\Color;
6
7			use Artack\Color\Converter\Convertible;
8			use Fhaculty\Graph\Edge\Base;
9			use Fhaculty\Graph\Graph;
10			use Fhaculty\Graph\Vertex;
11			use Graphp\Algorithms\ShortestPath\Dijkstra;
12
13			class ConverterGraph
14			{
15			private $converterGraph;
16
17			public function __construct(Graph $converterGraph)
18			{
19			$this->converterGraph = $converterGraph;
20			}
21
22			/**
23			* @param string $fromFqcn
24			* @param string $toFqcn
25			*
26			* @return Convertible[]
27			*/
28			public function getConverterChain(string $fromFqcn, string $toFqcn): array
29			{
30			$fromVertex = $this->findVertex($fromFqcn);
31			$toVertex = $this->findVertex($toFqcn);
32
33			$walk = (new Dijkstra($fromVertex))->getWalkTo($toVertex);
34
35			$converters = [];
36
37			/** @var Base $edge */
38			foreach ($walk->getEdges() as $edge) {
39			$converters[] = $edge->getAttribute(Factory::GRAPH_EDGE_KEY_CONVERTER);
40			}
41
42			return $converters;
43			}
44
45			/**
46			* @param string $key
47			*
48			* @return Vertex
49			*
50			* @throws \RuntimeException
51			*/
52			private function findVertex(string $key): Vertex
53			{
54			$vertices = array_filter($this->converterGraph->getVertices()->getVector(), function (Vertex $vertex) use ($key) {
55			return $vertex->getId() === $key;
56			});
57
58			if (1 !== \count($vertices)) {
59			throw new \RuntimeException('did not find vertex by '.$key);
60			}
61
62			return array_pop($vertices);
63			}
64			}
65

ARTACK / color

GitHub Access Token became invalid

Push — master ( 5f1f5d...227952 )

ConverterGraph::getConverterChain() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like