I think this can help
http://en.wikipedia.org/wiki/Sparse_matrix#Storing_a_sparse_matrix
On 28 July 2011 00:45, aditi garg aditi.garg.6...@gmail.com wrote:
can u plz elaborate...
On Thu, Jul 28, 2011 at 12:04 AM, rajeev bharshetty
rajeevr...@gmail.comwrote:
To store sparse matrix
How wud u store a sparse matrix( whch has elemensts only below or abv
the diagonal) in memory...what data structure u wud use and y?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
To store sparse matrix adjacency lists should be used rather than adjacency
matrix ...
On Thu, Jul 28, 2011 at 12:03 AM, aditi garg aditi.garg.6...@gmail.comwrote:
How wud u store a sparse matrix( whch has elemensts only below or abv
the diagonal) in memory...what data structure u wud use and
can u plz elaborate...
On Thu, Jul 28, 2011 at 12:04 AM, rajeev bharshetty rajeevr...@gmail.comwrote:
To store sparse matrix adjacency lists should be used rather than adjacency
matrix ...
On Thu, Jul 28, 2011 at 12:03 AM, aditi garg aditi.garg.6...@gmail.comwrote:
How wud u store a
http://www.eecs.harvard.edu/~ellard/Q-97/HTML/root/node20.html
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
A nxn matrix is sparse if the number of non-zero entries in the matrix
is much less than n^2. Multiply 2 nxn matrices containing L1, L2, non-
zero entries is O(L1L2).
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
hi
i have problem in sparse matrix i have done it with link list but how
can i do isertion in sparse matrix using array of pointer
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
