lintcode-solutions
  • LintCode 刷题笔记
  • 课程笔记
    • Backtracking
    • Binary Search
    • Divide & Conquer
    • Breadth First Search
    • Depth First Search
    • Linked List & Array
    • Two Pointers
    • Stack, Queue and Heap
    • Dynamic Programming
    • Two Pointers Advanced
    • Union Find and Trie
    • Dynamic Programming Advanced
  • 基础知识储备
    • Python
      • Stack and Queue
      • Namedtuple
      • Priority Queue
      • isinstance()
      • OrderedDict
      • set and frozen set
      • Counter
      • Heap
    • Bit Manipulation
    • Fenwick Tree or Binary Indexed Tree
    • Rabin-Karp Algorithm
    • Sort
      • Merge Sort
      • Quick Sort
      • Heap Sort
  • LintCode 练习题
    • Binary Search
  • OJ Review
    • Aug 7, 2018
    • Aug 8, 2018
    • Aug 9, 2018
    • Aug 13, 2018
    • Aug 17, 2018
    • Aug 19, 2018
    • Aug 24, 2018
    • Aug 26, 2018
    • Aug 27, 2018
    • Aug 29, 2018
    • Sep 1, 2018
    • Sep 2, 2018
    • Sep 3, 2018
    • Sep 4, 2018
    • Oct 28, 2018
    • Nov 13, 2018
Powered by GitBook
On this page
  • 宽度优先搜索
  • 什么时候应该使用 BFS ？
  1. 课程笔记

Breadth First Search

宽度优先搜索

Table of Contents

  • 二叉树上的 BFS

  • 图上的 BFS

    • 拓扑排序 Topological Sorting

  • 棋盘上的 BFS

什么时候应该使用 BFS ？

图的遍历 Traversal in Graph

  • 层级遍历 Level Order Traversal

  • 由点及面 Connected Component

  • 拓扑排序 Topological Sorting

最短路径 Shortest Path in Simple Graph

  • 仅限简单图求最短路径

  • 即，图中每条边长度都是 1，且没有方向

PreviousDivide & ConquerNextDepth First Search

Last updated 5 years ago