Home > Others

Self-made infinite classification algorithm.

Source: Internet
Author: User
Developer on Alibaba Coud: Build your first app with APIs, SDKs, and tutorials on the Alibaba Cloud. Read more ＞

JavaScript version:

<!DOCTYPE HTML><HTMLLang= "ZH-CN"><Head>    <MetaCharSet= "Utf-8">    <title></title></Head><Body>        <Scripttype= "Text/javascript">        vararr= {            '1'  : 0,            '2'  : 1,            '3'  : 0,            '4'  : 1,            '5'  : 2,            '6'  : 0,            '7'  : 6,            '8'  : 5,            '9'  : 8,            'Ten'  : 8        }; varId,i=0; /** * tree = [{id:,pid:,level:}]*/        varTree= [];  for(varKeyincharr) {            if(Arr[key]==0){ //belongs to the topTree.push ({id:key,pid:arr[key],level:0}); }Else{ID=key; I= 0;  while(Arr[id]) {ID=Arr[id]; I++;            } tree.push ({id:key,pid:arr[key],level:i});    }} console.log (tree); </Script></Body></HTML>

PHP version

<?PHP/** * [Infiniteorder Unlimited class] * @author Enami * @date 2016-12-28 * @param [string] $list [Category List] * @param [string  ] $field _pid [field name for classification] * @param [string] $pval [Top End value] * @return [array] [list after category] * @throws*/functionInfiniteorder (&$list,$field _pid= ' pid ',$pval= 0){  //for caching results  $arr=Array(); foreach($list  as $key=$val){      $i= 0; if($val[$field _pid] !=$pval){//does not belong to the top          $id=$val[$field _pid ]; //when looping to the top end           while($val[$id] !=$pval){              $id=$val[$id ]; $i++; }      }      $val[' _level '] =$i; $arr[] =$val; }  return $arr;}

 Public functiongetinfinitelist () {$arr=Array(); //Category List        $list=$this-Select (); foreach($list  as $k 1=$v 1){            $arr[$v 1[' ID ']] =$v 1[' PID ']; }        $i= 0; foreach($arr  as $k 2=$v 2){            $level= 0; $pid=$v 2[' PID ']; if($pid! = 0) {//does not belong to the top                $level++; //when looping to the top end                 while($arr[$pid]! = 0){                    $pid=$arr[$pid]; $level++; }            }            $list[$i[' _level '] =$level; $i++; }        return $list; }

Self-made infinite classification algorithm.

This article is an English version of an article which is originally in the Chinese language on aliyun.com and is provided for information purposes only. This website makes no representation or warranty of any kind, either expressed or implied, as to the accuracy, completeness ownership or reliability of the article or any translations thereof. If you have any concerns or complaints relating to the article, please send an email, providing a detailed description of the concern or complaint, to info-contact@alibabacloud.com. A staff member will contact you within 5 working days. Once verified, infringing content will be removed immediately.

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

Get Started for Free

  • Sales Support

    1 on 1 presale consultation

    Chat Contact Sales

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

    Open a Ticket

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.

    Learn More