You now have the two most useful tools in Graph Theory. You can go deep (DFS) and you can surf the waves (BFS). You can solve grid problems, find shortest paths, and convert words.
BFS only finds the shortest path when all edges have equal weight. For weighted graphs, you will need Dijkstra's algorithm later in this course. But first, you will put BFS to work on grid problems in the next section: Flood Fill & Grid Graphs.