ConverterGraph::findVertex() - Code Metrics - ARTACK/color - Measure and Improve Code Quality continuously with Scrutinizer

ConverterGraph::findVertex() A
last analyzed 2019-07-18 12:29 UTC

↳ Parent: ConverterGraph

Complexity

Conditions	2
Paths	2

Size

Total Lines	11
Code Lines	5

Duplication

Lines	0
Ratio	0 %

Code Coverage

Tests	6
CRAP Score	2

Importance

Changes	1
Bugs	0	Features	0

Metric	Value
cc	2
eloc	5
c	1
b	0
f	0
nc	2
nop	1
dl	0
loc	11
ccs	6
cts	6
cp	1
crap	2
rs	10

<?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);
    }
}


1		<?php
2
3		declare(strict_types=1);
4
5		namespace Artack\Color;
6
7		use Artack\Color\Converter\ConverterInterface;
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	924	public function __construct(Graph $converterGraph)
18		{
19	924	$this->converterGraph = $converterGraph;
20	924	}
21
22		/**
23		* @param string $fromFqcn
24		* @param string $toFqcn
25		*
26		* @return ConverterInterface[]
27		*/
28	653	public function getConverterChain(string $fromFqcn, string $toFqcn): array
29		{
30	653	$fromVertex = $this->findVertex($fromFqcn);
31	653	$toVertex = $this->findVertex($toFqcn);
32
33	652	$walk = (new Dijkstra($fromVertex))->getWalkTo($toVertex);
34
35	652	$converters = [];
36
37		/** @var Base $edge */
38	652	foreach ($walk->getEdges() as $edge) {
39	652	$converters[] = $edge->getAttribute(Factory::GRAPH_EDGE_KEY_CONVERTER);
40		}
41
42	652	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	653	$vertices = array_filter($this->converterGraph->getVertices()->getVector(), function (Vertex $vertex) use ($key) {
55	653	return $vertex->getId() === $key;
56	653	});
57
58	653	if (1 !== \count($vertices)) {
59	1	throw new \RuntimeException('did not find vertex by '.$key);
60		}
61
62	653	return array_pop($vertices);
63		}
64		}
65

ARTACK / color

GitHub Access Token became invalid

ConverterGraph::findVertex() A last analyzed 2019-07-18 12:29 UTC

Complexity

Size

Duplication

Code Coverage

Importance

Duplication Side-by-Side

Filter issues like

ConverterGraph::findVertex() A
last analyzed 2019-07-18 12:29 UTC