深度優先和廣度優先--搜索算法

1 樹狀結構

var result = {
    id:0,
    name:"張飛",
    item:[
        {id:1,name:"關羽"},
        {id:2,name:"劉備",item:[
            {id:5,name:"荀彧"},
            {id:6,name:"關平"}

        ]},
        //點擊曹操這一項，加載出來劉禪和周倉，點擊周倉，又異步加載項羽和別姬
        {id:3,name:"曹操",item:[
            {id:8,name:"劉禪"},
            {id:9,name:"周倉",item:[
                {id:10,name:"項羽"},
                {id:11,name:"別姬"}
            ]}
        ]},
        {id:4,name:"貂蟬"},
    ]
}
function cb(node) {
  console.log(node)
}

2 深度優先

function dfs(nodes,key,cb,parent=null,args=null){
    //對於入參的判斷，node必須存在且是一個數組，若是不是，進行矯正
    //key 必須是一個字符串，不能是函數之類的
    // cb必須是一個函數
    if(!nodes){
        return false;
    }
    if(typeof cb != 'function') {
        return fasle;
    }
    if(!Array.isArray(nodes)) {
        nodes = [nodes];
    }
    nodes.forEach((node) => {
        cb(node,parent,args)
        dfs(node[key],key,cb,node,args)
    })
}

3 廣度優先

function bfs(nodes,cb,childKey,parent = null) {
    if(!nodes){
        return false;
    }
    if(typeof cb != 'function') {
        return fasle;
    }
    if(!Array.isArray(nodes)) {
        nodes = [nodes];
    }
    const stack = [];
    nodes.forEach((node) => {
        stack.push(node);
    })
    while(stack.length > 0) {
        let node = stack.shift();
        cb(node);
        stack.push(...(node[childKey] || []));
    }
}