What is a common use of Breadth-First Search?

A. simple hash-table implementations B. shortest paths in unweighted graphs C. workloads with strong locality of reference D. fast random access when the index is known