#ifndef PART01_H #define PART01_H #include using namespace std;

double maximumST( vector > );

#endif

#include "part01.h" #include #include #include #include #include #include #include

using namespace std;

int main( int argc , char* argv[] ){ ifstream matrixFile( argv[1] ); istream_iterator mStart(matrixFile),mEnd; vector matrixArray(mStart,mEnd);

int dimensions = (int)(sqrt( matrixArray.size() )); vector row(dimensions,0); vector > matrix(dimensions,row);

for( int i = 0; i

try{ cout

#include "part01.h" #include

using namespace std;

double maximumST( vector > graph ){ return -1.0; }

maximumST is an adaptation of Exercise 9.3.5 on page 332. maximumST 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 maximum spanning tree of the graph defined by the n n vector.

#include #include "parto! .h" using namespace std; int main( int argc, char* argv] ifstream matrixFileargv]; istream iterator mStart (matrixFile) ,mEnd; vector matrixArray (mStart,mEnd); int dimensions -(int) (sqrt( matrixArray.size ()); vector row (dimensions,0); vector > matrix (dimensions, row) for( inti-0; i