深度和广度遍历

最新推荐文章于 2022-05-06 09:12:16 发布

杨晓白

最新推荐文章于 2022-05-06 09:12:16 发布

阅读量102

点赞数

分类专栏： js基础

原文链接：https://blog.csdn.net/qq_43540219/article/details/108173678

版权

js基础专栏收录该内容

11 篇文章 1 订阅

订阅专栏

深度和广度遍历

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Document</title>
</head>
<body>
    <div class="parent">
        <div class="child-1">
          <div class="child-1-1">
            <div class="child-1-1-1">
              a
            </div>
          </div>
          <div class="child-1-2">
            <div class="child-1-2-1">
              b
            </div>
          </div>
          <div class="child-1-3">
            C
          </div>
        </div>
        <div class="child-2">
          <div class="child-2-1">
            d
          </div>
          <div class="child-2-2">
            e
          </div>
        </div>
        <div class="child-3">
          <div class="child-3-1">
            f
          </div>
        </div>
      </div>
    <script>

        /* 深度优先遍历DFS 与树的先序遍历比较类似。
假设初始状态是图中所有顶点均未被访问，则从某个顶点v出发，
首先访问该顶点然后依次从它的各个未被访问的邻接点出发深度优先搜索遍历图，
直至图中所有和v有路径相通的顶点都被访问到。若此时尚有其他顶点未被访问到，
则另选一个未被访问的顶点作起始点，重复上述过程，直至图中所有顶点都被访问到为止。 */
/*深度优先遍历三种方式*/
let deepTraversal1 = (node, nodeList = []) => {
  if (node !== null) {
    nodeList.push(node)
    let children = node.children
    for (let i = 0; i < children.length; i++) {
      deepTraversal1(children[i], nodeList)
    }
  }
  return nodeList
}
let deepTraversal2 = (node) => {
    let nodes = []
    if (node !== null) {
      nodes.push(node)
      let children = node.children
      for (let i = 0; i < children.length; i++) {
        nodes = nodes.concat(deepTraversal2(children[i]))
      }
    }
    return nodes
  }
// 非递归
let deepTraversal3 = (node) => {
  let stack = []
  let nodes = []
  if (node) {
    // 推入当前处理的node
    stack.push(node)
    while (stack.length) {
      let item = stack.pop()
      let children = item.children
      nodes.push(item)
      // node = [] stack = [parent]
      // node = [parent] stack = [child3,child2,child1]
      // node = [parent, child1] stack = [child3,child2,child1-2,child1-1]
      // node = [parent, child1-1] stack = [child3,child2,child1-2]
      for (let i = children.length - 1; i >= 0; i--) {
        stack.push(children[i])
      }
    }
  }
  return nodes
}





/* 广度优先遍历 BFS
从图中某顶点v出发，
在访问了v之后依次访问v的各个未曾访问过的邻接点，然后分别从这些邻接点出发依次访问它们的邻接点，
并使得“先被访问的顶点的邻接点先于后被访问的顶点的邻接点被访问，直至图中所有已被访问的顶点的邻接点都被访问到。
 如果此时图中尚有顶点未被访问，则需要另选一个未曾被访问过的顶点作为新的起始点，重复上述过程，直至图中所有顶点都被访问到为止。广度优先操作 */






let widthTraversal2 = (node) => {
  let nodes = []
  let stack = []
  if (node) {
    stack.push(node)
    while (stack.length) {
      let item = stack.shift()
      let children = item.children
      nodes.push(item)
        // 队列，先进先出
        // nodes = [] stack = [parent]
        // nodes = [parent] stack = [child1,child2,child3]
        // nodes = [parent, child1] stack = [child2,child3,child1-1,child1-2]
        // nodes = [parent,child1,child2]
      for (let i = 0; i < children.length; i++) {
        stack.push(children[i])
      }
    }
  }
  return nodes
}






console.log(document.querySelector('.parent'));
console.log(deepTraversal1(document.querySelector('.parent')))
// let node=document.querySelectorAll("div")
// console.log(node,Array.from(node),"====");
// var newArr= [].slice.call(node)
// console.log(deepTraversal1(newArr));
    </script>
    
</body>
</html>```

杨晓白

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
深度和广度遍历

深度和广度遍历<!DOCTYPE html><html lang="en"><head> <meta charset="UTF-8"> <meta http-equiv="X-UA-Compatible" content="IE=edge"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <titl
复制链接

扫一扫