-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMatrix.h
More file actions
137 lines (116 loc) · 1.76 KB
/
Copy pathMatrix.h
File metadata and controls
137 lines (116 loc) · 1.76 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
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
#include <cstdio>
class Node
{
///
// Private attributes
private:
int value;
int column;
int row;
Node* next;
Node* down;
///
// Public methods
///
// constructor
public:
Node()
{
value = 0;
column = 0;
row = 0;
}
///
// getters
int getValue()
{
return value;
}
int getColumn()
{
return column;
}
int getRow()
{
return row;
}
Node* getNext()
{
return next;
}
Node* getDown()
{
return down;
}
///
// setters
void setValue(int value)
{
this->value = value;
}
void setColumn(int column)
{
this->column = column;
}
void setRow(int row)
{
this->row = row;
}
void setNext(Node* next)
{
this->next = next;
}
void setDown(Node* down)
{
this->down = down;
}
};
///
// Class Matrix: The Matrix
class Matrix
{
///
// private attributes
private:
Node* head;
int numberOfColumns;
int numberOfRows;
///
// public methods
public:
///
// constructor
Matrix(int columns, int rows)
{
head = new Node();
numberOfRows = columns;
numberOfColumns = rows;
Node* tempNode;
Node* lastInserted = head;
head->setNext(head);
head->setDown(head);
//create the main row
for(int i = 0; i < columns; i++)
{
tempNode = new Node();
tempNode->setColumn(-1);
tempNode->setRow(-1);
tempNode->next = head;
lastInserted->next = tempNode;
lastInserted = tempNode;
}
//create the main column
lastInserted = head;
for(int j = 0; j < rows; j++)
{
tempNode = new Node();
tempNode->down = head;
tempNode->setColumn(-1);
tempNode->setRow(-1);
lastInserted->down = head;
lastInserted = tempNode;
}
}
void insert(int,int,int);
void print();
};