- Category:
- Other systems
- Tags:
-
- File Size:
- 22kb
- Update:
- 2017-07-07
- Downloads:
- 0 Times
- Uploaded by:
- 李
Description: Select a point X0, connect it from its nearest vertex X1, and then connect the nearest vertex X2 from X1, and go on and on until the final destination.
The language of Mathematics: greedy algorithm, graph G = in a given no (V, E), (U, V) on behalf of connected vertex u and vertex v (i.e., w) and edges (U, V) on behalf of the weight of this side, if there is a subset of E (i.e. T) and no cycle diagram makes w (T) is minimum, the T for the minimum spanning tree G.
To Search:
File list (Check if you may need any files):
[Content_Types].xml
_rels\.rels
word\_rels\document.xml.rels
word\document.xml
word\footnotes.xml
word\endnotes.xml
word\theme\theme1.xml
word\settings.xml
word\styles.xml
word\numbering.xml
docProps\app.xml
customXml\_rels\item1.xml.rels
customXml\itemProps1.xml
word\fontTable.xml
customXml\item1.xml
word\webSettings.xml
word\stylesWithEffects.xml
docProps\core.xml
Download