Update references to Graph::getVertexFirst()

Author: clue

src/ConnectedComponents.php

@@ -70,7 +70,7 @@ private function createSearch(Vertex $vertex)
     public function isSingle()
     {
         try {
-            $vertex = $this->graph->getVertexFirst();
+            $vertex = $this->graph->getVertices()->getVertexFirst();
         }
         catch (UnderflowException $e) {
             // no first vertex => empty graph => has zero components

src/Degree.php

@@ -31,7 +31,7 @@ class Degree extends BaseGraph
     public function getDegree()
     {
         // get initial degree of any start vertex to compare others to
-        $degree = $this->getDegreeVertex($this->graph->getVertexFirst());
+        $degree = $this->getDegreeVertex($this->graph->getVertices()->getVertexFirst());
 
         foreach ($this->graph->getVertices() as $vertex) {
             /** @var $vertex Vertex */

src/TravelingSalesmanProblem/Bruteforce.php

@@ -92,7 +92,8 @@ public function setUpperLimitMst()
 
     protected function getVertexStart()
     {
-        return $this->graph->getVertexFirst();
+        // actual start doesn't really matter as we're only considering complete graphs here
+        return $this->graph->getVertices()->getVertexFirst();
     }
 
     protected function getGraph()
@@ -116,8 +117,7 @@ public function getEdges()
         // numEdges 3-12 should work
 
         $this->bestWeight = $this->upperLimit;
-        // actual start doesn't really matter as we're only considering complete graphs here
-        $this->startVertex = $this->graph->getVertexFirst();
+        $this->startVertex = $this->getVertexStart();
 
         $result = $this->step($this->startVertex,
                               0,

src/TravelingSalesmanProblem/MinimumSpanningTree.php

@@ -23,7 +23,7 @@ public function __construct(Graph $inputGraph)
 
     protected function getVertexStart()
     {
-        return $this->graph->getVertexFirst();
+        return $this->graph->getVertices()->VertexFirst();
     }
 
     protected function getGraph()
@@ -43,7 +43,7 @@ public function getEdges()
         $minimumSpanningTreeAlgorithm = new MstKruskal($this->graph);
         $minimumSpanningTree = $minimumSpanningTreeAlgorithm->createGraph();
 
-        $alg = new SearchDepthFirst($minimumSpanningTree->getVertexFirst());
+        $alg = new SearchDepthFirst($minimumSpanningTree->getVertices()->getVertexFirst());
         // Depth first search in minmum spanning tree (for the eulerian path)
 
         $startVertex = NULL;

src/Tree/Undirected.php

@@ -50,7 +50,7 @@ class Undirected extends Tree
      *
      * @return boolean
      * @uses Vertices::isEmpty() to skip null Graphs (a Graph with no Vertices is *NOT* a valid tree)
-     * @uses Graph::getVertexFirst() to get get get random "root" Vertex to start search from
+     * @uses Vertices::getVertexFirst() to get get get random "root" Vertex to start search from
      * @uses self::getVerticesSubtreeRecursive() to count number of vertices connected to root
      */
     public function isTree()
@@ -60,7 +60,7 @@ public function isTree()
         }
 
         // every vertex can represent a root vertex, so just pick one
-        $root = $this->graph->getVertexFirst();
+        $root = $this->graph->getVertices()->getVertexFirst();
 
         $vertices = array();
         try {

tests/Tree/BaseDirectedTest.php

@@ -75,7 +75,7 @@ public function testEmptyGraphDoesNotHaveHeight(BaseDirected $tree)
     public function testGraphTree()
     {
         $graph = $this->createGraphTree();
-        $root = $graph->getVertexFirst();
+        $root = $graph->getVertices()->getVertexFirst();
 
         $nonRoot = $graph->getVertices()->getMap();
         unset($nonRoot[$root->getId()]);