-
Notifications
You must be signed in to change notification settings - Fork 2
/
power_matrix.cpp
88 lines (73 loc) · 2.06 KB
/
power_matrix.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
86
87
88
#include<bits/stdc++.h>
using namespace std;
int main() {
cout << "Enter number of Nodes : ";
int m;
cin >> m;
int matrix[m+1][m+1];
memset(matrix, 0, sizeof(matrix));
cout << "Enter number of edges : ";
int n;
cin >> n;
cout << "Enter edges : \n";
for(int i = 1; i <= n; i++) {
int u, v;
cin >> u >>v;
matrix[u][v] = 1;
// matrix[v][u] = 1;
}
cout << "Adjacency matrix : \n";
for(int i = 1; i <= m; i++) {
for(int j = 1; j <= m; j++) {
cout << matrix[i][j] << " ";
}
cout << endl;
}
// adjacents of v1, v2, v3 ... vm
for(int i = 1; i <= m; i++) {
cout << "Adjacent of node " << i << " : ";
for(int j = 1; j <= m; j++) {
if(matrix[i][j]) cout << j << " ";
}
cout << endl;
}
int powMatrix[m+1][m+1][m+1];
for(int i = 1; i <= m; i++) {
for(int j = 0; j <= m; j++) powMatrix[1][i][j] = matrix[i][j];
}
for(int i = 2; i <= m; i++) {
for(int j = 1; j <= m; j++) {
for(int k = 1; k <= m; k++) {
int temp = 0;
for(int l = 1; l <= m; l++) {
temp += powMatrix[i-1][j][l]*matrix[l][k];
}
powMatrix[i][j][k] = temp;
}
}
}
for(int i = 2; i <= m; i++) {
cout << "paths of length " << i << " : \n";
int cnt = 0;
for(int j = 1; j <= m; j++) {
for(int k = 1; k <= m; k++) {
if(powMatrix[i][j][k]) {
cout << "From node " << j << " to " << k << endl;
cnt++;
}
}
}
cout << "\ntotal number of path " << i << " is : " << cnt << endl;
}
cout << endl << endl;
for(int i = 1; i <= m; i++) {
for(int j = 1; j <= m; j++) {
for(int k = 1; k <= m; k++) {
cout << powMatrix[i][j][k] << " ";
}
cout << endl;
}
cout << endl << endl;
}
return 0;
}