无极分类获取函数

function tree($list,$pid=0,$level=0,$html='-|'){
    global $tree;
    if(!$tree) $tree = array();
    foreach($list as $v){
        if($v['FID'] == $pid){
            $v['sort'] = $level;
            $v['html'] = str_repeat($html,$level);
            $tree[] = $v;
            tree($list,$v['ID'],$level+1);
        }   
    }   
    return $tree;
}