遍历树的方法一

递归的深度优先的算法

1. define('DS', DIRECTORY_SEPARATOR);
2. function rec_list_files($from = '.')
3. {
4. if(!is_dir($from)) {
5. return array();
6. }
7. $files = array();
8. if($dh = opendir($from))
9. {
10. while(false !== ($file = readdir($dh))) {
12. if($file == '.' || $file == '..') {
13. continue;
14. }
15. $path = $from . DS . $file;
17. if (is_file($path)) {
18. $files[] = $path;
19. }
20. $files = array_merge($files, rec_list_files($path));
21. }
22. closedir($dh);
23. }
24. return $files;
25. }
26. function profile($func, $trydir)
27. {
28. $mem1 = memory_get_usage();
29. echo '

    ----------------------- Test run for '.$func.'() ';

30. flush();
31. $time_start = microtime(true);
32. $list = $func($trydir);
33. //print_r($list);
34. $time = microtime(true) - $time_start;
35. echo 'Finished : '.count($list).' files';
36. $mem2 = memory_get_peak_usage();
37. printf('

    Max memory for '.$func.'() : %0.2f kbytes Running time for '.$func.'() : %0.f s

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

复制代码