-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmatrix.cpp
More file actions
59 lines (53 loc) · 1.33 KB
/
matrix.cpp
File metadata and controls
59 lines (53 loc) · 1.33 KB
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
#include <iostream>
#include "matrix.h"
Matrix::Matrix() : grid(VECTOR_SIZE,vector<int>(VECTOR_SIZE)),
cMatrix(CVECTOR_SIZE,vector<int>(CVECTOR_SIZE))
{
srand(time(NULL));
for(int i = 0; i < grid.size(); i++)
{
for(int j = 0; j < grid[i].size(); j++)
{
grid[i][j] = rand()%10;
}
}
}
Matrix::~Matrix()
{}
void Matrix::convoluted(Kernel k)
{
for(int i = 1;i < grid.size()-1;i++)
{
for(int j = 1; j < grid.size()-1;j++)
{
int total = 0;
total = (grid[i-1][j-1] * k.rKernel()[0][0]) + (grid[i-1][j] * k.rKernel()[0][1]) + (grid[i-1][j+1] * k.rKernel()[0][2])
+ (grid[i][j-1] * k.rKernel()[1][0]) + (grid[i][j] * k.rKernel()[1][1]) + (grid[i][j+1] * k.rKernel()[1][2])
+ (grid[i+1][j+1] * k.rKernel()[2][0]) + (grid[i+1][j] * k.rKernel()[2][1]) + (grid[i+1][j+1] * k.rKernel()[2][2]);
cMatrix[i-1][j-1] = total;
}
}
}
void Matrix::displayGrid()
{
for(int i = 0;i < grid.size();i++)
{
for(int j = 0; j < grid[i].size();j++)
{
cout << grid[i][j] << " ";
}
cout << endl;
}
}
void Matrix::displayCMatrix()
{
for(int i = 0;i < cMatrix.size();i++)
{
cout << left << setw(5);
for(int j = 0; j < cMatrix[i].size();j++)
{
cout << cMatrix[i][j] << setw(5);
}
cout << endl;
}
}