I would appreciate any hint on how to generate a sparse matrix in Accord.NET or in C#, without creating a library from scratch. The problem is that I want to make a matrix of size 30k by 30k representing the adjacency matrix of a graph, which will be almost always sparse. Past 15000 rows or columns, the following code generates an error:
var A = new double[n, n];
error: Array dimensions exceeded supported range.
ps. I am aware of the Sparse Class but as can be seen from the description, this class can only be used to make sparse vectors, not matrices.
If it is possible to make a sparse matrix, then the next immediate question is can it be treated like a normal matrix in Linear Algebraic operations, e.g. in subtracting two matrices, or finding a sub-matrix using:
Accord.Math.Matrix.Get(A, IVI, BVI, B);