zoukankan      html  css  js  c++  java
  • 【js数据结构】图的深度优先搜索与广度优先搜索

    图类的构建

    function Graph(v) {
    this.vertices = v;
    this.edges = 0;
    this.adj = [];
      for (var i = 0; i < this.vertices; ++i)

      {
        this.adj[i] = [];
        this.adj[i].push("");
      }

    this.addEdge = addEdge;

    this.showGraph = showGraph;

    }

    function addEdge(v, w) {

    this.adj[v].push(w);

    this.adj[w].push(v);

    this.edges++;

    }

    function showGraph() {

    for (var i = 0; i < this.vertices; ++i)

    {
      putstr(i + " -> ");
      for (var j = 0; j < this.vertices; ++j )

       {
        if (this.adj[i][j] != undefined)

        {
          putstr(this.adj[i][j] + ' ');
        }
     }

      print();

    }
    }

     

    深度优先搜素

    f

    function dfs(v) {
      this.marked[v] = true;
      if (this.adj[v] != undefined)

       {
        print("Visited vertex: " + v);
      }

      for each(var w in this.adj[v]) {

        if (!this.marked[w]) {
        this.dfs(w);
        }
      }
    }

    广度优先搜索

      

    function bfs(s)

    {
      var queue = [];
      this.marked[s] = true;
      queue.push(s); // 添加到队尾
      while (queue.length > 0)

       {
        var v = queue.shift(); // 从队首移除
        if (v == undefined)

        {
          print("Visisted vertex: " + v);
        }

        for each(var w in this.adj[v])

        {

          if (!this.marked[w])

           {
            this.edgeTo[w] = v;
            this.marked[w] = true;
            queue.push(w);
          }
        }
      }
    }

     

    (本文为作者笔记,代码与图片皆出自《数据结构与算法 javascript 描述》一书)

  • 相关阅读:
    webpack学习遇到大坑(纯属自己记录)
    git忽略某些文件提交
    数据结构(一)创建并遍历线性列表
    数据结构二 顺序表的创建
    JqGrid动态改变列名
    构造DataTable
    计算机存储数据的单位
    .NET Core在WindowsServer服务器部署(使用Web Deploy发布)
    mysql ERROR 1045 (28000): 错误解决办法
    ASP.NET取得Request URL的各个部分
  • 原文地址:https://www.cnblogs.com/xiabaoying/p/6685163.html
Copyright © 2011-2022 走看看