templesofcode / nodes-and-edges

src/BFS/BreadthFirstPaths.php

Indentation +3 added lines, -3 removed lines

@@ -141,7 +141,7 @@ 
      */
     public function hasPathTo(int $vertex)
     {
-         // validate this vertex in the context of the given graph
+            // validate this vertex in the context of the given graph
         Graph::validateVertex($vertex, $this->graph->getVertices());
         // return the flag
         return $this->marked[$vertex];
@@ -153,7 +153,7 @@ 
      */
     public function distTo(int $vertex)
     {
-         // validate this vertex in the context of the given graph
+            // validate this vertex in the context of the given graph
         Graph::validateVertex($vertex, $this->graph->getVertices());
         // return the value
         return $this->distTo[$vertex];
@@ -165,7 +165,7 @@ 
      */
     public function pathTo(int $vertex)
     {
-         // validate this vertex in the context of the given graph
+            // validate this vertex in the context of the given graph
         Graph::validateVertex($vertex, $this->graph->getVertices());
         // check if there is a path
         if (!$this->hasPathTo($vertex)) {

src/UndirectedGraph.php

Spacing +1 added lines, -1 removed lines

@@ -111,7 +111,7 @@
         // read in the edges
         for ($i = 0; $i < $edges; $i++) {
             // fet from source
-            $raw = $lines[$i+2];
+            $raw = $lines[$i + 2];
             // parse data
             list (
                 $v,

src/GraphClient.php

Spacing +1 added lines, -1 removed lines

@@ -70,6 +70,6 @@
             }
         }
         // self loop appears in adjacency list twice
-        return $count/2;   
+        return $count / 2;   
     }
 }

src/Graph.php

Spacing +2 added lines, -2 removed lines

@@ -46,7 +46,7 @@ 
         // get the ne
         if (!empty($adjacencyList)) {
             // set it
-            $this->adjacencyList= $adjacencyList;
+            $this->adjacencyList = $adjacencyList;
         } else {
             // init
             $this->adjacencyList = [];
@@ -160,7 +160,7 @@ 
      * @param bool $weight
      * @return array
      */
-    protected static function parseEdge(string $input,int $vertices, bool $weight = false)
+    protected static function parseEdge(string $input, int $vertices, bool $weight = false)
     {
         // clean
         $trimmed = trim($input);

src/EdgeWeightedGraph.php

Spacing +1 added lines, -1 removed lines

@@ -171,7 +171,7 @@
         // init
         $taken = [];
         // iterate over the edges
-        for ($i = 0; $i <$edges; $i++) {
+        for ($i = 0; $i < $edges; $i++) {
             // generate an edge
             do {
                 // generate

src/DFS/TopologicalOrder.php

Braces +1 added lines, -2 removed lines

@@ -107,8 +107,7 @@
         if ($this->hasOrder()) {
             // return the rank
             return $this->rank[$vertex];
-        }
-        else {
+        } else {
             // is not a DAG
             return -1;
         }

src/DFS/DepthFirstOrder.php

Indentation +1 added lines, -1 removed lines

@@ -111,6 +111,6 @@
      */
     public function reversePostorder()
     {
-       return $this->reversePost;
+        return $this->reversePost;
     }
 }
\ No newline at end of file

src/Edge.php

Spacing +1 added lines, -1 removed lines

@@ -117,7 +117,7 @@
         if ($weight < $otherWeight) {
             // return less than
             return -1;
-        } else if ($weight == $otherWeight){
+        } else if ($weight == $otherWeight) {
             // return equal
             return 0;
         } else {

src/Digraph.php

Spacing +1 added lines, -1 removed lines

@@ -111,7 +111,7 @@
         // read in the edges
         for ($i = 0; $i < $edges; $i++) {
             // fet from source
-            $raw = $lines[$i+2];
+            $raw = $lines[$i + 2];
             // parse data
             list (
                 $v,