lin 0912 h the matrix class ifndef MATRIX H define MATRIX H include include include include include A generic 2 dimensional array class author Jon Beck version 8 September 2017 template class Matrix public Constructor, specifying number of both rows and columns param rows the number of rows param cols the number of columns Matrix( uint16 t rows, uint16 t cols ) Access to an element to allow modification param row the row index param col the column index return reference to the element at that position Object at( uint16 t row, uint16 t col ) Constant access to an element param row the row index param col the column index return constant reference to the element at that position const Object at( uint16 t row, uint16 t col ) const Destructor to free allocated memory Matrix() Copy constructor to make 1 1 copy of existing matrix param m the existing matrix to be copied Matrix( const Matrix m ) Copy constructor Disallow the rvalue copy constructor Matrix( const Matrix m ) delete Assignment operator to make 1 1 copy of existing matrix param m the existing matrix to be copied Matrix operator ( const Matrix m ) Assignment operator Disallow the rvalue assignment operator Matrix operator ( const Matrix m ) delete Accessor to determine how many rows are in the matrix return the number of rows in the matrix uint16 t numrows() const Accessor to determine how many columns are in the matrix return the number of columns in the matrix uint16 t numcols() const private uint16 t rows uint16 t cols Object data template Matrix Matrix( uint16 t rows, uint16 t cols ) rows( rows ), cols( cols ) data new Object rows cols template Matrix Matrix() delete data template Object Matrix at( uint16 t row, uint16 t col ) assert( row rows col cols ) return data cols row col template const Object Matrix at( uint16 t row, uint16 t col ) const assert( row rows col cols ) return data cols row col template uint16 t Matrix numrows() const return rows template uint16 t Matrix numcols() const return cols bool is connected(Matrix graph) vector bool reached(graph size(),false) queue uint8 t to be explored to be explored push(0) while( to be explored empty()) uint8 t current node to be explored front() to be explored pop() reached at(current node) true for(uint8 t adjacent 0 adjacent

The Answer is in the image, click to view ...

Question: lin_0912.h: the matrix class #ifndef MATRIX_H #define MATRIX_H #include #include #include #include #include /** * A generic 2-dimensional array class * @author Jon Beck *

 lin_0912.h: the matrix class

 #ifndef MATRIX_H #define MATRIX_H #include  #include  #include  #include  #include  /** * A generic 2-dimensional array class * @author Jon Beck * @version 8 September 2017 */ template  class Matrix { public: /** * Constructor, specifying number of both rows and columns * @param rows the number of rows * @param cols the number of columns */ Matrix( uint16_t rows, uint16_t cols ); /** * Access to an element to allow modification * @param row the row index * @param col the column index * @return reference to the element at that position */ Object & at( uint16_t row, uint16_t col ); /** * Constant access to an element * @param row the row index * @param col the column index * @return constant reference to the element at that position */ const Object & at( uint16_t row, uint16_t col ) const; /** * Destructor to free allocated memory */ ~Matrix(); /** * Copy constructor to make 1-1 copy of existing matrix * @param m the existing matrix to be copied */ Matrix( const Matrix

Question: lin_0912.h: the matrix class #ifndef MATRIX_H #define MATRIX_H #include #include #include #include #include /** * A generic 2-dimensional array class * @author Jon Beck *

Step by Step Solution

Students Have Also Explored These Related Databases Questions!