The Minimum Spanning Tree Problem: Difference between revisions
Jump to navigation
Jump to search
| Line 4: | Line 4: | ||
* [[Kruskal%27s_Algorithm|Kruskal's Algorithm]] | * [[Kruskal%27s_Algorithm|Kruskal's Algorithm]] | ||
= | =The Problem= | ||
Given an [[Graph_Concepts#Undirected_Graph|undirected]] graph G=(V, E) | |||