Minimal Minnie's Cost
Library Home || Primary || Math Fundamentals || Pre-Algebra ||
Algebra || Geometry || Discrete Math || Trig/Calc
|Ethel Breuche, Dona Coffey|
|Discrete Math, difficulty level 2. Building a rail line that connects a number of different cities: a problem that involves graph theory, minimal cost spanning trees, and algorithms.|
|Please Note: Use of the following materials requires membership. Please see the Problem of the Week membership page for more information.|
© 1994-2012 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.