image.png
    源码

    1. class node {
    2.     constructor(value) {
    3.         this.value = value;
    4.         this.neighbour = [];
    5.     }
    6. }
    8. const a = new node('a');
    9. const b = new node('b');
    10. const c = new node('c');
    11. const d = new node('d');
    12. const e = new node('e');
    14. a.neighbour.push(b);
    15. a.neighbour.push(c);
    16. b.neighbour.push(a);
    17. b.neighbour.push(c);
    18. b.neighbour.push(d);
    19. c.neighbour.push(a);
    20. c.neighbour.push(b);
    21. c.neighbour.push(d);
    22. d.neighbour.push(b);
    23. d.neighbour.push(c);
    24. d.neighbour.push(e);
    25. e.neighbour.push(d);
    27. /**
    28.  * 图的广度优先搜索
    29.  * @param {*} node 
    30.  * @param {*} target 
    31.  * @param {*} path 
    32.  * @returns 
    33.  */
    34. function bfc(node, target, path = []) {
    35.     if (node == null || node.length == 0) return false;
    36.     let nextNode = [];
    37.     for (let i = 0; i < node.length; i++) {
    38.         if (path.indexOf(node[i]) > -1 ) continue;
    39.         console.log(node[i].value, target)
    40.         path.push(node[i]);
    41.         if (node[i].value == target) return true;
    42.         else nextNode = nextNode.concat(node[i].neighbour)
    43.     }
    44.     return bfc(nextNode, target, path)
    45. }
    47. console.log(bfc([a], 'e'))