In this lesson, you'll learn what the minimal connector problem is and a greedy algorithm for solving it. You'll also learn why the algorithm produces a tree having the smallest possible weight. This tree is not necessarily unique. In addition, you'll learn how solving the minimal connector problem can give you a lower bound for the travelling salesman problem. This can be used to prove that no Hamiltonian cycle exists less than some cost, where that cost is the solution to the minimal connector problem.
