**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. | |

/library/go.html?destination=329 | |

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.