-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathGraphl.cpp
More file actions
129 lines (118 loc) · 2.37 KB
/
Graphl.cpp
File metadata and controls
129 lines (118 loc) · 2.37 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
//Edge class for Adjacency List graph representation
class Edge
{
int vert, wt;
public:
Edge() {vert = -1; wt = 1;}
Edge(int v, int w) {vert = v; wt = w;}
int vertex() {return vert;}
int weight() {return wt;}
};
class Graphl : public Graph
{
private:
List<Edge>** vertex;
int numVertex, numEdge;
int *mark;
public:
Graphl(int numVert)
{Init(numVert);}
~Graphl()
{
delete [] mark;
for (int i=0; i< numVertex; i++) delete [] vertex[i];
delete [] vertex;
}
void Init(int n)
{
int i;
numVertex = n;
numEdge = 0;
mark = new int[n];
for (i=0; i<numVertex; i++) mark[i] = UNVISITED;
//create and initialize adjacency lists
vertex = (List<Edge>**) new List<Edge>*[numVertex];
for (i=0; i<numVertex; i++)
vertex[i] = new LList<Edge>();
}
int n() {return numVertex;}
int e() {return numEdge;}
int first(int v)
{
if (vertex[v]->length() == 0)
return numVertex;
vertex[v]->moveToStart();
Edge it = vertex[v]->getValue();
return it.vertex();
}
//get v's next neighbor after w
int next(int v, int w)
{
Edge it;
if (isEdge(v,w))
{
if ((vertex[v]->currPos()+1) < vertex[v]->length())
{
vertex[v]->next();
it = vertex[v]->getValue();
return it.vertex();
}
}
return n();
}
//set edge (i,j) to "weight"
void setEdge(int i, int j, int weight)
{
Assert(weight>0, "May not set weight to 0");
Edge currEdge(j,weight);
if (isEdge(i,j))
{
vertex[i]->remove();
vertex[i]->insert(currEdge);
}
else
{
numEdge++;
for (vertex[i]->moveToStart();
vertex[i]->currPos() < vertex[i]->length();
vertex[i]->next())
{
Edge temp = vertex[i]->getValue();
if (temp.vertex() > j) break;
}
vertex[i]->insert(currEdge);
}
}
void delEdge(int i, int j)
{
if (isEdge(i,j))
{
vertex[i]->remove();
numEdge--;
}
}
bool isEdge(int i, int j)
{
Edge it;
for (vertex[i]->moveToStart();
vertex[i]->currPos() < vertex[i]->length();
vertex[i]->next())
{
Edge temp = vertex[i]->getValue();
if (temp.vertex() == j) return true;
}
return false;
}
int weight(int i,int j)
{
Edge curr;
if (isEdge(i,j))
{
curr = vertex[i]->getValue();
return curr.weight();
}
else return 0;
}
int getMark(int v) {return mark[v];}
void setMark(int v, int val) {mark[v] = val;}
};