# 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