Sparse Matrix Compression (Triplet Form)
This program compresses sparse matrix into triplet form.
Problem Statement
Write a Java program to compress a 3x3 sparse matrix into triplet form.
Source Code
| 1 | public class SparseMatrixCompression { |
| 2 | public static void main(String[] args) { |
| 3 | System.out.println("Eduinq Sparse Matrix Compression"); |
| 4 | int[][] A = { |
| 5 | {0,0,3}, |
| 6 | {0,0,0}, |
| 7 | {4,0,0} |
| 8 | }; |
| 9 | System.out.println("Row Col Val"); |
| 10 | for(int i=0;i<3;i++){ |
| 11 | for(int j=0;j<3;j++){ |
| 12 | if(A[i][j]!=0){ |
| 13 | System.out.println(i+" "+j+" "+A[i][j]); |
| 14 | } |
| 15 | } |
| 16 | } |
| 17 | } |
| 18 | } |
Program Output
Eduinq Sparse Matrix Compression Row Col Val 0 2 3 2 0 4
Explanation
Since a sparse matrix has many zeros, the triplet form stores only non-zero values with their row and column indices, reducing memory usage, and nested loops build this compressed representation.