Graph Search Algorithm Summary

Name:	Result	Sort Criterion	Formula
Dijkstra	Shortest Path	Total cost	d + e
	to all nodes	from start
	from start node	to this node
Prim	Minimum Spanning	Cost of	e
	Tree to connect	connecting edge
	all nodes	to node
A*	Shortest Path	Estimated total	d + e + h
	to goal node	cost from start
	from start node	through this
		node to goal