next next up down toc toc mail

7.6.  BFS

BFS can be used to find the shortest distance between a starting node and the remaining nodes of the graph.

Give a start node s, a general algorithm for the BFS approach as follows:


back next up down toc toc mail

Created by unroff & hp-tools. © by Hans-Peter Bischof. All Rights Reserved (1998).

Last modified: 27/July/98 (12:14)