next | next | up | down | Inhalt | Kommentar
all, section 6.6.

6.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:

[picture]

back | next | up | down | Inhalt | Kommentar

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

Last modified 22/May/97