next up previous
Next: Breadth-First Search (BFS) Up: CSE 2320: Algorithms and Previous: 2. Adjacency matrix

Traversing Graphs

Search for paths satisfying various constraints (e.g., shortest path)

Visit some set of vertices (e.g., tours)

Search for subgraphs (e.g., graph matching (isomorphisms))

Techniques:

1.
Breadth-First Search (BFS)
2.
Depth-First Search (DFS)



Copyright © 1998 The University of Texas at Arlington