Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

We generate a complete euclidean graph by taking N random points from a limited (1.0 x 1.0 square) 2D space, connecting them all together (complete graph) and giving the edges weights proportional (or equal) to the euclidean distance in space between the two incident points (euclidean graph).

If the random point generator in uniform, then if N is big enough it should be visible, that the points form a semi-regular grid of points.

I am to generate a Minimum Spanning Tree of such a graph (using Prim's algorithm).

The question is:
Should I expect any characteristic patterns of the tree?

Kindest regards,

share|cite|improve this question
The Math Overflow question at… may be relevant here. – Kevin Costello Mar 25 '12 at 8:59

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.