In this video we introduce Kruskal's algorithm for finding minimal spanning trees, and the Tree Shortcut Algorithm for solving the traveling salesperson problem for graphs that satisfy the triangle inequality.
This is part of the Open Educational Resources materials called
Counting Rocks! An Introduction to Combinatorics at CSU.
License: Creative Commons CC-BY
