PHP infinite hierarchical data implementation program code

Home

Backend Development

PHP Tutorial

PHP infinite hierarchical data implementation program code_PHP tutorial

WBOYWBOYWBOYWBOYWBOYWBOYWBOYWBOYWBOYWBOYWBOYWBOYWB

Jul 13, 2016 pm 04:56 PM

php one time introduce code about Classification Grading exist accomplish us data unlimited of program

Let’s introduce to you some usage of unlimited classification in PHP, including direct unlimited classification database and array operations. Friends in need can refer to it.

Let’s first look at the infinite classification of php and mysql databases

Create database:
id, fid, fname (both id and fid must be numeric types and the default value of fid must be set to 0;

The code is as follows

Copy code

代码如下

复制代码

$stime=microtime();

$db=@mysql_connect("localhost","root","micronsky.net") or die("数据库连接失入");
mysql_select_db("temp",$db);
//定义第一级分类
function mainfl()
{
global $db;
$result=mysql_query("select id,fid,fname from wxjfl where fid=0 order by id desc",$db);
if ($myrow=mysql_fetch_array($result)) {
do {
echo $myrow["fname"];
echo "
";
   echo subfl($myrow["id"],"　　");   //此处调用子级分类函数
   }
   while ($myrow=mysql_fetch_array($result));
}

}
//定义子级分类
function subfl($fid,$strdis)
{
global $db;
$result1=mysql_query("select id,fid,fname from wxjfl where fid=$fid   order by id desc",$db);
if ($myrow1=mysql_fetch_array($result1)) {
do {
   //echo $strdis;
   echo $strdis.$myrow1["fname"];
   echo "
";
   subfl($myrow1["id"],"　　".$strdis); //这里一定要注意并不需要像上面那个函数那样echo ...只要直接调用子级分类函数并付值就行了！同时这里也是递归部分
}
while ($myrow1=mysql_fetch_array($result1));
}
}

echo mainfl();

$ltime=microtime();
echo "
";
echo number_format($ltime-$stime,4); //统计执行时间，这里就比ASP快多了，但这跟写法没多大关系，主要是PHP本身加入了加速器的原因！

$stime=microtime();

$db=@mysql_connect("localhost","root","micronsky.net") or die("Database connection lost");

代码如下

复制代码

/**
* 创建父节点树形数组
* 参数
* $ar 数组，邻接列表方式组织的数据
* $id 数组中作为主键的下标或关联键名
* $pid 数组中作为父键的下标或关联键名
* 返回多维数组
**/
function find_parent($ar, $id='id', $pid='pid') {
foreach($ar as $v) $t[$v[$id]] = $v;
foreach ($t as $k => $item){
    if( $item[$pid] ){
      if( ! isset($t[$item[$pid]]['parent'][$item[$pid]]) )
         $t[$item[$id]]['parent'][$item[$pid]] =& $t[$item[$pid]];

$t[$k]['reference'] = true;
}
}
return $t;
}

/**
* 创建子节点树形数组
* 参数
* $ar 数组，邻接列表方式组织的数据
* $id 数组中作为主键的下标或关联键名
* $pid 数组中作为父键的下标或关联键名
* 返回多维数组
**/
function find_child($ar, $id='id', $pid='pid') {
foreach($ar as $v) $t[$v[$id]] = $v;
foreach ($t as $k => $item){
if( $item[$pid] ) {
$t[$item[$pid]]['child'][$item[$id]] =& $t[$k];

$t[$k]['reference'] = true;
}
}
return $t;
}

mysql_select_db("temp",$db); //Define the first level classification function mainfl() { global $db; $result=mysql_query("select id,fid,fname from wxjfl where fid=0 order by id desc",$db); if ($myrow=mysql_fetch_array($result)) { do { echo $myrow["fname"]; echo "
"; echo subfl($myrow["id"],"　"); //Call the sub-level classification function here } while ($myrow=mysql_fetch_array($result)); } } //Define sub-categories function subfl($fid,$strdis) { global $db; $result1=mysql_query("select id,fid,fname from wxjfl where fid=$fid order by id desc",$db); if ($myrow1=mysql_fetch_array($result1)) { do { //echo $strdis; echo $strdis.$myrow1["fname"]; echo "
"; Subfl($myrow1["id"],"　".$strdis); //Be sure to note here that there is no need to echo like the function above...just call the sub-level classification function directly and pay the value! At the same time, this is also the recursive part } while ($myrow1=mysql_fetch_array($result1)); } } echo mainfl(); $ltime=microtime(); echo "
"; echo number_format($ltime-$stime,4); //Statistical execution time, this is much faster than ASP, but this has little to do with the writing method, mainly because PHP itself has added an accelerator! ?> Now we directly use arrays for paging

The code is as follows

Copy code

/** * Create a tree array of parent nodes * Parameter * $ar array, data organized in adjacency list * $id is the subscript or associated key name as the primary key in the array * $pid is the subscript or associated key name as the parent key in the array * Return multidimensional array **/ function find_parent($ar, $id='id', $pid='pid') { foreach($ar as $v) $t[$v[$id]] = $v; foreach ($t as $k => $item){ If( $item[$pid] ){ If( ! isset($t[$item[$pid]]['parent'][$item[$pid]]) ) $t[$item[$id]]['parent'][$item[$pid]] =& $t[$item[$pid]]; $t[$k]['reference'] = true; } } Return $t; } /** * Create a tree array of child nodes * Parameter * $ar array, data organized in adjacency list * $id is the subscript or associated key name as the primary key in the array * $pid is the subscript or associated key name as the parent key in the array * Return multidimensional array **/ function find_child($ar, $id='id', $pid='pid') { foreach($ar as $v) $t[$v[$id]] = $v; foreach ($t as $k => $item){ If( $item[$pid] ) { $t[$item[$pid]]['child'][$item[$id]] =& $t[$k]; $t[$k]['reference'] = true; } } return $t; }

Example:

代码如下	复制代码
$data = array( array('ID'=>1, 'PARENT'=>0, 'NAME'=>'祖父'), array('ID'=>2, 'PARENT'=>1, 'NAME'=>'父亲'), array('ID'=>3, 'PARENT'=>1, 'NAME'=>'叔伯'), array('ID'=>4, 'PARENT'=>2, 'NAME'=>'自己'), array('ID'=>5, 'PARENT'=>4, 'NAME'=>'儿子') ); $p = find_parent($data, 'ID', 'PARENT'); $c = find_child($data, 'ID', 'PARENT');

The above two methods are to flatten all nodes into an array by ID, then find their parent or children, and attach the flat elements to parent and children by reference,

But the referenced elements still exist in the flat array. Therefore, in practical applications, it is best to mark those referenced elements to avoid starting the traversal with them as the root, resulting in duplication.

The code is as follows

Copy code

代码如下

复制代码

        foreach ($p as $key => $item) {
            if($item['reference']) continue;
            print_r($item);
        }

        foreach ($c as $key => $item) {
            if($item['reference']) continue;
            print_r($item);
        }

foreach ($p as $key => $item) {
                if($item['reference']) continue;
                                                 print_r($item);
} foreach ($c as $key => $item) {
                if($item['reference']) continue;
                                                 print_r($item);
}

Recursive method, after the PHP array element is deleted, the array cursor will return to zero, so some elements that have found their "home" during the traversal process have to stay in the array, and the search range for subsequent elements cannot be reduced:

The code is as follows

代码如下

复制代码

$mylist = array(array( 'parent_id'=>0,'id'=>1),
                    array( 'parent_id'=>0,'id'=>2),
                    array( 'parent_id'=>0,'id'=>3),
                    array( 'parent_id'=>2,'id'=>4),
                    array( 'parent_id'=>2,'id'=>5),
                    array( 'parent_id'=>3,'id'=>6),
                    array( 'parent_id'=>3,'id'=>7),
                    array( 'parent_id'=>4,'id'=>8),
                    array( 'parent_id'=>5,'id'=>9),
                    array( 'parent_id'=>5,'id'=>10)
                );

print_r(_findChildren($mylist, 0));

Copy code

http://www.bkjia.com/PHPjc/631571.html

www.bkjia.com

truehttp: //www.bkjia.com/PHPjc/631571.htmlTechArticle Let’s introduce to you some usage of unlimited classification in php, including direct unlimited classification database For operations with arrays, friends in need can refer to it. Let’s take a look first...

Statement of this Website

The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

Hot AI Tools

Undresser.AI Undress

AI-powered app for creating realistic nude photos

AI Clothes Remover

Online AI tool for removing clothes from photos.

Undress AI Tool

Undress images for free

Clothoff.io

AI clothes remover

Video Face Swap

Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Assassin's Creed Shadows: Seashell Riddle Solution

4 weeks ago By DDD

What's New in Windows 11 KB5054979 & How to Fix Update Issues

3 weeks ago By DDD

Where to find the Crane Control Keycard in Atomfall

4 weeks ago By DDD

How to fix KB5055523 fails to install in Windows 11?

2 weeks ago By DDD

InZoi: How To Apply To School And University

3 weeks ago By DDD

Hot Tools

Notepad++7.3.1

Easy-to-use and free code editor

SublimeText3 Chinese version

Chinese version, very easy to use

Zend Studio 13.0.1

Powerful PHP integrated development environment

Dreamweaver CS6

Visual web development tools

SublimeText3 Mac version

God-level code editing software (SublimeText3)

Hot Topics

Where is the login entrance for gmail email?

7747

Java Tutorial

1643

CakePHP Tutorial

1397

Laravel Tutorial

1291

PHP Tutorial

1234

Related knowledge

PHP 8.4 Installation and Upgrade guide for Ubuntu and Debian Dec 24, 2024 pm 04:42 PM

PHP 8.4 brings several new features, security improvements, and performance improvements with healthy amounts of feature deprecations and removals. This guide explains how to install PHP 8.4 or upgrade to PHP 8.4 on Ubuntu, Debian, or their derivati

7 PHP Functions I Regret I Didn't Know Before Nov 13, 2024 am 09:42 AM

If you are an experienced PHP developer, you might have the feeling that you’ve been there and done that already.You have developed a significant number of applications, debugged millions of lines of code, and tweaked a bunch of scripts to achieve op

How To Set Up Visual Studio Code (VS Code) for PHP Development Dec 20, 2024 am 11:31 AM

Visual Studio Code, also known as VS Code, is a free source code editor — or integrated development environment (IDE) — available for all major operating systems. With a large collection of extensions for many programming languages, VS Code can be c

Explain JSON Web Tokens (JWT) and their use case in PHP APIs. Apr 05, 2025 am 12:04 AM

JWT is an open standard based on JSON, used to securely transmit information between parties, mainly for identity authentication and information exchange. 1. JWT consists of three parts: Header, Payload and Signature. 2. The working principle of JWT includes three steps: generating JWT, verifying JWT and parsing Payload. 3. When using JWT for authentication in PHP, JWT can be generated and verified, and user role and permission information can be included in advanced usage. 4. Common errors include signature verification failure, token expiration, and payload oversized. Debugging skills include using debugging tools and logging. 5. Performance optimization and best practices include using appropriate signature algorithms, setting validity periods reasonably,

PHP Program to Count Vowels in a String Feb 07, 2025 pm 12:12 PM

A string is a sequence of characters, including letters, numbers, and symbols. This tutorial will learn how to calculate the number of vowels in a given string in PHP using different methods. The vowels in English are a, e, i, o, u, and they can be uppercase or lowercase. What is a vowel? Vowels are alphabetic characters that represent a specific pronunciation. There are five vowels in English, including uppercase and lowercase: a, e, i, o, u Example 1 Input: String = "Tutorialspoint" Output: 6 explain The vowels in the string "Tutorialspoint" are u, o, i, a, o, i. There are 6 yuan in total

How do you parse and process HTML/XML in PHP? Feb 07, 2025 am 11:57 AM

This tutorial demonstrates how to efficiently process XML documents using PHP. XML (eXtensible Markup Language) is a versatile text-based markup language designed for both human readability and machine parsing. It's commonly used for data storage an

Explain late static binding in PHP (static::). Apr 03, 2025 am 12:04 AM

Static binding (static::) implements late static binding (LSB) in PHP, allowing calling classes to be referenced in static contexts rather than defining classes. 1) The parsing process is performed at runtime, 2) Look up the call class in the inheritance relationship, 3) It may bring performance overhead.

What are PHP magic methods (__construct, __destruct, __call, __get, __set, etc.) and provide use cases? Apr 03, 2025 am 12:03 AM

What are the magic methods of PHP? PHP's magic methods include: 1.\_\_construct, used to initialize objects; 2.\_\_destruct, used to clean up resources; 3.\_\_call, handle non-existent method calls; 4.\_\_get, implement dynamic attribute access; 5.\_\_set, implement dynamic attribute settings. These methods are automatically called in certain situations, improving code flexibility and efficiency.

See all articles