修正された無限分類再帰関数を見つける

// ========== findFather函数 START ==========     // 功能:无限级分类之找出父层的相关数据     // 参数:$classID,当前子层的编号     //          $type,0找自己 1找父亲 2找祖先 3找家谱     // 字段:classID主键,自生成 classFID父编号     //          className分类名称 classCount分类统计function findFather($classID,$type)     {       global $flist,$forefather;        define("_STR_CUT", " -> ");        $sql         = 'select * from mar_menu where id = "'.$classID.'"';       	$res1       =  _query($sql);         $row=_fetch_array($res1);        if ($row)         {            //取值            $classFID  = $row['ppid'];            $classID   = $row['id'];            $className = $row['m_title'];            //若找到祖先,即classFID为0,则将函数状态设为0            if ($classFID == '0') $type='0';         }        if ($type == '1') //找父亲         {            $type = '0'; //第二次开始函数状态为0,即循环2次             findFather($classFID,$type);             $flist = $flist . _STR_CUT . $className; //生成家谱         }        else if ($classFID != '0' AND $type == '2') //找祖先,状态type为2,祖先classFID不为0未找到         {             findFather($classFID,$type);             $flist = $flist . _STR_CUT . $className; //生成家谱         }        else if ($type == '3')         {             findFather($classFID,$type);            $flist = $flist . _STR_CUT . $className; //生成家谱         }        else if ($type == '0')         {            $forefather = $className;         }        $result = $forefather . $flist;        return $result;             }