Bellman-Ford code formatting

TheAlgorithms · May 5, 2024 · 4661257 · 4661257
1 parent e502f58
commit 4661257
Show file tree

Hide file tree

Showing 2 changed files with 8 additions and 7 deletions.
diff --git a/Graphs/BellmanFord.php b/Graphs/BellmanFord.php
@@ -1,6 +1,7 @@
 <?php
 
-class Edge {
+class Edge
+{
     public $start;
     public $end;
     public int $weight;
@@ -36,11 +37,11 @@ function bellmanFord(array $verticesNames, array $edges, string $start, bool $ve
             }
 
             foreach ($edges[$vertice] as $edge) {
-                if ($vertices[$edge->end] > $vertices[$vertice] + $edge->weight ) {
+                if ($vertices[$edge->end] > $vertices[$vertice] + $edge->weight) {
                     if ($verbose) {
                         echo "replace $vertice " . $vertices[$edge->end] . " with " . $vertices[$vertice] + $edge->weight . "\n ";
                     }
-                    $vertices[$edge->end] =  $vertices[$vertice] + $edge->weight;
+                    $vertices[$edge->end] = $vertices[$vertice] + $edge->weight;
                     $change = true;
                 }
             }

diff --git a/tests/Graphs/BellmanFordTest.php b/tests/Graphs/BellmanFordTest.php
@@ -19,16 +19,16 @@ public function testBellmanFord()
             ['C', -2, 'B'],
             ['B', 1, 'A'],
         ];
-        $vertices = [ 'S', 'A', 'B', 'C', 'D', 'E',];
+        $vertices = ['S', 'A', 'B', 'C', 'D', 'E',];
 
         #prepare array of edges listed by edge start to simplify Bellman-Ford updating weights of other edges
         $edges = [];
-        foreach($edgesRaw as $edgeRaw) {
+        foreach ($edgesRaw as $edgeRaw) {
             $edge = new Edge();
             $edge->start = $edgeRaw[0];
             $edge->end = $edgeRaw[2];
             $edge->weight = $edgeRaw[1];
-            if (! isset($edges[$edgeRaw[0]])) {
+            if (!isset($edges[$edgeRaw[0]])) {
                 $edges[$edgeRaw[0]] = [];
             }
             $edges[$edgeRaw[0]][] = $edge;
@@ -42,7 +42,7 @@ public function testBellmanFord()
             'B' => 5,
             'C' => 7,
             'D' => 9,
-            'E'=> 8
+            'E' => 8
         ]);
     }
 }