Breadth-first Search in PHP

<?php

class BFS {
   public function bfs($G, $startVert) {
       $visited = array();
       for($i = 0; $i < $G->size; $i++) {
           array_push($visited, false);
       }
       $q = SplQueue();
       
       $q->enqueue($startVert);

       while(!$q->isEmpty()) {
           $v = $q->dequeue();
           foreach($G->adj[$v] as $adjV) {
               if(!$visited[$adjV]) {
                   $visited[$adjV] = true;
                   $q->enqueue($adjV);
               }
           }
       }
   }
}

// Example class of what a graph might look like.
class Graph {
   public $adj;
   public $size;
}