(Using the adjacency matrix of a graph) int minimumST(vector > adjacencyMatrix) parameter only have the adjacencyMatrix. Code in C++. Thanks!!!

minimumST minimumST is an adaptation of Exercise 9.3.5 on page 332. minimumST is a function that should take an n x 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 x n vector. For the purposes of this program, infinity (oo) will be represented as -1. minimumST minimumST is an adaptation of Exercise 9.3.5 on page 332. minimumST is a function that should take an n x 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 x n vector. For the purposes of this program, infinity (oo) will be represented as -1