Scribd
Upload
92 views

Sparse Matrix

This C program defines a sparse matrix data structure and functions to read in a sparse matrix, calculate its transpose, and output both matrices. It takes the number of rows and columns as input, reads in non-zero elements and their indices, stores them in a sparse format, calculates the transpose by changing row and column indices, and prints out both the original and transposed matrices.

Uploaded by

Preeti Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
92 views

Sparse Matrix

This C program defines a sparse matrix data structure and functions to read in a sparse matrix, calculate its transpose, and output both matrices. It takes the number of rows and columns as input, reads in non-zero elements and their indices, stores them in a sparse format, calculates the transpose by changing row and column indices, and prints out both the original and transposed matrices.

Uploaded by

Preeti Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

#include<stdio.

h>

#include<stdlib.h>

#define MAX 100

typedef struct

int row;

int col;

int val;

}sparse;

void readsparse(sparse a[], int m, int n)

int i, j, k, item, p;

a[0].row = m;

a[0].col = n;

k = 1;

printf("\nEnter the elements:\n");

for(i=0; i<m; i++)

for(j=0; j<n; j++)

scanf("%d",&item);

if(item == 0)

continue;

a[k].row = i;

a[k].col = j;

a[k].val = item;

k++;
}

a[0].val = k-1;

printf("\nThe entered sparse matrix is:\n");

printf("\nRow\tColumn\tValue\n");

for(p=0; p<=a[0].val; p++)

printf("%d\t", a[p].row);

printf("%d\t", a[p].col);

printf("%d\n", a[p].val);

void fast_transpose(sparse a[], sparse b[])

int row_terms[100], start_pos[100];

int i, j, p;

int numTerms = a[0].val;

int numCols = a[0].col;

b[0].row = numCols;

b[0].col = a[0].row;

b[0].val = numTerms;

if(numTerms>0)

for(i =0; i<numCols; i++)

row_terms[i] = 0;

for(i=1; i<=numTerms; i++)


row_terms[a[i].col]++;

start_pos[0]=1;

for(i=1; i<numCols; i++)

start_pos[i] = start_pos[i-1] + row_terms[i-1];

for(i=1; i<=numTerms; i++)

j = start_pos[a[i].col]++;

b[j].row = a[i].col;

b[j].col = a[i].row;

b[j].val = a[i].val;

printf("\nThe Fast Transpose sparse matrix is:\n");

printf("\nRow\tColumn\tValue\n");

for(p=0; p<=a[0].val; p++)

printf("%d\t", b[p].row);

printf("%d\t", b[p].col);

printf("%d\n", b[p].val);

void main()

int m, n, key;

sparse a[MAX], b[MAX];

printf("\nEnter the no of rows and columns:\t");

scanf("%d%d",&m, &n);
readsparse(a, m, n);

fast_transpose(a, b);

/*

Enter the no of rows and columns: 44

Enter the elements:

1234

0780

0046

2506

The entered sparse matrix is:

Row Column Value

4 4 11

0 0 1

0 1 2

0 2 3

0 3 4

1 1 7

1 2 8

2 2 4

2 3 6

3 0 2

3 1 5

3 3 6

The Fast Transpose sparse matrix is:


Row Column Value

4 4 11

0 0 1

0 3 2

1 0 2

1 1 7

1 3 5

2 0 3

2 1 8

2 2 4

3 0 4

3 2 6

3 3 6

/*

You might also like