-
Notifications
You must be signed in to change notification settings - Fork 21
/
Copy path12_AdjacencyMatrix.py
158 lines (126 loc) · 2.63 KB
/
12_AdjacencyMatrix.py
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
146
147
148
149
150
151
152
153
154
155
156
157
158
"""
12_Adjacency matrix
Given the following program, what will be the 4th number that’d get printed in the output sequence for the given input?
#include <bits/stdc++.h>
using namespace std;
int cur=0;
int matrix[12][12];
bool visited[12];
deque <int> queue;
void function(int n);
int main()
{
int num=0;
int n;
cin>>n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>matrix[i][j];
for(int i=0;i<n;i++)
visited[i]=false;
function(n);
return 0;
}
void function(int n)
{
cout<<cur<<" ";
visited[cur]=true;
queue.push_back(cur);
do
{
for(int j=0;j<n;j++)
{
if(matrix[cur][j]==1 && !visited[j])
{
queue.push_back(j);
cout<<j<<" ";
visited[j]=true;
}
}
queue.pop_front();
if(!queue.empty())
cur=queue.front();
}while(!queue.empty());
}
Input Sequence -
11
0 0 0 1 0 0 0 0 0
0 1 0 0 0 0 0 0 1
0 0 1 1 1 0 0 0 1
0 0 1 0 0 0 0 0 0
0 0 1 0 0 0 0 1 0
0 1 1 0 0 0 1 0 1
0 0 0 1 0 0 0 1 0
1 0 0 0 1 0 1 0 0
1 0 1 0 0 0 1 0 0
0 1 0 0 1 0 1 0 1
0 0 0 0 1 0 0 0 0
Pick one of the choices
2
6
8
5
None of the above
Adjacency matrix
Given the following program, what will be the 4th number that’d get printed in the output sequence for the given input?
#include <bits/stdc++.h>
using namespace std;
int cur=0;
int matrix[12][12];
bool visited[12];
deque <int> queue;
void function(int n);
int main()
{
int num=0;
int n;
cin>>n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>matrix[i][j];
for(int i=0;i<n;i++)
visited[i]=false;
function(n);
return 0;
}
void function(int n)
{
cout<<cur<<" ";
visited[cur]=true;
queue.push_back(cur);
do
{
for(int j=0;j<n;j++)
{
if(matrix[cur][j]==1 && !visited[j])
{
queue.push_back(j);
cout<<j<<" ";
visited[j]=true;
}
}
queue.pop_front();
if(!queue.empty())
cur=queue.front();
}while(!queue.empty());
}
Input Sequence -
11
0 0 0 1 0 0 0 0 0
0 1 0 0 0 0 0 0 1
0 0 1 1 1 0 0 0 1
0 0 1 0 0 0 0 0 0
0 0 1 0 0 0 0 1 0
0 1 1 0 0 0 1 0 1
0 0 0 1 0 0 0 1 0
1 0 0 0 1 0 1 0 0
1 0 1 0 0 0 1 0 0
0 1 0 0 1 0 1 0 1
0 0 0 0 1 0 0 0 0
Pick one of the choices
2
6
8
5
None of the above
"""