Three commonly used tree traversal techniques in PHP-PHP Tutorial-php.cn

Three commonly used tree traversal techniques in PHP

墨辰丷

Release： 2023-03-31 11:46:02

Original

2982 people have browsed it

This article mainly introduces three commonly used tree traversal techniques in PHP. Interested friends can refer to them. I hope it will be helpful to everyone.

The examples in this article describe the common methods of traversing trees in PHP, as follows:

1. Recursive depth-first algorithm:

<?php
define(&#39;DS&#39;, DIRECTORY_SEPARATOR);
function rec_list_files($from = &#39;.&#39;)
{
  if(!is_dir($from)) {
    return array();
  }
  $files = array();
  if($dh = opendir($from))
  {
    while(false !== ($file = readdir($dh))) {
      if($file == &#39;.&#39; || $file == &#39;..&#39;) {
        continue;
      }
      $path = $from . DS . $file;
       
      if (is_file($path)) {
        $files[] = $path;
      }
      $files = array_merge($files, rec_list_files($path));
    }
    closedir($dh);
  }
  return $files;
}
function profile($func, $trydir)
{
  $mem1 = memory_get_usage();
  echo &#39;<pre class="brush:php;toolbar:false">----------------------- Test run for &#39;.$func.&#39;() &#39;;
  flush();
  $time_start = microtime(true);
  $list = $func($trydir);
  //print_r($list);
  $time = microtime(true) - $time_start;
  echo &#39;Finished : &#39;.count($list).&#39; files

'; $mem2 = memory_get_peak_usage(); printf('

Max memory for &#39;.$func.&#39;() : %0.2f kbytes Running time for &#39;.$func.&#39;() : %0.f s

', ($mem2-$mem1)/1024.0, $time); return $list; } profile('rec_list_files', "D:\www\server"); ?>

Copy after login

2. Recursive depth-first algorithm (Using a stack to implement)

<?php
define(&#39;DS&#39;, DIRECTORY_SEPARATOR);
function deep_first_list_files($from = &#39;.&#39;)
{
  if(!is_dir($from)) {
    return false;
  }
  $files = array();
  $dirs = array($from);
  while(NULL !== ($dir = array_pop($dirs))) {
    if( $dh = opendir($dir)) {
      while( false !== ($file = readdir($dh))) {
        if($file == &#39;.&#39; || $file == &#39;..&#39;) {
          continue;
        }
        $path = $dir . DS . $file;
        if(is_dir($path)) {
          $dirs[] = $path;
        } else {
          $files[] = $path;
        }
      }
      closedir($dh);
    }
  }
  return $files;
}
function profile($func, $trydir)
{
  $mem1 = memory_get_usage();
  echo &#39;<pre class="brush:php;toolbar:false">----------------------- Test run for &#39;.$func.&#39;() &#39;;
  flush();
  $time_start = microtime(true);
  $list = $func($trydir);
  //print_r($list);
  $time = microtime(true) - $time_start;
  echo &#39;Finished : &#39;.count($list).&#39; files

'; $mem2 = memory_get_peak_usage(); printf('

Max memory for &#39;.$func.&#39;() : %0.2f kbytes Running time for &#39;.$func.&#39;() : %0.f s

', ($mem2-$mem1)/1024.0, $time); return $list; } profile('deep_first_list_files', "D:\www\server"); ?>

Copy after login

3. Non-recursive breadth-first algorithm (Using a queue to implement)

<?php
define(&#39;DS&#39;, DIRECTORY_SEPARATOR);
function breadth_first_files($from = &#39;.&#39;) {
  $queue = array(rtrim($from, DS).DS);// normalize all paths
  $files = array();
  while($base = array_shift($queue )) {
    if (($handle = opendir($base))) {
      while (($child = readdir($handle)) !== false) {
        if( $child == &#39;.&#39; || $child == &#39;..&#39;) {
          continue;
        }
        if (is_dir($base.$child)) {
          $combined_path = $base.$child.DS;
          array_push($queue, $combined_path);
        } else {
          $files[] = $base.$child;
        }
      }
      closedir($handle);
    } // else unable to open directory => NEXT CHILD
  }
  return $files; // end of tree, file not found
}
function profile($func, $trydir)
{
  $mem1 = memory_get_usage();
  echo &#39;<pre class="brush:php;toolbar:false">----------------------- Test run for &#39;.$func.&#39;() &#39;;
  flush();
  $time_start = microtime(true);
  $list = $func($trydir);
  //print_r($list);
  $time = microtime(true) - $time_start;
  echo &#39;Finished : &#39;.count($list).&#39; files

'; $mem2 = memory_get_peak_usage(); printf('

Max memory for &#39;.$func.&#39;() : %0.2f kbytes Running time for &#39;.$func.&#39;() : %0.f s

', ($mem2-$mem1)/1024.0, $time); return $list; } profile('breadth_first_files', "D:\www\server"); ?>

Copy after login

Summary: The above is the entire article Content, I hope it will be helpful to everyone’s study.

Related recommendations:

PHP’s method of integrating DISCUZ users

PHP processing session function Summary and sharing

PHP four basic sorting algorithms and two search algorithms

The above is the detailed content of Three commonly used tree traversal techniques in PHP. For more information, please follow other related articles on the PHP Chinese website!