# Difference between revisions of "MinimumSpanningTree Command"

From GeoGebra Manual

m (Text replace - "<div class="box info"> 48px|left This page is part of the official manual for print and pdf. For structural reasons normal users can't edit this page. If you found any errors on this page please contact ) |
m |
||

Line 1: | Line 1: | ||

− | <noinclude>{{Manual Page|version= | + | <noinclude>{{Manual Page|version=5.0}}</noinclude> |

{{command|discrete}} | {{command|discrete}} | ||

;MinimumSpanningTree[ <List of Points> ] | ;MinimumSpanningTree[ <List of Points> ] | ||

:Returns the minimum spanning tree of a complete graph on given vertices in which weight of edge ''(u,v)'' is the Euclidian distance between ''u'' and ''v''. The resulting object is a [[locus]]. | :Returns the minimum spanning tree of a complete graph on given vertices in which weight of edge ''(u,v)'' is the Euclidian distance between ''u'' and ''v''. The resulting object is a [[locus]]. |

## Revision as of 05:37, 30 July 2015

- MinimumSpanningTree[ <List of Points> ]
- Returns the minimum spanning tree of a complete graph on given vertices in which weight of edge
*(u,v)*is the Euclidian distance between*u*and*v*. The resulting object is a locus.