Never knew about Prim's algorithm. The problem of finding minimal length of intergalactic road is really a simple one but won't this get complex when we bring out big problems, for e.g. the travelling salesman problem? Are there better algorithms than this?
That banner is sleek btw :)
It is a NP problem. If I remember well you can show that it is equivalent to solving the travelling salesman problem. So there is no quick way to solve it.
And thanks for pointing out the mistake in the banner. :) It has been corrected.