## 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

**Videos:**

Kruskal’s Algorithm (time: 2:40)

This is a rather foolish introduction to spanning treesĀ (time: 1:39)

… See the whole entry

A historical reference, along with a solution and interesting links for the Konigsberg bridge problem is found at this site:

http://mathforum.org/isaac/problems/bridgesol1.html

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 Krukal’s … See the whole entry

However, as you go through the book be sure you look at all the examples in the text. If you need hints for the Level 3 … See the whole entry

- Trees
- definition
- spanning tree

- Minimum spanning trees
- weight
- weighted graph
- definition
- Kruskal’s algorithm
- number-of-vertices-and-edges-in-a-tree theorem

A **tree** is a graph which is connected and has no circuits. A tree that is created from another … See the whole entry