-
Notifications
You must be signed in to change notification settings - Fork 0
/
Sparse Matrix.c
145 lines (127 loc) · 2.34 KB
/
Sparse Matrix.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
/*
Devise a scheme to represent a sparse matrix A & transpose this representation of A in lexicographic order.
*/
#include <stdio.h>
#include <malloc.h>
int **A,r,c,count=0,**sparse,**trans;
void accept()
{
int i=0,j=0,flag=0;
printf("Enter no. of rows : ");
scanf("%d",&r);
printf("Enter no. of columns : ");
scanf("%d",&c);
//Memory Allocation
A=(int**)malloc(sizeof(int*)*r);
for(i=0;i<r;i++)
A[i]=(int*)malloc(sizeof(int)*c);
//Matrix Input from File
FILE* file = fopen ("matrix.txt", "r");
while (1)
{
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
if(feof(file))
{
flag=1;
break;
}
fscanf (file, "%d", &A[i][j]);
if(A[i][j])
count++;
}
if(flag)
break;
}
if(flag)
break;
}
fclose (file);
//Matrix Input
/*printf("Enter the values row-major wise : \n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
scanf("%d",&A[i][j]);
if(A[i][j])
count++;
}
}*/
//Matrix Output
printf("The Matrix is : \n");
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
printf("%d\t",A[i][j]);
printf("\n");
}
}
void sparse_rep()
{
int i,j,m;
//Memory Allocation
sparse=(int**)malloc(sizeof(int*)*count);
for(i=0;i<count;i++)
sparse[i]=(int*)malloc(sizeof(int)*3);
//Sparse Representation
for(i=0,m=0;i<r;i++)
{
for(j=0;j<c;j++)
{
if(A[i][j])
{
sparse[m][0]=i;
sparse[m][1]=j;
sparse[m][2]=A[i][j];
m++;
}
}
}
//Sparse Representation Output
printf("\nThe Sparse Representation is : \n");
for(i=0;i<count;i++)
{
for(j=0;j<3;j++)
printf("%d\t",sparse[i][j]);
printf("\n");
}
}
void sparse_trans()
{
int i,j,m;
//Memory Allocation
trans=(int**)malloc(sizeof(int*)*count);
for(i=0;i<count;i++)
trans[i]=(int*)malloc(sizeof(int)*3);
for(j=0,m=0;j<c;j++)
{
for(i=0;i<count;i++)
{
//printf("%d *** %d *** %d *** %d\n",i,j,m,A[i][j]);
if(sparse[i][1]==j)
{
trans[m][0]=j;
trans[m][1]=sparse[i][0];
trans[m][2]=sparse[i][2];
m++;
}
}
}
//Sparse Representation Output
printf("\nThe Ordered Sparse Transpose is : \n");
for(i=0;i<count;i++)
{
for(j=0;j<3;j++)
printf("%d\t",trans[i][j]);
printf("\n");
}
}
void main()
{
accept();
sparse_rep();
sparse_trans();
}