Update references to Vertex degree helpers to Algorithm\Degree

Author: clue

src/Eulerian.php

@@ -4,6 +4,7 @@
 
 use Fhaculty\Graph\Algorithm\BaseGraph;
 use Fhaculty\Graph\Graph;
+use Fhaculty\Graph\Algorithm\Degree;
 
 class Eulerian extends BaseGraph
 {
@@ -12,16 +13,18 @@ class Eulerian extends BaseGraph
      *
      * @return boolean
      * @uses Graph::isConnected()
-     * @uses Vertex::getDegree()
+     * @uses Degree::getDegreeVertex()
      * @todo isolated vertices should be ignored
      * @todo definition is only valid for undirected graphs
      */
     public function hasCycle()
     {
         if ($this->graph->isConnected()) {
+            $alg = new Degree($this->graph);
+
             foreach ($this->graph->getVertices() as $vertex) {
                 // uneven degree => fail
-                if ($vertex->getDegree() & 1) {
+                if ($alg->getDegreeVertex($vertex) & 1) {
                     return false;
                 }
             }

src/Tree/Base.php

@@ -8,6 +8,7 @@
 use Fhaculty\Graph\Exception\UnderflowException;
 use Fhaculty\Graph\Exception\UnexpectedValueException;
 use Fhaculty\Graph\Algorithm\Search\StrictDepthFirst;
+use Fhaculty\Graph\Algorithm\Degree;
 
 /**
  * Abstract base class for tree algorithms
@@ -35,6 +36,19 @@
  */
 abstract class Base extends BaseGraph
 {
+    /**
+     *
+     * @var Degree
+     */
+    protected $degree;
+
+    public function __construct(Graph $graph)
+    {
+        parent::__construct($graph);
+
+        $this->degree = new Degree($graph);
+    }
+
     /**
      * checks whether the given graph is actually a tree
      *

src/Tree/InTree.php

@@ -25,7 +25,7 @@ class InTree extends DirectedTree
     public function getVerticesChildren(Vertex $vertex)
     {
         $vertices = $vertex->getVerticesEdgeFrom();
-        if (count($vertices) !== $vertex->getDegreeIn()) {
+        if (count($vertices) !== $this->degree->getDegreeInVertex($vertex)) {
             throw new UnexpectedValueException();
         }
 
@@ -35,7 +35,7 @@ public function getVerticesChildren(Vertex $vertex)
     protected function getVerticesParent(Vertex $vertex)
     {
         $vertices = $vertex->getVerticesEdgeTo();
-        if (count($vertices) !== $vertex->getDegreeOut()) {
+        if (count($vertices) !== $this->degree->getDegreeOutVertex($vertex)) {
             throw new UnexpectedValueException();
         }
 

src/Tree/OutTree.php

@@ -25,7 +25,7 @@ class OutTree extends DirectedTree
     public function getVerticesChildren(Vertex $vertex)
     {
         $vertices = $vertex->getVerticesEdgeTo();
-        if (count($vertices) !== $vertex->getDegreeOut()) {
+        if (count($vertices) !== $this->degree->getDegreeOutVertex($vertex)) {
             throw new UnexpectedValueException();
         }
 
@@ -35,7 +35,7 @@ public function getVerticesChildren(Vertex $vertex)
     protected function getVerticesParent(Vertex $vertex)
     {
         $vertices = $vertex->getVerticesEdgeFrom();
-        if (count($vertices) !== $vertex->getDegreeIn()) {
+        if (count($vertices) !== $this->degree->getDegreeInVertex($vertex)) {
             throw new UnexpectedValueException();
         }
 

src/Tree/Undirected.php

@@ -10,6 +10,7 @@
 use Fhaculty\Graph\Vertex;
 use Fhaculty\Graph\Edge\Base as Edge;
 use Fhaculty\Graph\Edge\UndirectedId as UndirectedEdge;
+use Fhaculty\Graph\Algorithm\Degree;
 
 /**
  * Undirected tree implementation
@@ -76,23 +77,23 @@ public function isTree()
      *
      * @param Vertex $vertex
      * @return boolean
-     * @uses Vertex::getDegree()
+     * @uses Degree::getDegreeVertex()
      */
     public function isVertexLeaf(Vertex $vertex)
     {
-        return ($vertex->getDegree() === 1);
+        return ($this->degree->getDegreeVertex($vertex) === 1);
     }
 
     /**
      * checks if the given $vertex is an internal vertex (inner vertex with at least 2 edges)
      *
      * @param Vertex $vertex
      * @return boolean
-     * @uses Vertex::getDegree()
+     * @uses Degree::getDegreeVertex()
      */
     public function isVertexInternal(Vertex $vertex)
     {
-        return ($vertex->getDegree() >= 2);
+        return ($this->degree->getDegreeVertex($vertex) >= 2);
     }
 
     /**