🌃
Limited Algorithm
search
⌘Ctrlk
🌃
Limited Algorithm
  • Summary
  • Hash & TreeMap
  • Queue &Stack & PQ
  • Hybrid Data Structure
  • Graph
    • Summary
    • 基本功&母体 skip
    • Graph Theory II& III Problem of Connectivity and Reachable
    • Graph Theory IV& V:  Shortest Path: BFS
      • Series I & II & III
      • Question 1 Jump Game
      • Question 2 Word Ladder I
      • Question 3 Seven Puzzle
      • Question 4 Shortest Path to Get Food
      • Question 1 Minimum Moves to Spread Stones Over Grid
      • Question 2 Word Ladder kBFS version
      • Series V & VI
      • Question 3 0-1 Matrix
      • Question 4 Rotten Orange
      • Question 5 Walls and gates
    • Graph Theory VI: Shortest Path III Dijkstra Algorithm
    • Graph Theory VIII Topological Order
    • Graph Theory IX Introduction to Disjoint Set(Union Find)
    • Graph Theory X: Union Find More Ractcce on UF
    • Graph Theory XI: UF 拓展 && Minimum Spanning Tree I & II
  • Graph Backtracking and Others
  • Tree
  • Pure Recursion & Backtracking
  • Dynamic Programming
  • Others
  • Array& LinkedList & String
  • Adavance Two Pointer
  • Advance Sliding Window
  • Advance Binary Search
  • Advance Young's Matrix
  • Java Knowledge
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Graph

Graph Theory IV& V:  Shortest Path: BFS

BFS

Series I & II & IIIchevron-rightQuestion 1 Jump Gamechevron-rightQuestion 2 Word Ladder Ichevron-rightQuestion 3 Seven Puzzlechevron-rightQuestion 4 Shortest Path to Get Foodchevron-rightQuestion 1 Minimum Moves to Spread Stones Over Gridchevron-rightQuestion 2 Word Ladder kBFS versionchevron-rightSeries V & VIchevron-rightQuestion 3 0-1 Matrixchevron-rightQuestion 4 Rotten Orangechevron-rightQuestion 5 Walls and gateschevron-right
PreviousQuestion 6 Similar String Groupschevron-leftNextSeries I & II & IIIchevron-right

Last updated 2 years ago