Publisher - Dependence and hierarchy of nodes to publish.php

gistfile1.php

<?php

$nodes =  [
    '1' => ['50'],
    '2' => ['21','53', '14'],
    '21' => ['53', '10', '15'] ,
    '10' => ['14', '1'],
    '14' => [],
    '15' => ['21'],
    '53' => [ '14'] ,
];



$publisher = new Publisher(  [ 1, 2 , 53 ] , $nodes  ) ;



print_R( $nodes ) ;


$publisher->run();

class Publisher {
    private $pending = [];
    private $sent = [];
    private $nodeDependences = [];
    public function __construct( Array $nodes , $nodeDependences  ) {
        $this->pending = $nodes ;
        // nodeDependences is a mock to show dependences for this algorithm
        $this->nodeDependences = $nodeDependences ;

    }
    public function run( ) {
        while (!empty( $this->pending )) {
            $nodeId = array_shift( $this->pending ) ;
            if ( $this->hasDependences( $nodeId  )) {
                continue ;
            }
            $this->sendToPublish( $nodeId  );
        }
    }
    public function hasDependences( $nodeId ) {
        // echo "CHECK: NODE: {$nodeId}" . PHP_EOL ;
        if (!isset( $this->nodeDependences["$nodeId"] ) || empty($this->nodeDependences["$nodeId"]   )) {
            return false  ;
        }
         $pending = array_values( array_diff( $this->nodeDependences["$nodeId"], $this->pending, $this->sent  ) ) ;
         if ( empty( $pending )) {
            return false ;
        } else {
             $this->pending =array_merge(  [ $pending[0] , $nodeId  ]   ,  $this->pending  )  ;
            return true ;
        }


    }
    public function sendToPublish( $nodeId) {

        echo "\t >> Publish: NODE: {$nodeId}" . PHP_EOL ;
        $this->sent[] = $nodeId ;
    }

}