C++ Program to Find Inverse of a Graph Matrix

This C++ program displays the Gauss Jordan method of computing inverse of a matrix. Gauss Jordan method proceeds with row by row reduction of matrix to unit matrix column-wise.

Here is the source code of the C++ program to display the augmented matrix along with the inverse of the matrix taken as input. This C++ program is successfully compiled and run on DevCpp, a C++ compiler. The program output is given below.

```
/*
```

 * C++ Program to Find Inverse of a Graph Matrix

```
 */
```
```
#include<iostream>
```
```
#include<conio.h>
```
```
#include<stdio.h>
```
```
using namespace std;
```
```
int main()
```
```
{
```
```
    int i, j, k, n;
```
```
    float a[10][10] = {0},d;
```
```
    cout<<"Enter the order of matrix ";
```
```
    cin>>n;
```
```
    cout<<"Enter the elements\n";
```
```
    for (i = 1; i <= n; i++)
```
```
    {
```
```
        for (j = 1; j <= n; j++)
```
```
        {
```
```
            cin>>a[i][j];
```
```
        }
```
```
    }    
```
```
    for (i = 1; i <= n; i++)
```
```
    {
```
```
        for (j = 1; j <= 2 * n; j++)
```
```
        {
```
```
            if (j == (i + n))
```
```
            {
```
```
                a[i][j] = 1;
```
```
            }
```
```
        }
```
```
    }
```
```
    for (i = n; i > 1; i--)
```
```
    {
```
```
        if (a[i-1][1] < a[i][1])
```
```
        {
```
```
            for(j = 1; j <= n * 2; j++)
```
```
            {
```
```
                d = a[i][j];
```
```
                a[i][j] = a[i-1][j];
```
```
                a[i-1][j] = d;
```
```
            }
```
```
        }
```
```
    }
```
```
    cout<<"Augmented Matrix: "<<endl;
```
```
    for (i = 1; i <= n; i++)
```
```
    {
```
```
        for (j = 1; j <= n * 2; j++)
```
```
        {
```
```
            cout<<a[i][j]<<"    ";
```
```
        }
```
```
        cout<<endl;
```
```
    }
```
```
    for (i = 1; i <= n; i++)
```
```
    {
```
```
        for (j = 1; j <= n * 2; j++)
```
```
        {
```
```
            if (j != i)
```
```
            {
```
```
                d = a[j][i] / a[i][i];
```

                for (k = 1; k <= n * 2; k++)

```
                {
```

                    a[j][k] = a[j][k] - (a[i][k] * d);

```
                }
```
```
            }
```
```
        }
```
```
    }
```
```
    for (i = 1; i <= n; i++)
```
```
    {
```
```
        d=a[i][i];
```
```
        for (j = 1; j <= n * 2; j++)
```
```
        {
```
```
            a[i][j] = a[i][j] / d;
```
```
        }
```
```
    }
```
```
    cout<<"Inverse Matrix "<<endl;
```
```
    for (i = 1; i <= n; i++)
```
```
    {
```

        for (j = n + 1; j <= n * 2; j++)

```
        {
```
```
            cout<<a[i][j]<<"    ";
```
```
        }
```
```
        cout<<endl;
```
```
    }
```
```
    getch();
```
```
}
```

Output
 
Enter the order of matrix 3
Enter the elements
4
2
7
5
1
8
9
4
7
Augmented Matrix:
9    4    7    0    0    1
4    2    7    1    0    0
5    1    8    0    1    0
Inverse Matrix
-0.490196    0.27451    0.176471
0.72549    -0.686274    0.0588236
0.215686    0.0392157    -0.117647

Sanfoundry Global Education & Learning Series – 1000 C++ Programs.

If you wish to look at all C++ Programming examples, go to C++ Programs.

If you find any mistake above, kindly email to [email protected]

« Prev - C++ Program to Find All Back Edges in a Graph

» Next - C++ Program to Find Transpose of a Graph Matrix

Related Posts:

Recommended Articles: