Scribd
Upload
10 views3 pages

C++ Sparse Matrix Implementation

This C++ program defines a Sparse class to represent sparse matrices using only the nonzero elements. The class contains member variables to store the number of rows and columns of the matrix, the number of nonzero elements, and an array of Element structs containing the row, column, and value of each nonzero element. Member functions are defined to overload operators for input, output, and addition of sparse matrices. The main function tests adding two sample sparse matrices by reading them in, computing their sum, and printing the results.

Uploaded by

Victor Mariano Leite
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views3 pages

C++ Sparse Matrix Implementation

This C++ program defines a Sparse class to represent sparse matrices using only the nonzero elements. The class contains member variables to store the number of rows and columns of the matrix, the number of nonzero elements, and an array of Element structs containing the row, column, and value of each nonzero element. Member functions are defined to overload operators for input, output, and addition of sparse matrices. The main function tests adding two sample sparse matrices by reading them in, computing their sum, and printing the results.

Uploaded by

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

Sparse Matrix using C++

#include <iostream>

using namespace std;

class Element
{
public:
int i;
int j;
int x;
};

class Sparse
{
private:
int m;
int n;
int num;
Element *ele;
public:
Sparse(int m,int n,int num)
{
this->m=m;
this->n=n;
this->num=num;
ele=new Element[this->num];
}
~Sparse()
{
delete [] ele;
}

Sparse operator+(Sparse &s);

friend istream & operator>>(istream &is,Sparse &s);


friend ostream & operator<<(ostream &os,Sparse &s);

};

Sparse Sparse::operator+(Sparse &s)


{
int i,j,k;
if(m!=s.m || n!=s.n)
return Sparse(0,0,0);
Sparse *sum=new Sparse(m,n,num+[Link]);

i=j=k=0;
while(i<num && j<[Link])
{
if(ele[i].i<[Link][j].i)
sum->ele[k++]=ele[i++];
else if(ele[i].i > [Link][j].i)
sum->ele[k++]=[Link][j++];
else
{
if(ele[i].j<[Link][j].j)
sum->ele[k++]=ele[i++];
else if(ele[i].j > [Link][j].j)
sum->ele[k++]=[Link][j++];
else
{
sum->ele[k]=ele[i];
sum->ele[k++].x=ele[i++].x+[Link][j++].x;
}

}
}
for(;i<num;i++)sum->ele[k++]=ele[i];
for(;j<[Link];j++)sum->ele[k++]=[Link][j];
sum->num=k;

return *sum;

istream & operator>>(istream &is,Sparse &s)


{
cout<<"Enter non-zero elements";
for(int i=0;i<[Link];i++)
cin>>[Link][i].i>>[Link][i].j>>[Link][i].x;
return is;
}

ostream & operator<<(ostream &os,Sparse &s)


{
int k=0;
for(int i=0;i<s.m;i++)
{
for(int j=0;j<s.n;j++)
{
if([Link][k].i==i && [Link][k].j==j)
cout<<[Link][k++].x<<" ";
else
cout<<"0 ";
}
cout<<endl;
}
return os;
}

int main()
{
Sparse s1(5,5,5);
Sparse s2(5,5,5);

cin>>s1;
cin>>s2;

Sparse sum=s1+s2;

cout<<"First Matrix"<<endl<<s1;
cout<<"Second MAtrix"<<endl<<s2;
cout<<"Sum Matrix"<<endl<<sum;

return 0;
}

You might also like