js简单实现树和图的优先搜索

优先搜索

一.树的优先搜索

1.深度

//创建一个树
function Node(value){
    this.value=value;
    this.childs=[];
}
var a = new Node("a");
var b = new Node("b");
var c = new Node("c");
var d = new Node("d");
var e = new Node("e");
var f = new Node("f");

a.childs.push(c);
a.childs.push(f);
a.childs.push(b);
b.childs.push(d);
b.childs.push(e);

function deepSearch(root,target){
    if(root==null) return false;
    if(root.value==target) return true;
    var result=false;
    for(var i=0;i<root.childs.length;i++){
    result|=deepSearch(root.childs[i],target);
    }
    return result ? true : false;
}
deepSearch(a,'f');

2.广度

//创建一个树
function Node(value){
    this.value=value;
    this.childs=[];
}
var a = new Node("a");
var b = new Node("b");
var c = new Node("c");
var d = new Node("d");
var e = new Node("e");
var f = new Node("f");

a.childs.push(c);
a.childs.push(f);
a.childs.push(b);
b.childs.push(d);
b.childs.push(e);


//roots 节点组，广度搜索，对每一层节点都遍历检查一遍，才进入下一层
function guang(roots,target){
    if(roots==null||roots.length==0) return false;
    var childs=[];//存放下一层的节点
    for(var i=0;i<roots.length;i++){//循环只会遍历一层节点
        if(roots[i].value==target){
            return true;
        }else{
            childs=childs.concat(roots[i].childs)
        }
    }
    return guang(childs,target);//进入下一层
}
console.log(bfs([a], "n"));

二.图的优先搜索

1.深度

//创建一个图
function Node(value) {
    this.value = value;
    this.neighbor = [];
}

var a = new Node("a");
var b = new Node("b");
var c = new Node("c");
var d = new Node("d");
var e = new Node("e");

a.neighbor.push(b);
a.neighbor.push(c);
b.neighbor.push(a);
b.neighbor.push(c);
b.neighbor.push(d);
c.neighbor.push(a);
c.neighbor.push(b);
c.neighbor.push(d);
d.neighbor.push(b);
d.neighbor.push(c);
d.neighbor.push(e);
e.neighbor.push(d);

//path  用于存放已经搜索过的节点
function deepSearch(node, target, path){
    if(node == null) return false;
    if(path.indexOf(node) > -1) return false;//查看是否已经查询过
    if(node.value == target) return true;
    path.push(node);//不是target，则加入已查询数组
    var result = false;
    for(var i = 0 ; i<node.neighbor.length ; i++){
    result |= deepSearch(node.neighbor[i], target, path);
    }
    return result ? true : false;//reuslt  1  0
}

console.log(deepSearch(b, "n", []));

2.广度

//创建一个图
function Node(value) {
    this.value = value;
    this.neighbor = [];
}

var a = new Node("a");
var b = new Node("b");
var c = new Node("c");
var d = new Node("d");
var e = new Node("e");

a.neighbor.push(b);
a.neighbor.push(c);
b.neighbor.push(a);
b.neighbor.push(c);
b.neighbor.push(d);
c.neighbor.push(a);
c.neighbor.push(b);
c.neighbor.push(d);
d.neighbor.push(b);
d.neighbor.push(c);
d.neighbor.push(e);
e.neighbor.push(d);

//path  用于存放已经搜索过的节点
//nodes  节点组，广度搜索，对每一层节点都遍历检查一遍，才进入下一层
function guang(nodes,target,path){
    if(nodes == null||nodes.length == 0) return false;
    var nextNodes=[];//存放下一层节点
    for(var i = 0;i < nodes.length ; i++){//循环只会遍历一层节点
        if(path.indexOf(nodes[i])>-1) continue;//已经查询过，进入下一个循环
        path.push(nodes[i]);//没查询过，将其加入path，下面进行查询
        if(nodes[i].value == target){
            return true;
        }else{
            nextNodes = nextNodes.concat(nodes[i].neighbor);
        }
    }
    return guang(nextNodes,target,path)//进入下一层节点
}