Adding a binary heap library for optimizing Prim's Algorithm's greedy search for the least weight edge that connects an unconnected vertex to a minimum spanning tree
Correcting some minor typos that WebStorm complained about and enhancing the graph generation to make sure the target number of edges are always generated by decrementing the loop counter whenever it becomes necessary to reject a randomly rolled "next edge".
A first pass at a Prim's Algorithm based search, it needs a standard optimization still.  The current algorithm is using back-edges as-is without attempting to optimize them with a a shorter path.  Its worth check-pointing here before picking up those modifications.
Tying the new binary heap library and its consumer, the JCH solution for Travellin' Bob', into the main tsp.html page so it will get run and scored.  It currently is sub-par, but that is expected because the optimization of pruning backedged when possible has not been implemented yet.