PHPAlgorithms / Dijkstra-s-algorithm

src/Dijkstra/Path.php

Doc Comments +3 added lines

@@ -32,6 +32,9 @@
         return $this;
     }
 
+    /**
+     * @param integer $distance
+     */
     public function checkDistance($distance)
     {
         if (!is_numeric($distance) && ($distance <= 0)) {

src/Dijkstra.php

Indentation +2 added lines, -2 removed lines

@@ -93,7 +93,7 @@ 
 
             if (!is_null($relation)) {
                 $point = $relation->to
-                                  ->id;
+                                    ->id;
             } else {
                 $point = $paths[$point]->nodes[0];
 
@@ -143,7 +143,7 @@ 
             if (isset($paths[$relation->to->id])) {
                 if ($paths[$relation->to->id]->distance > ($paths[$point]->distance + $relation->distance)) {
                     $paths[$relation->to->id]->copy($paths[$point])
-                                             ->addNode($relation->to->id, $relation->distance);
+                                                ->addNode($relation->to->id, $relation->distance);
                 }
             } else {
                 $paths[$relation->to->id] = (new Path())->copy($paths[$point])