TemplesOfCode\NodesAndEdges\DFS\EWDCC::dfs()

Complexity

Conditions	3
Paths	3

Size

Total Lines	18
Code Lines	8

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

<?php
    protected function dfs(int $vertex)
    {
        // we have visited now
        $this->marked[$vertex] = true;
        // set the component #
        $this->id[$vertex] = $this->count;
        // bump up the size of this component
        $this->size[$this->count]++;
        // get the neighbors
        $neighbors = $this->graph->adjacent($vertex);
        // iterate over the neighbors
        foreach ($neighbors as $neighbor) {
            /** @var Edge $neighbor */
            $w = $neighbor->other($vertex);
            // check if we have visited this vertex
            if (!$this->marked[$w]) {
                // we have not, lets visit with dfs
                $this->dfs($w);
            }