MinimumSpanningTree

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. >>

MinimumSpanningTree[g]
uses Kruskal's algorithm to find a minimum spanning tree of graph g.

更多信息更多信息

范例范例打开所有单元关闭所有单元

基本范例  (2)基本范例  (2)

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Out[3]=
In[4]:=
Click for copyable input
In[5]:=
Click for copyable input
Out[5]=

MinimumSpanningTree has been superseded by FindSpanningTree:

In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input