| 
| 
  | SparseMatrix (T defaultValue=T()) | 
|   | Creates empty matrix with a default value for unfilled elements. 
  | 
|   | 
| T  | get (const uint32_t &i, const uint32_t &j) const  | 
|   | It returns a value of the matrix for the specified indices.  More...
  | 
|   | 
| 
void  | addRow (Row &row) | 
|   | Adds precreated row to the matrix. Passed argument is destroyed. 
  | 
|   | 
| 
Row &  | operator[] (const uint32_t &i) | 
|   | It returns i-th row of the matrix. 
  | 
|   | 
| 
const Row &  | operator[] (const uint32_t &i) const  | 
|   | It returns i-th row of the matrix. 
  | 
|   | 
| 
uint64_t  | numberOfRows () const  | 
|   | 
| 
uint64_t  | numberOfColumns () const  | 
|   | 
| 
uint64_t  | numberOfElements () const  | 
|   | Number of non-zero elements of the matrix. 
  | 
|   | 
| 
double  | densityOfMatrix () const  | 
|   | Percentage of filled elements. 
  | 
|   | 
| 
void  | clear () | 
|   | Destroys the matrix. 
  | 
|   | 
template<class T>
class SparseMatrix< T >
Memory efficient storage of the constraint matrix. 
Sparse matrix implementation suitable for the row-by-row consecutive access that is very appropriate for building of Integer Linear Programming problems. A random access by columns is not recommended since it causes huge latencies. 
- Template Parameters
 - 
  
    | T | Mostly either float or double.  | 
  
   
Definition at line 43 of file SparseMatrix.h.