2 docs tagged with "breadth first search"

The goal of graph traversal is to visit each vertex in a graph. This can be done a multitude of ways.

Before we see how to find the shortest path from vertex $a$ to vertex $b$ we need to define a few things.