Video Links 9-2
Videos:
Kruskal’s Algorithm (time: 2:40)
This is a rather foolish introduction to spanning trees (time: 1:39)
… See the whole entry
Kruskal’s algorithm
Reference Topics 9-2
A historical reference, along with a solution and interesting links for the Konigsberg bridge problem is found at this site: https:
https://www.scientificamerican.com/article/how-the-seven-bridges-of-koenigsberg-spawned-new-math/
This site provides a nice discussion of minimum spanning trees.
http://www.people.vcu.edu/~gasmerom/MAT131/mst.html
This is a nice interactive demonstration of … See the whole entry
Homework Hints 9-2
Problems 1-4
There questions are basically definitions and procedures. Read the book and then paraphrase each in your own words.
Problems 5-12
Review the definition of a tree and see Examples 1 and 2.
Problems 13-20
Review the definition of … See the whole entry
Section 9.2: Trees and Minimum Spanning Trees
9.2 Outline
- Trees
- definition
- spanning tree
- Minimum spanning trees
- weight
- weighted graph
- definition
- Kruskal’s algorithm
- number-of-vertices-and-edges-in-a-tree theorem
9.2 Essential Ideas
A tree is a graph which is connected and has no circuits. A tree that is created from another … See the whole entry