zettelkasten

Breadth First Search

Last updated: 1/9/2025

Breadth first search is a graph-search algorithm that can be used for a variety of situations. Some examples include:

  • Finding the shortest route
  • Figuring out if a friend of a friend has a cat

The reason why this is an efficient search algorithm for this problem is because it will find the minimum amount of edges needed for X.

See Also

  1. [[computer-science]]