construct an adjacency matrix from a given graph or digraph and use the matrix to solve associated problems
identify practical examples that can be represented by trees and spanning trees
identify a minimum spanning tree in a weighted connected graph, either by inspection or by using Prim’s algorithm
use minimal spanning trees to solve minimal connector problems
