Uniform-Cost Search
		QUEUEING-FN ß HEAP-INSERT(node.cost)
			Same as Breadth-First Search if cost µ depth