GraphClient::numberOfSelfLoops() - Code Metrics - templesofcode/nodes-and-edges - Measure and Improve Code Quality continuously with Scrutinizer

GraphClient::numberOfSelfLoops() A
last analyzed 2020-05-06 14:27 UTC

↳ Parent: GraphClient

Complexity

Conditions	4
Paths	4

Size

Total Lines	19
Code Lines	7

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
cc	4
eloc	7
nc	4
nop	1
dl	0
loc	19
rs	10
c	0
b	0
f	0

<?php

namespace TemplesOfCode\NodesAndEdges;

/**
 * Class GraphClient
 * @package TemplesOfCode\NodesAndEdges
 */
class GraphClient
{
    /**
     * Maximum degree
     *
     * @param Graph $graph
     * @return int
     */
    public static function maxDegree(Graph $graph)
    {
        // init
        $max = 0;
        // get vertices
        $vertices = $graph->getVertices();
        // iterate over the set of vertices
        for ($vertex = 0; $vertex < $vertices; $vertex++) {
            // local var
            $degree = $graph->degree($vertex);
            // check if this vertex degrees are greater than the current max
            if ($degree > $max) {
                // update the max
                $max = $degree;
            }
        }
        // return the max found
        return $max;
    }

    /**
     * Average degree
     *
     * @param Graph $graph
     * @return int
     */
    public static function avgDegree(Graph $graph)
    {
        // each edge incident on two vertices
        return 2 * $graph->getEdges() / $graph->getVertices();
    }

    /**
     * number of self-loops
     *
     * @param Graph $graph
     * @return int
     */
    public static function numberOfSelfLoops(Graph $graph)
    {
        // init
        $count = 0;
        // get vertices
        $vertices = $graph->getVertices();
        // iterate over the graph vertices
        for ($vertex = 0; $vertex < $vertices; $vertex++) {
            // iterate over the adjacent vertices
            foreach ($graph->adjacent($vertex) as $w) {
                // is this vertex adjacent to itself
                if ($vertex == $w) {
                    // yes, bump up
                    $count++;
                }
            }
        }
        // self loop appears in adjacency list twice
        return $count/2;   
    }
}


1			<?php
2
3			namespace TemplesOfCode\NodesAndEdges;
4
5			/**
6			* Class GraphClient
7			* @package TemplesOfCode\NodesAndEdges
8			*/
9			class GraphClient
10			{
11			/**
12			* Maximum degree
13			*
14			* @param Graph $graph
15			* @return int
16			*/
17			public static function maxDegree(Graph $graph)
18			{
19			// init
20			$max = 0;
21			// get vertices
22			$vertices = $graph->getVertices();
23			// iterate over the set of vertices
24			for ($vertex = 0; $vertex < $vertices; $vertex++) {
25			// local var
26			$degree = $graph->degree($vertex);
27			// check if this vertex degrees are greater than the current max
28			if ($degree > $max) {
29			// update the max
30			$max = $degree;
31			}
32			}
33			// return the max found
34			return $max;
35			}
36
37			/**
38			* Average degree
39			*
40			* @param Graph $graph
41			* @return int
42			*/
43			public static function avgDegree(Graph $graph)
44			{
45			// each edge incident on two vertices
46			return 2 * $graph->getEdges() / $graph->getVertices();
47			}
48
49			/**
50			* number of self-loops
51			*
52			* @param Graph $graph
53			* @return int
54			*/
55			public static function numberOfSelfLoops(Graph $graph)
56			{
57			// init
58			$count = 0;
59			// get vertices
60			$vertices = $graph->getVertices();
61			// iterate over the graph vertices
62			for ($vertex = 0; $vertex < $vertices; $vertex++) {
63			// iterate over the adjacent vertices
64			foreach ($graph->adjacent($vertex) as $w) {
65			// is this vertex adjacent to itself
66			if ($vertex == $w) {
67			// yes, bump up
68			$count++;
69			}
70			}
71			}
72			// self loop appears in adjacency list twice
73			return $count/2;
74			}
75			}
76

templesofcode / nodes-and-edges

GraphClient::numberOfSelfLoops() A last analyzed 2020-05-06 14:27 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

GraphClient::numberOfSelfLoops() A
last analyzed 2020-05-06 14:27 UTC