Suppose, you are facing the problem of finding alternative routes in the face of a traffic jam. Which of the following graph algorithms might be a good choice for this use case?

	(a)	A* Search
	(b)	Minimal Spanning Tree
	(c)	Random walk
	(d)	All pairs shortest path
	(e)	Depth-first Search