Replace all occurances of $graph->getNumberOfEdges()

replaced with count($graph->getEdges())

Author: clue

src/Property/WalkProperty.php

@@ -162,7 +162,7 @@ public function hasCycle()
      */
     public function isLoop()
     {
-        return ($this->walk->getNumberOfEdges() === 1 && $this->isCycle());
+        return (count($this->walk->getEdges()) === 1 && $this->isCycle());
     }
 
     /**
@@ -214,7 +214,7 @@ public function hasLoop()
     public function isDigon()
     {
         // exactly 2 edges
-        return ($this->walk->getNumberOfEdges() === 2 &&
+        return (count($this->walk->getEdges()) === 2 &&
                 // no duplicate edges
                 !$this->hasArrayDuplicates($this->walk->getEdges()->getVector()) &&
                 // exactly two distinct vertices
@@ -238,7 +238,7 @@ public function isDigon()
     public function isTriangle()
     {
         // exactly 3 (implicitly distinct) edges
-        return ($this->walk->getNumberOfEdges() === 3 &&
+        return (count($this->walk->getEdges()) === 3 &&
                 // exactly three distinct vertices
                 count($this->walk->getVertices()->getVerticesDistinct()) === 3 &&
                 // this is actually a cycle

tests/Property/WalkPropertyTest.php

@@ -15,7 +15,7 @@ public function testTrivialGraph()
         $walk = Walk::factoryFromEdges(array(), $v1);
 
         $this->assertEquals(1, count($walk->getVertices()));
-        $this->assertEquals(0, $walk->getNumberOfEdges());
+        $this->assertEquals(0, count($walk->getEdges()));
 
         $alg = new WalkProperty($walk);
 
@@ -68,7 +68,7 @@ public function testCycle()
         $walk = Walk::factoryFromEdges(array($e1, $e2), $v1);
 
         $this->assertEquals(3, count($walk->getVertices()));
-        $this->assertEquals(2, $walk->getNumberOfEdges());
+        $this->assertEquals(2, count($walk->getEdges()));
 
         $alg = new WalkProperty($walk);
 
@@ -171,7 +171,7 @@ public function testSimplePathWithinGraph()
         $walk = Walk::factoryFromEdges(array($e2), $v2);
 
         $this->assertEquals(2, count($walk->getVertices()));
-        $this->assertEquals(1, $walk->getNumberOfEdges());
+        $this->assertEquals(1, count($walk->getEdges()));
 
         $alg = new WalkProperty($walk);
 

tests/ShortestPath/BaseShortestPathTest.php

@@ -79,7 +79,7 @@ public function testGraphCycle()
         $this->assertEquals($expectedWeight, $alg->getDistance($v1));
 
         $walk = $alg->getWalkTo($v1);
-        $this->assertEquals(2, $walk->getNumberOfEdges());
+        $this->assertEquals(2, count($walk->getEdges()));
     }
 
     /**