7.5.
Traversing a Graph
There are two ways to traverse a graph.
Breadth-first search (BFS) and
Depth-first search ( DFS).
Created by
unroff & hp-tools.
© by Hans-Peter Bischof. All Rights Reserved (1998).
Last modified: 27/July/98 (12:14)
