How to implement multi-level classification spanning tree in PHP-PHP Tutorial-php.cn

How to implement multi-level classification spanning tree in PHP

墨辰丷

Release： 2023-03-28 07:40:02

Original

1501 people have browsed it

This article mainly introduces the method of implementing multi-level classification spanning tree in PHP, involving PHP mysql database operations and array and string traversal, replacement, combination and other related operation skills. Friends in need can refer to the following

The details are as follows:

Conditions, the classification in the database is based on id, fid (parent ID) to achieve multi-level classification!

Usage method:

$sql ="XXXXXXXXXX";   //sql语句
$res = $db->Select($sql);  //执行sql
$list=array();
treeList(treeGet($res),$list);  /生成树
print_r($res);  //打印出来看看！

Copy after login

Usage result:

┣推荐新闻啊
┃┣国际新闻
┃┣dfffffg
┃┣ttttttt
┃┃┗yyyyy

Copy after login

The code is as follows:

/**
* 选择SQL涵数
*
* @access public
* @param Array  $field  字段信息，支持涵数
* @param Array  $table  数据库表
* @param Array  $where  条件
* @return SQL SQL语句
*/
function treeGet($data)
{
  $tmptree=null;
  $tree=$data;
  return treeAddNodeToTree($tmptree,treegetbyuid($tree,0,@$field),$tree);
}
/**
*插入SQL涵数
*
* @access public
* @param Array  $fieldResult  字段信息，支持涵数
* @param Array  $table  数据库表
* @return SQL SQL语句
*/
function treeAddNodeToTree($Node,$miniTree,&$source)
{
  if(is_array($miniTree)) {
    foreach($miniTree as $k=>$v)
    {
      if(!count($miniTree[$k][&#39;child&#39;]=treeAddNodeToTree($miniTree[$k],treegetbyuid($source,@$v[&#39;id&#39;]),$source)))
      {
        unset($miniTree[$k][&#39;child&#39;]);
        $miniTree[$k][&#39;leaf&#39;]=true; //设置叶结点
      }
    }
    return $Node[&#39;child&#39;]=$miniTree;
  }
}
function treegetbyuid(&$stree,$uid)
{
  $dtree=array();
  if(is_array($stree)){
    foreach($stree as $k=>$v)
    {
      if($v[&#39;fid&#39;]==$uid)
      {
        $mytmp=array();
        $mytmp=$v;
        unset($stree[$k]);
        array_push($dtree,$mytmp);
        $mytmp=null;
      }
    }
  }
  return $dtree;
}
/**
*更新SQL涵数
*
* @access public
* @param Array  $fieldResult  字段信息，支持涵数
* @param Array  $table  数据库表
* @param Array  $where  条件
* @return SQL SQL语句
*/
function treeMakeDeep($deep)
{
  $returnValue="";
  for (;$deep;$deep--)
  {
    $returnValue.="┃";
  }
  return $returnValue."┣";
}
function treeList($treeData,&$List)
{
  static $deep=0;
  if(is_array($treeData))
  {
    foreach($treeData as $k=>$v)
    {
      $v[&#39;deepValue&#39;]=treeMakeDeep($deep);
      $v[&#39;deep&#39;]=$deep;
      $t=$v;
      unset($t[&#39;child&#39;]);
      array_push($List,$t);
      if($v[&#39;child&#39;])
      {
        ++$deep;
        $optionsNode.=treeList($v[&#39;child&#39;],$List);
        $deep--;
      }
    }
    if($lastV=array_pop($List))
    {
      $lastV[&#39;deepValue&#39;]=str_replace(&#39;┣&#39;,&#39;┗&#39;,$lastV[&#39;deepValue&#39;]);
      array_push($List,$lastV);
    }
  }
}
function treeSelect($tree,$id,$options="child")
{
  switch(strtolower($options))
  {
    case"child":
    $tmpTree=array();
    $deep=-1;
    foreach($tree as $k=>$v)
    {
      if($id==$v[&#39;id&#39;])
      {
        array_push($tmpTree,$v);
        $deep=$v[&#39;deep&#39;];
      } elseif($deep!=-1)
      {
        if($v[&#39;deep&#39;]<=$deep)
        {
          break;
        } else
        {
          array_push($tmpTree,$v);
        }
      }
    }
    break;
    case "remove":
    default:
    $tmpTree=array();
    $deep=-1;
    foreach($tree as $k=>$v)
    {
      if($id==$v[&#39;id&#39;])
      {
        $deep=$v[&#39;deep&#39;];
        continue;
      } elseif($deep!=-1)
      {
        if($v[&#39;deep&#39;]<=$deep)
        {
          array_push($tmpTree,$v);
          $deep=-1;
        }
        continue;
      }
      array_push($tmpTree,$v);
    }
  }
  return $tmpTree;
}

Copy after login

The above is the entire content of this article, I hope it will be helpful to everyone's study.

Related recommendations:

Large numberMulti-level classificationHow to design the fastest way to obtain, cache, and search queries for data?

sql Cascade query of multi-level classification

SQL processingMultiple Level classification, the query results are in a tree structure

The above is the detailed content of How to implement multi-level classification spanning tree in PHP. For more information, please follow other related articles on the PHP Chinese website!