Initial release

This release includes java files for the basic algorithm. If the UI version is run, it will draw the first circle that has at least 97% the radius of the largest possible circle computed by the voronoi diagram. Although sometimes the algorithm will run longer than others, it should not run past 500k generations, and in the event it does, just give it some time. Most runs don't even breach 200k generations.

If running the headless version, the DataCollector class will be launched instead of Main. Functionality is the same as the UI but runs with no graphics, and still computes to 97% minimum size of the largest computed size by the voronoi diagram. What this means is that the program will run the algorithm 50 times, with seed values for the random number generator starting at 0 and ending at 49. With each run, it will output the seed used, the final generation that contained the valid solution, the radius and the proximity the final solution had to the solution computed by the voronoi diagram.

Note that the largest possible radius computed by the voronoi diagram is not always the biggest radius. Sometimes the voronoi diagram returns a max value that the algorithm surpasses, therefore giving it a proximity value of over 100%