Provides (minimum) spanning tree algorithms for graphs.

**Namespace:** yWorks.yFiles.Algorithms**Assembly:** yWorks.yFilesSilverlight.Algorithms (in yWorks.yFilesSilverlight.Algorithms.dll) Version: 2.4.0.0

# Syntax

C# |
---|

public class SpanningTrees |

Visual Basic |
---|

Public Class SpanningTrees |

# Remarks

Provides (minimum) spanning tree algorithms for graphs.
A spanning tree of an undirected connected graph is a subset of its edges
that form a tree connecting all edges of the graph.
If the edges of a graph have a cost or a weight associated with
them then it is possible to calculate a minimum spanning tree of that graph,
i.e. a spanning tree whose edges have minimum overall cost of all spanning
trees of that graph.

# Inheritance Hierarchy

System..::..Object

yWorks.yFiles.Algorithms..::..SpanningTrees

yWorks.yFiles.Algorithms..::..SpanningTrees