💻
Grokking Algorithm
  • Chapter 1: Big O notation & Binary Search
  • Chapter 2: Selection Sort
  • Chapter 3: Recursion
  • Chapter 4: QuickSort
  • Chapter 5: Hash Tables
  • Chapter 6: Breadth-first Search
  • Chapter 7: Dijkstra's Algorithm
  • Chapter 8: Greedy Algorithm
  • Chapter 9: Dynamic Programming
  • Chapter 10: K-nearest neighbors
  • Chapter 11: Next?
Powered by GitBook
On this page

Was this helpful?

Chapter 6: Breadth-first Search

breadth-first search can slove the shortest-path problem.

  • What is a graph？A graph models a set of connections.

  • Refer to LinkedIn,o you need to search people in the order that they’re added. There’s a data structure for this: it’s called a queue.

    • First In First Out

PreviousChapter 5: Hash TablesNextChapter 7: Dijkstra's Algorithm

Last updated 5 years ago

Was this helpful?