NGSolve
4.9
|
The graph of a sparse matrix. More...
#include <sparsematrix.hpp>
Public Member Functions | |
MatrixGraph (const Array< int > &elsperrow, int awidth) | |
arbitrary number of els/row | |
MatrixGraph (int as, int max_elsperrow) | |
matrix of height as, uniform number of els/row | |
MatrixGraph (const MatrixGraph &graph, bool stealgraph) | |
shadow matrix graph | |
MatrixGraph (int size, const Table< int > &rowelements, const Table< int > &colelements, bool symmetric) | |
void | Compress () |
eliminate unused columne indices (was never implemented) | |
int | GetPosition (int i, int j) const |
returns position of Element (i, j), exception for unused | |
int | GetPositionTest (int i, int j) const |
returns position of Element (i, j), -1 for unused | |
void | GetPositionsSorted (int row, int n, int *pos) const |
find positions of n sorted elements, overwrite pos, exception for unused | |
int | CreatePosition (int i, int j) |
returns position of new element | |
int | Size () const |
size_t | NZE () const |
FlatArray< int > | GetRowIndices (int i) const |
size_t | First (int i) const |
void | FindSameNZE () |
ostream & | Print (ostream &ost) const |
virtual void | MemoryUsage (Array< MemoryUsageStruct * > &mu) const |
Protected Attributes | |
int | size |
number of rows | |
int | width |
with of matrix | |
size_t | nze |
non-zero elements | |
Array< int, size_t > | colnr |
column numbers | |
Array< size_t, size_t > | firsti |
pointer to first in row | |
Array< int > | same_nze |
row has same non-zero elements as previous row | |
bool | owner |
owner of arrays ? |
The graph of a sparse matrix.