Minimum Spanning Tree: Difference between revisions
Jump to navigation
Jump to search
Created page with "A Graph is a set of nodes (or vertices) connected by directed or undirected edges. The Minimum Spanning Tree is the subset of a Graph that connects all nodes with the minimum..." |
No edit summary |
||
| Line 1: | Line 1: | ||
A Graph is a set of nodes (or vertices) connected by directed or undirected edges. | A Graph is a set of nodes (or vertices) connected by directed or undirected edges. | ||
The Minimum Spanning Tree is the subset of a | The Minimum Spanning Tree is the subset of a edges that connects all nodes with the minimum edge-weight. | ||
== Resources == | == Resources == | ||
Revision as of 05:23, 11 June 2018
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 |
| https://www.youtube.com/watch?v=5xosHRdxqHA |