Implementation of prim's minimum spanning tree algorithm
Merge branch 'master' into prim_mst

Conflicts:
	project.clj
	test/loom/test/alg.clj
Update documentation string
Changes to reduce the number of nodes stored in the heap.

This change will maintain the heap size to O(N) and will not add duplicate entries
to the heap. The key to the heap is also a int and not an list.
Merge pull request #24 from gdevanla/prim_mst

Implementation of Prim's algorithm for Minimum spanning tree