-
Notifications
You must be signed in to change notification settings - Fork 7
/
DirectedAdjacencyList.php
243 lines (209 loc) · 6.51 KB
/
DirectedAdjacencyList.php
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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
<?php
namespace Gliph\Graph;
use Gliph\Algorithm\ConnectedComponent;
use Gliph\Exception\NonexistentVertexException;
use Gliph\Exception\RuntimeException;
use Gliph\Traversal\DepthFirst;
use Gliph\Visitor\DepthFirstToposortVisitor;
class DirectedAdjacencyList implements MutableDigraph {
use AdjacencyList;
/**
* {@inheritdoc}
*/
public function adjacentTo($vertex) {
if (!$this->hasVertex($vertex)) {
throw new NonexistentVertexException('Vertex is not in graph; cannot iterate over its adjacent vertices.');
}
$set = $this->getTraversableSplos($this->vertices[$vertex]);
foreach ($set as $adjacent_vertex) {
yield $adjacent_vertex;
}
$this->walking->detach($this->vertices);
// Search inbound arcs
$set = $this->getTraversableSplos($this->vertices);
foreach ($set as $v) {
if ($this->vertices[$v]->contains($vertex)) {
yield $v;
}
}
$this->walking->detach($set);
}
/**
* {@inheritdoc}
*/
public function successorsOf($vertex) {
if (!$this->hasVertex($vertex)) {
throw new NonexistentVertexException('Vertex is not in graph; cannot iterate over its successor vertices.');
}
$set = $this->getTraversableSplos($this->vertices[$vertex]);
foreach ($set as $successor) {
yield $successor;
}
$this->walking->detach($set);
}
/**
* {@inheritdoc}
*/
public function predecessorsOf($vertex) {
if (!$this->hasVertex($vertex)) {
throw new NonexistentVertexException('Vertex is not in graph; cannot iterate over its predecessor vertices.');
}
$set = $this->getTraversableSplos($this->vertices);
foreach ($set as $v) {
if ($this->vertices[$v]->contains($vertex)) {
yield $v;
}
}
$this->walking->detach($set);
}
/**
* {@inheritdoc}
*/
public function incidentTo($vertex) {
if (!$this->hasVertex($vertex)) {
throw new NonexistentVertexException('Vertex is not in graph; cannot iterate over its incident edges.');
}
$set = $this->getTraversableSplos($this->vertices[$vertex]);
foreach ($set as $adjacent_vertex) {
yield array($vertex, $adjacent_vertex);
}
$this->walking->detach($set);
$set = $this->getTraversableSplos($this->vertices);
foreach ($set as $v) {
if ($this->vertices[$v]->contains($vertex)) {
yield array($v, $vertex);
}
}
$this->walking->detach($set);
}
/**
* {@inheritdoc}
*/
public function arcsFrom($vertex) {
if (!$this->hasVertex($vertex)) {
throw new NonexistentVertexException('Vertex is not in graph; cannot iterate over its successor vertices.');
}
$set = $this->getTraversableSplos($this->vertices[$vertex]);
foreach ($set as $successor) {
yield array($vertex, $successor);
}
$this->walking->detach($set);
}
/**
* {@inheritdoc}
*/
public function arcsTo($vertex) {
if (!$this->hasVertex($vertex)) {
throw new NonexistentVertexException('Vertex is not in graph; cannot iterate over its predecessor vertices.');
}
$set = $this->getTraversableSplos($this->vertices);
foreach ($set as $v) {
if ($this->vertices[$v]->contains($vertex)) {
yield array($v, $vertex);
}
}
$this->walking->detach($set);
}
/**
* {@inheritdoc}
*/
public function ensureArc($tail, $head) {
$this->ensureVertex($tail)->ensureVertex($head);
if (!$this->vertices[$tail]->contains($head)) {
$this->size++;
}
$this->vertices[$tail]->attach($head);
}
/**
* {@inheritdoc}
*/
public function removeVertex($vertex) {
if (!$this->hasVertex($vertex)) {
throw new NonexistentVertexException('Vertex is not in the graph, it cannot be removed.', E_WARNING);
}
foreach ($this->vertices() as $v) {
$this->vertices[$v]->detach($vertex);
}
unset($this->vertices[$vertex]);
}
/**
* {@inheritdoc}
*/
public function removeArc($tail, $head) {
$this->vertices[$tail]->detach($head);
}
/**
* {@inheritdoc}
*/
public function edges() {
$oset = $this->getTraversableSplos($this->vertices);
foreach ($oset as $tail) {
$set = $this->getTraversableSplos($this->vertices[$tail]);
foreach ($set as $head) {
yield array($tail, $head);
}
$this->walking->detach($set);
}
$this->walking->detach($oset);
}
/**
* {@inheritdoc}
*/
public function transpose() {
$graph = new self();
foreach ($this->edges() as $edge) {
$graph->ensureArc($edge[1], $edge[0]);
}
return $graph;
}
/**
* {@inheritdoc}
*/
public function isAcyclic() {
// The DepthFirstToposortVisitor throws an exception on cycles.
try {
DepthFirst::traverse($this, new DepthFirstToposortVisitor());
return TRUE;
}
catch (RuntimeException $e) {
return FALSE;
}
}
/**
* {@inheritdoc}
*/
public function getCycles() {
$scc = ConnectedComponent::tarjan_scc($this);
return $scc->getConnectedComponents();
}
/**
* {@inheritdoc}
*/
public function inDegreeOf($vertex) {
if (!$this->hasVertex($vertex)) {
throw new NonexistentVertexException('Vertex is not in the graph, in-degree information cannot be provided', E_WARNING);
}
$count = 0;
foreach ($this->vertices() as $v) {
if ($this->vertices[$v]->contains($vertex)) {
$count++;
}
}
return $count;
}
/**
* {@inheritdoc}
*/
public function outDegreeOf($vertex) {
if (!$this->hasVertex($vertex)) {
throw new NonexistentVertexException('Vertex is not in the graph, out-degree information cannot be provided', E_WARNING);
}
return $this->vertices[$vertex]->count();
}
/**
* {@inheritdoc}
*/
public function degreeOf($vertex) {
return $this->inDegreeOf($vertex) + $this->outDegreeOf($vertex);
}
}