CS 3.1. (ALEVEL) - Graph Traversal

Question 1

Depth-first search

Answer 1

branch is fully explored before backtracking
-uses stack
- test yourself with example on PMT

Question 2

Breadth-first search

Answer 2

-a node is fully explored before venturing onto next node
-uses queue
-only works on connected graph
-useful for determining shortest path
-when queue is empty algorithm terminates
-test yourself with example on PMT