Maximum spanning forest: Difference between revisions
Jump to navigation
Jump to search
(→Input) |
(→Input) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
== Input == | == Input == | ||
# An [[Basic graph definitions#Directed and undirected graphs|undirected graph]] <math>G = (V,E)</math>, not necessarily connected. | # An [[Basic graph definitions#Directed and undirected graphs|undirected graph]] <math>G = (V,E)</math>, not necessarily connected. | ||
# An edge length <math>l(e) \in \mathbb{R} | # An edge length <math>l(e) \in \mathbb{R}</math> for each edge <math>e \in E</math>. | ||
== Output == | == Output == | ||
| Line 17: | Line 17: | ||
[[Kruskal]] | [[Kruskal]] | ||
Latest revision as of 18:03, 18 September 2015
Input
- An undirected graph [math]\displaystyle{ G = (V,E) }[/math], not necessarily connected.
- An edge length [math]\displaystyle{ l(e) \in \mathbb{R} }[/math] for each edge [math]\displaystyle{ e \in E }[/math].
Output
An undirected forest [math]\displaystyle{ F= (V,E_F) }[/math] such that [math]\displaystyle{ E_F \subseteq E }[/math].
Objective
Maximize: [math]\displaystyle{ \sum{}{}_{e \in E_F}l(e) }[/math].
Complexity
Polynomial.