next up previous
Next: BFS Data Structures Up: CSE 2320: Algorithms and Previous: Traversing Graphs

Breadth-First Search (BFS)


Breadth-first search produces breadth-first tree.
Path from s to x in BF tree is the shortest path in terms of the number of edges.

BFS: Given graph G = (V,E) and source s

Copyright © 1998 The University of Texas at Arlington