广搜与八数码问题(续)

Loading...
Peking University
4.8 (304 ratings) | 21K Students Enrolled
View Syllabus

Reviews

4.8 (304 ratings)
  • 5 stars
    258 ratings
  • 4 stars
    34 ratings
  • 3 stars
    6 ratings
  • 2 stars
    2 ratings
  • 1 star
    4 ratings

It's a valuable experience and I learned a lot about algorithms, thanks you !

Prestigious University and of course with technical professors.

From the lesson
广度优先搜索
与深度优先搜索算法类似,广度优先搜索(广搜)也是常用的搜索图的算法。它的思想是从一个顶点开始,辐射状地优先遍历其周围较广的区域。一般可以用它做什么呢?一个最直观经典的例子就是走迷宫,从起点开始,找出到终点的最短路程,很多最短路径算法都是基于广搜的思想。广索的基本方法是使用队列存放已经扩展过的节点。本模块先以简单例题引入广搜的基本实现方法,然后再通过经典的"八数码"问题,进一步介绍状态表示、判重的节省时间和空间的技巧。

Taught By

  • Jiaying Liu 刘家瑛, Ph.D.

    Jiaying Liu 刘家瑛, Ph.D.

    Associate Professor
  • 郭 炜

    郭 炜

    讲师

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.