Matrice rara | IT&C Solutions

How to: Implement a Sparse Matrix Data Structure in C++ Using Simple Linked List

November 2, 2009 by Marius

The storage structures for sparse matrixes are presented at […].The simply linked list is a linear data structure, formed by elements called nodes. A node is composed by two categories of fields: The field with the information necessary for processing; The field with the information for connecting with the successor node in the simply linked […]

How to: Implement Sparse Matrix Data Structure in C++ Using Array

November 2, 2009 by Marius

2 Comments

The sparse matrix represents a special type of two-dimensional array consisting of a large number of elements from out of which a very high proportion is occupied by null elements. Thus, the classical declaration of a two-dimensional array in the C++ programming language leads to unnecessary use of memory by storing null values and of […]