# Minimum Connector Problem

## Problem

Given a weighted graph $G$, the object is to find a minimum spanning tree for $G$.

## Solution

There are two methods of solving this problem:

proved as:

## Also see

The Maximum Connector Problem is effectively the same problem taken from a different direction.