Redo which rooms gets connected to other rooms

[JackAshwell11]

Possible ideas:

• Create a complete graph and construct a minimum spanning tree. This is probably the best idea, but when adding some edges back in, we need a way to make sure long connections aren't added back in
• Use stored containers and get their neighbours constructing a graph
• Use a Delaunay triangulation to create a graph between all the different rooms with no intersections
• Randomly pick rooms to connect making sure every room is reachable
• Use the bsp tree generated to connect each room with its neighbour (this is probably identical to the sequential version)

[JackAshwell11]

The final idea was to construct a complete graph as an adjacency list then create a minimum spanning tree from that graph. Then the biggest distance from the mst was multiplied by 1.5 and all extra connections which were less than or equal to that value were saved. Finally, 20% of the saved connections were then added back into the graph and A* would draw them.