Repository navigation
Expand file tree
/
Copy pathStack.c
More file actions
117 lines (91 loc) · 2.22 KB
/
Copy pathStack.c
File metadata and controls
117 lines (91 loc) · 2.22 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
/**
* this class indluces all stack structures and get methods
*/
#ifndef STACK_C
#define STACK_C
#include <stdlib.h>
#include <assert.h>
#include <stdio.h>
#include "Stack.h"
struct StackCells {
int row;
int column;
struct StackCells *prev;
struct StackCells *next;
};
struct Stacks {
int StackSize;
int isEmpty;
struct StackCells *StackHead;
};
#endif
Stack *newStack;
StackCell *newCell;
Stack *createNewStack() {
newStack = (Stack *) malloc(sizeof(Stack));
assert(newStack);
newStack->isEmpty = 1;
newStack->StackHead = NULL;
newStack->StackSize = 0;
return newStack;
}
StackCell *newCell;
StackCell *createNewCell(int row, int column, StackCell *prev) {
newCell = (StackCell *) malloc(sizeof(StackCell));
assert(newCell);
newCell->row = row;
newCell->column = column;
newCell->prev = prev;
return newCell;
}
int isEmpty(Stack *stack) {
return stack->isEmpty;
}
StackCell *pop(Stack *stack) {
if (isEmpty(stack) || stack->StackSize == 0) {
stack->isEmpty = 1;
return NULL;
} else {
stack->StackSize -= 1;
stack->StackHead = stack->StackHead->prev;
if (stack->StackHead == NULL){
stack->isEmpty = 1;
} else {
deleteStackCell(stack->StackHead->next);
}
return stack->StackHead;
}
}
void push(Stack *stack, int row, int column) {
StackCell *newCell = createNewCell(row, column, stack->StackHead);
if (stack->StackHead != NULL) {
stack->StackHead->next = newCell;
stack->StackHead = newCell;
stack->StackSize += 1;
} else {
stack->StackHead = newCell;
stack->StackSize = 1;
}
stack->isEmpty = 0;
}
void DeleteStack(Stack *stack) {
while (stack->isEmpty == 0) {
stack->StackHead = stack->StackHead->prev;
free(stack->StackHead->next);
stack->StackHead->next = NULL;
stack->StackSize--;
}
free(stack);
}
void deleteStackCell(StackCell * stackCell){
stackCell->prev = NULL;
stackCell->next = NULL;
free(stackCell);
stackCell = NULL;
}
int getColumn(StackCell *cell) {
return cell->column;
}
int getRow(StackCell *cell) {
return cell->row;
}