1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
where "*" means you can store any value from 1 to 6 in that position
in the array.
2. Compressed‐Diagonal Storage Mode
The storage mode used for square sparse matrices stored in
compressed‐diagonal storage mode has two variations, depending
on whether the matrix is a general sparse matrix or a symmetric
sparse matrix. This explains both of these variations; however, the
conventions used for numbering the diagonals in the matrix, which
apply to the storage descriptions, are explained first.
Matrix A of order n has 2n‐1 diagonals. Because k = j‐i is constant
for the elements aij along each diagonal, each diagonal can be
assigned a diagonal number, k, having a value from 1‐n to n‐1. Then
the diagonals can be referred to as dk, where k = 1‐n, n‐1.
The following matrix shows the starting position of each diagonal,
dk:
For a general (square) sparse matrix A, compressed‐diagonal
storage mode uses two arrays to define the sparse matrix storage,
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 128 ‐