Which type of traversal guarantees that we find the most optimal path between two nodes in a graph

	a.	None of these
	b.	Breadth First Search
	c.	Depth First Search
	d.	Greedy First Search

Which of the following traversals is best in terms of time and finding the optimal path?

	a.	Breadth First Search
	b.	Greedy First Search
	c.	None of these
	d.	A*

If we finish Dijksta's algorithm and a node still has an estimated distance of infinity this means _______.

	a.	that we need to run the relaxation method again
	b.	an error occurred
	c.	None of these
	d.	a path does not exist from the source to that node