Minimum Spanning Tree

From Wiki :-)
Revision as of 05:25, 11 June 2018 by Savoundg (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

A Graph is a set of nodes (or vertices) connected by directed or undirected edges.

The Minimum Spanning Tree is the subset of a edges that connects all nodes with the minimum edge-weight.

Resources

https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)
https://en.wikipedia.org/wiki/Minimum_spanning_tree
Retrieved from "https://wiki.georges.savound.com/index.php?title=Minimum_Spanning_Tree&oldid=737"