CS 112
Lecture 24
More on Graphs and Graph Traversal
Final Details aboutthe Final Project
Graph Traversal, Depth First Search and Connectivity
- Applications of DFS to Connectivity problems:
- Decide if an undirected graph is
connected.
- Decide if there exists a path from a given node v to
another node u in a directed graph.
- Decide if there exists a node
that cannot be reached from a node v, in a directed graph.
- List all the nodes reachable from a given node v.
Interpretation for computer networks, road networks, etc.
Ileana Streinu