About Minimal Minnie's Cost

Drexel dragonThe Math ForumDonate to the Math Forum

The Math Forum Problems Library

Minimal Minnie's Cost

_____________________________________
Library Home || Primary || Math Fundamentals || Pre-Algebra ||
Algebra || Geometry || Discrete Math || Trig/Calc
_____________________________________

(membership required) || Become a Member || Learn about Membership
_____________________________________

Author: Ethel Breuche, Dona Coffey
Description: 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.
 
Problem page: /library/go.html?destination=329
Solution page: Problem #329

[Privacy Policy] [Terms of Use]

_____________________________________
Home || The Math Library || Quick Reference || Search || Help
_____________________________________

© 1994-2012 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel University School of Education.The Math Forum is a research and educational enterprise of the Drexel University School of Education.