7import static org.junit.Assert.*;
14 assertSame(m.
nnz(),0);
28 assertSame(m.
get(2,2),2);
29 assertSame(m.
get(9,9),9);
30 assertSame(m.
nnz(),2);
33 assertSame(m.
get(2,2),3);
34 assertSame(m.
nnz(),2);
37 assertSame(m.
get(2,2),
null);
38 assertSame(m.
nnz(),1);
43 assertSame(m.
get(4,2),-1);
44 assertSame(m.
get(2,4),
null);
49 assertSame(ri.length,2);
53 assertEquals(v.
at(0),Integer.valueOf(2));
54 assertEquals(v.
at(1),Integer.valueOf(-1));
59 public static void main(String args[]) {
60 org.junit.runner.JUnitCore.main(
"aud.test.SparseMatrixCSTest");
Implementation of an array-based vector.
T at(int i)
get i-th entry [O(1)]
Simple sparse matrix data structure.
int getMinColumnIndex()
get minimum row index [O(1)]
int getNumRows()
computes from maximium row index [O(nnz)]
int[] getColumnRowIndices(int j)
get row indices in column j as array
T get(int i, int j)
get entry (i,j) [O(log(nnz))]
int getMinRowIndex()
get minimum row index [O(nnz)]
int columnDegree(int j)
get number of nonzero entries in column j
int getNumColumns()
computed from maximum column index [O(1)]
SparseMatrixCS< Integer > spones()
Get nonzero pattern.
T set(int i, int j, T data)
Set entry (i,j) to data [O(log(nnz))].
Vector< T > getColumnEntries(int j)
get entries in column j as array
int nnz()
get number of nonzero entries
static void main(String args[])
sparse matrices for encoding adjacency
Graph data structures and algorithms.
AuD lecture: Data structures, algorithms, examples.