Game: choose the best algorithm for each graph scenario.

Answer each scenario with the algorithm that best fits the graph question.

Stage 1: Which algorithm certifies the shortest path by number of edges in an unweighted campus map?
Stage 2: Which algorithm is a natural choice when you want to dive through one connected component and inspect backtracking structure?
Stage 3: The edges carry nonnegative travel times. Which algorithm should choose the cheapest route?
Stage 4: You need a legal order for pipeline steps with prerequisites and no cycles. Which algorithmic idea fits?

Algorithms