A Spanning tree of an undirected graph, G is a tree formed from graph edges that connects all vertices of G.

__MINIMUM
SPANNING TREES:__

Â·
A **Spanning
tree** of an undirected graph, G is a tree formed from graph edges that
connects all vertices of G.

Â·
A **Minimum
Spanning tree** of an undirected graph, G is a tree formed from graph edges
that connects all vertices of G at lowest cost.

Â·
A minimum spanning tree exists if and only if G is
connected. The number of edges in the minimum spanning tree is |V| -1.

Â·
The minimum spanning **tree** is a tree because it is acyclic, it is **spanning** because it covers every vertex, and it is **minimum** because it covers with minimum
cost.

Â·
The minimum spanning tree can be created using two
algorithms, that is **primâ€™s ****algorithm **and** kruskalâ€™s algorithm.**

Study Material, Lecturing Notes, Assignment, Reference, Wiki description explanation, brief detail

Programming and Data structures : Graphs : Minimum Spanning Trees |

**Related Topics **

Privacy Policy, Terms and Conditions, DMCA Policy and Compliant

Copyright Â© 2018-2024 BrainKart.com; All Rights Reserved. Developed by Therithal info, Chennai.