Depth First vs Breadth First
Depth First
Stack or recursion
Many applications
Breadth First
Queue (recursion no help)
Can be used to find shortest paths from the start vertex
Previous slide
Next slide
Back to first slide
View graphic version