Question: GraphTheory: creating a minimum spanning tree starting in a certain point and showing sequence

Suppose,  there are

  • 50 vertices

  • list of coordinates of these 50 vertices

 

Now I want to create a graph with minimum distance.

The starting point of the graph should be vertice 1. From there,  the closest point has to be added to a list X. and from this point, it should calculate again the closest point and add this value to the same list X.

 

So actually I want to start in point 1 and I want to see the sequence of how the graph (I think minimum spanning tree?) is created

 

How can I code this in Maple?

 

Thanks in advance!

Adam,

Please Wait...