# Breadth-First Search

The Breadth-First Search answers two questions: is there a path from node a to node b? what is the shortest path from node a to node b? It is a graph algorithm. Graphs are made up of nodes and edges: Nodes are connected to other nodes called their neighbors. A directed graph is a node […]