Programming Assignment

minimumST

minimumST is an adaptation of Exercise 9.3.5 on page 332. minimumST is a function that should take an n n vector (representing the adjacency matrix of a graph) as input and return the value of the minimum spanning tree of the graph defined by the n n vector.

allPairsSP

allPairsSP is a function that should take an n n vector (representing the adjacency matrix of a graph) and a value i between 1 and n as input and return the n n vector representing the matrix computed after the i th stage of Floyds algorithm. For the purposes of this program, infinity () will be represented as 1.

hornersRule

hornersRule is a function that should take a vector of integers (coefficients of a polynomial) and another integer as input and return the value of polynomial, evaluated at that particular integer.