本文實例講述了php可應用于面包屑導航的遞歸尋找家譜樹實現方法。分享給大家供大家參考。具體實現方法如下:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
|
<?php echo "<pre>" ; $area = array ( array ( 'id' =>1, 'area' => '北京' , 'pid' =>0), array ( 'id' =>2, 'area' => '廣西' , 'pid' =>0), array ( 'id' =>3, 'area' => '廣東' , 'pid' =>0), array ( 'id' =>4, 'area' => '福建' , 'pid' =>0), array ( 'id' =>11, 'area' => '朝陽區(qū)' , 'pid' =>1), array ( 'id' =>12, 'area' => '海淀區(qū)' , 'pid' =>1), array ( 'id' =>21, 'area' => '南寧市' , 'pid' =>2), array ( 'id' =>45, 'area' => '福州市' , 'pid' =>4), array ( 'id' =>113, 'area' => '亞運村' , 'pid' =>11), array ( 'id' =>115, 'area' => '奧運村' , 'pid' =>11), array ( 'id' =>234, 'area' => '武鳴縣' , 'pid' =>21) ); function familytree( $arr , $id ){ static $list = array (); foreach ( $arr as $v ){ if ( $v [ 'id' ]== $id ){ familytree( $arr , $v [ 'pid' ]); $list [] = $v ; } } return $list ; } print_r(familytree( $list ,113)); ?> |
希望本文所述對大家的php程序設計有所幫助。