6. Finding Minimum Spanning Trees

Placeholder only for a chapter. Not yet written.

6.1. The problem at Muddy City

A graph blah blah

6.2. What is a Minimum Spanning Tree (MSP)?

6.3. Prim’s algorithm for finding an MSP

6.4. Kruskal’s algorithm for finding an MSP

6.5. Other uses for MSPs

6.6. Glossary

delimiter

A sequence of one or more characters used to specify the boundary between separate parts of text.

6.7. Exercises

1. Write a program that reads a file and writes out a new file with the lines in reversed order (i.e. the first line in the old file becomes the last one in the new file.)