Add separate test case for unweighted edges

Author: clue

tests/ShortestPath/BaseShortestPathTest.php

@@ -116,6 +116,24 @@ public function testSeparateGraphsAreNotReachable()
         $alg->getEdgesTo($vg2);
     }
 
+    public function testGraphUnweighted()
+    {
+        // 1 -> 2
+        $graph = new Graph();
+        $v1 = $graph->createVertex(1);
+        $v2 = $graph->createVertex(2);
+        $e1 = $v1->createEdgeTo($v2);
+
+        $alg = $this->createAlg($v1);
+
+        $expectedWeight = $this->getExpectedWeight(array($e1));
+        $this->assertEquals($expectedWeight, $alg->getDistance($v2));
+        $this->assertEquals(array(2 => $expectedWeight), $alg->getDistanceMap());
+        $this->assertEquals(array($e1), $alg->getEdges()->getVector());
+        $this->assertEquals(array($e1), $alg->getEdgesTo($v2)->getVector());
+        $this->assertEquals(array(2), $alg->getVertices()->getIds());
+    }
+
     public function testGraphTwoComponents()
     {
         // 1 -[10]-> 2

tests/ShortestPath/MooreBellmanFordTest.php

@@ -72,15 +72,15 @@ public function testLoopNegativeWeightIsCycle()
 
     public function testNegativeComponentHasCycle()
     {
-        // 1 -- 2     3 --[-1]--> 4
-        //            ^           |
-        //            \---[-2]----/
+        // 1 -[1]-> 2     3 --[-1]--> 4
+        //                ^           |
+        //                \---[-2]----/
         $graph = new Graph();
         $v1 = $graph->createVertex(1);
         $v2 = $graph->createVertex(2);
         $v3 = $graph->createVertex(3);
         $v4 = $graph->createVertex(4);
-        $e1 = $v1->createEdge($v2);
+        $e1 = $v1->createEdgeTo($v2)->setWeight(1);
         $e2 = $v3->createEdgeTo($v4)->setWeight(-1);
         $e3 = $v4->createEdgeTo($v3)->setWeight(-2);