Figure out an algorithm for better visualizations

[MuellMark]

Right now, all of the positions are hardcoded for visualizations. While this was fine for the original ddm labelings, it would be better to change this so that the cycle is on the outside. There are 2 parks to this issue. The first is making an algorithm to place all of the points in positions so that none of the edges overlap with any of the vertices. This would allow for graphs to have more than 8 vertices to be visualized. The second part is implementing the getCycles method in so that the graphs will look uniform other than the labelings. I don't thing this will be too hard, but some thinking will definitely need to be done to make sure it all works how it's supposed. This is a problem for later though