-
Notifications
You must be signed in to change notification settings - Fork 25
/
graphmatrix.cpp
85 lines (85 loc) · 1.68 KB
/
graphmatrix.cpp
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
/*
* 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();
}