Replace all occurances of $graph->getNumberOfVertices()

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

Author: clue

src/ConnectedComponents.php

@@ -65,7 +65,6 @@ private function createSearch(Vertex $vertex)
      * connected here.
      *
      * @return boolean
-     * @uses AlgorithmSearchBreadthFirst::getNumberOfVertices()
      * @see self::getNumberOfComponents()
      */
     public function isSingle()
@@ -79,7 +78,7 @@ public function isSingle()
         }
         $alg = $this->createSearch($vertex);
 
-        return ($this->graph->getNumberOfVertices() === $alg->getNumberOfVertices());
+        return (count($this->graph->getVertices()) === count($alg->getVertices()));
     }
 
     /**

src/MinimumCostFlow/SuccessiveShortestPath.php

@@ -124,13 +124,12 @@ public function createGraph()
      * @param  Graph     $graph
      * @return boolean
      * @throws Exception if given graph is not a clone of the original graph (each vertex has to be present in both graphs)
-     * @uses Graph::getNumberOfVertices()
      * @uses Graph::getBalanace()
      * @uses Graph::getVertex()
      */
     private function isBalanceReached(Graph $graph)
     {
-        if ($graph->getNumberOfVertices() !== $this->graph->getNumberOfVertices()) {
+        if (count($graph->getVertices()) !== count($this->graph->getVertices())) {
             throw new DomainException('Given graph does not appear to be a clone of input graph');
         }
         foreach ($this->graph->getVertices()->getMap() as $vid => $vertex) {

src/MinimumSpanningTree/Kruskal.php

@@ -125,7 +125,7 @@ public function getEdges()
 
         // definition of spanning tree: number of edges = number of vertices - 1
         // above algorithm does not check isolated edges or may otherwise return multiple connected components => force check
-        if (count($returnEdges) !== ($this->graph->getNumberOfVertices() - 1)) {
+        if (count($returnEdges) !== (count($this->graph->getVertices()) - 1)) {
             throw new UnexpectedValueException('Graph is not connected');
         }
 

src/MinimumSpanningTree/Prim.php

@@ -35,7 +35,7 @@ public function getEdges()
         $returnEdges = array();
 
         // iterate n-1 times (per definition, resulting MST MUST have n-1 edges)
-        for ($i = 0, $n = $this->startVertex->getGraph()->getNumberOfVertices() - 1; $i < $n; ++$i) {
+        for ($i = 0, $n = count($this->startVertex->getGraph()->getVertices()) - 1; $i < $n; ++$i) {
             $markInserted[$vertexCurrent->getId()] = true;
 
             // get unvisited vertex of the edge and add edges from new vertex

src/Property/GraphProperty.php

@@ -46,6 +46,6 @@ public function isNull()
      */
     public function isTrivial()
     {
-        return ($this->graph->getEdges()->isEmpty() && $this->graph->getNumberOfVertices() === 1);
+        return ($this->graph->getEdges()->isEmpty() && count($this->graph->getVertices()) === 1);
     }
 }

src/ShortestPath/Dijkstra.php

@@ -46,7 +46,7 @@ public function getEdges()
         $isFirst = true;
 
         // Repeat until all vertices have been marked
-        $totalCountOfVertices = $this->vertex->getGraph()->getNumberOfVertices();
+        $totalCountOfVertices = count($this->vertex->getGraph()->getVertices());
         for ($i = 0; $i < $totalCountOfVertices; ++$i) {
             $currentVertex = NULL;
             $currentVertexId = NULL;

src/ShortestPath/MooreBellmanFord.php

@@ -79,7 +79,7 @@ public function getEdges()
         // the usal algorithm says we repeat (n-1) times.
         // but because we also want to check for loop edges on the start vertex,
         // we have to add an additional step:
-        $numSteps = $this->vertex->getGraph()->getNumberOfVertices();
+        $numSteps = count($this->vertex->getGraph()->getVertices());
         $edges = $this->vertex->getGraph()->getEdges();
         $changed = true;
 

src/TravelingSalesmanProblem/Bruteforce.php

@@ -108,7 +108,7 @@ protected function getGraph()
      */
     public function getEdges()
     {
-        $this->numEdges = $this->graph->getNumberOfVertices();
+        $this->numEdges = count($this->graph->getVertices());
         if ($this->numEdges < 3) {
             throw new UnderflowException('Needs at least 3 vertices');
         }

src/TravelingSalesmanProblem/NearestNeighbor.php

@@ -40,7 +40,7 @@ public function getEdges()
     {
         $returnEdges = array();
 
-        $n = $this->vertex->getGraph()->getNumberOfVertices();
+        $n = count($this->vertex->getGraph()->getVertices());
 
         $vertex = $this->vertex;
         $visitedVertices = array($vertex->getId() => true);

src/Tree/BaseDirected.php

@@ -96,7 +96,7 @@ public function isTree()
         }
 
         // check number of vertices reachable from root should match total number of vertices
-        return ($num === $this->graph->getNumberOfVertices());
+        return ($num === count($this->graph->getVertices()));
     }
 
     /**