My input is points in a 3d space. Now my goals is to build a minimum spanning tree where the edge cost is the euclidean distance between points (the points are vertices). My thoughts are to clump ...
I'm pretty new to working with graphs but I'm looking at using them to create the world map for our game (a text mud with rooms/nodes and paths/edges between rooms). There are a number of interesting ...