minspantree
Minimum spanning tree of graph
Description
returns the minimum spanning tree,
T
= minspantree(G
)T
, for graph G
.
uses additional options specified by one or more Name-Value pair arguments. For
example, T
= minspantree(G
,Name,Value
)minspantree(G,'Method','sparse')
uses Kruskal’s
algorithm for calculating the minimum spanning tree.
Examples
Input Arguments
Name-Value Arguments
Output Arguments
More About
Extended Capabilities
Version History
Introduced in R2015b