Difference between revisions of "MinimumSpanningTree Command"
From GeoGebra Manual
m |
m |
||
Line 1: | Line 1: | ||
− | <noinclude>{{Manual Page|version=5.0}}</noinclude> | + | <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 12:45, 6 August 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.