# Maximum spanning forest

## Input

1. An undirected graph $G = (V,E)$, not necessarily connected.
2. An edge length $l(e) \in \mathbb{R}$ for each edge $e \in E$.

## Output

An undirected forest $F= (V,E_F)$ such that $E_F \subseteq E$.

## Objective

Maximize: $\sum{}{}_{e \in E_F}l(e)$.

Polynomial.