next up previous
Next: Pseudocode Up: CSE 2320: Algorithms and Previous: Breadth-First Search (BFS)

BFS Data Structures

A node in a BF tree represents a vertex

pred
vertex
distance
visited



Use a queue to remember frontier of search



Note: Cormen et al.'s BFS algorithm uses color instead of visited.



Copyright © 1998 The University of Texas at Arlington