How does depth first search order its visits?

• Level by level in waves
• Down one path as far as it goes
• Alphabetical by node name

How does breadth first search order its visits?

• Down one path, then backtrack
• Level by level, neighbours first
• Largest nodes first

Which structure forces the level by level order?

• A stack
• A visited set alone
• A queue

Visited nodes must be recorded, or a cycle loops the search forever.

Circle one:   True   False

You swap the queue for a stack in the same search loop. What changes?

• Breadth first becomes depth first
• The graph gains new edges
• Cycles vanish on their own

Breadth first search reaches a node for the first time. What do you know?

• It arrived by a shortest hops route
• It arrived by the longest route
• It arrived with heaviest weights

You need the fewest hops route on an unweighted graph. Which do you pick?

• Depth first search
• Dijkstra on weights
• Breadth first search

Start at A. Neighbours: A: B, C. B: D. C: D. D: none. Which order is breadth first from A?

• A, B, D, C
• A, B, C, D
• A, D, C, B