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
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
|
{{alias}}( N )
Compact adjacency matrix constructor.
Parameters
----------
N: integer
Number of vertices.
Returns
-------
adj: Object
Compact adjacency matrix.
Examples
--------
> var adj = {{alias}}( 4 );
> adj.addEdge( 0, 1 );
> adj.addEdge( 1, 2 );
> adj.addEdge( 2, 3 );
> adj.edges
[ [ 0, 1 ], [ 1, 2 ], [ 2, 3 ] ]
{{alias}}.fromAdjacencyList( list[, clbk[, thisArg]] )
Creates a compact adjacency matrix from an adjacency list.
A callback function is provided two arguments:
- value: list element.
- i: list element index.
A callback function must return a list of vertices.
Parameters
----------
list: ArrayLikeObject|Iterable
Adjacency list.
clbk: Function (optional)
Callback to invoke for each list element.
thisArg: any (optional)
Callback execution context.
Returns
-------
adj: Object
Compact adjacency matrix.
Examples
--------
> var list = [ [ 1, 2 ], [ 2 ], [ 3 ], [] ];
> var adj = {{alias}}.fromAdjacencyList( list );
> adj.edges
[ [ 0, 1 ], [ 0, 2 ], [ 1, 2 ], [ 2, 3 ] ]
{{alias}}.fromEdges( N, edges[, clbk[, thisArg]] )
Creates a compact adjacency matrix from a list of edges.
A callback function is provided two arguments:
- value: list element.
- i: list element index.
A callback function must return a list of vertices specifying a directed
edge.
Parameters
----------
N: integer
Number of vertices.
edges: ArrayLikeObject
List of edges.
clbk: Function (optional)
Callback to invoke for each list element.
thisArg: any (optional)
Callback execution context.
Returns
-------
adj: Object
Compact adjacency matrix.
Examples
--------
> var edges = [ [ 0, 1 ], [ 0, 2 ], [ 1, 2 ], [ 2, 3 ] ];
> var adj = {{alias}}.fromEdges( 4, edges );
> var bool = adj.hasEdge( 0, 2 )
true
{{alias}}.prototype.addEdge( i, j )
Adds a directed edge between two vertices.
Parameters
----------
i: integer
Starting vertex.
j: integer
Ending vertex.
Returns
-------
adj: Object
Adjacency matrix instance.
Examples
--------
> var adj = {{alias}}( 4 );
> adj.addEdge( 0, 1 );
{{alias}}.prototype.edges
Returns the list of all edges.
Returns
-------
list: Array<Array>
List of edges.
Examples
--------
> var adj = {{alias}}( 4 );
> adj.addEdge( 0, 1 );
> adj.addEdge( 0, 2 );
> adj.addEdge( 1, 2 );
> adj.edges
[ [ 0, 1 ], [ 0, 2 ], [ 1, 2 ] ]
{{alias}}.prototype.hasEdge( i, j )
Checks whether a directed edge exists between two vertices.
Parameters
----------
i: integer
Starting vertex.
j: integer
Ending vertex.
Returns
-------
bool: boolean
Boolean indicating if an edge exists.
Examples
--------
> var adj = {{alias}}( 4 );
> adj.addEdge( 0, 1 );
> var bool = adj.hasEdge( 0, 1 )
true
{{alias}}.prototype.inDegree( i )
Returns the indegree of a vertex (i.e., number of edges ending at a vertex).
Parameters
----------
i: integer
Vertex.
Returns
-------
v: integer
Indegree.
Examples
--------
> var adj = {{alias}}( 4 );
> adj.addEdge( 0, 1 );
> adj.addEdge( 0, 2 );
> adj.addEdge( 1, 2 );
> adj.addEdge( 2, 3 );
> var v = adj.inDegree( 2 )
2
{{alias}}.prototype.inEdges( i )
Returns a list of vertices having edges ending at a specified vertex.
Parameters
----------
i: integer
Vertex.
Returns
-------
out: Array<integer>
List of vertices.
Examples
--------
> var adj = {{alias}}( 4 );
> adj.addEdge( 0, 1 );
> adj.addEdge( 0, 2 );
> adj.addEdge( 1, 2 );
> adj.addEdge( 2, 3 );
> var out = adj.inEdges( 2 )
[ 0, 1 ]
{{alias}}.prototype.nedges
Returns the total number of edges.
Returns
-------
v: integer
Total number of edges.
Examples
--------
> var adj = {{alias}}( 4 );
> adj.addEdge( 0, 1 );
> adj.addEdge( 0, 2 );
> adj.addEdge( 1, 2 );
> var out = adj.nedges
3
{{alias}}.prototype.nvertices
Returns the total number of vertices.
Returns
-------
v: integer
Total number of vertices.
Examples
--------
> var adj = {{alias}}( 4 );
> adj.addEdge( 0, 1 );
> adj.addEdge( 0, 2 );
> adj.addEdge( 1, 2 );
> var out = adj.nvertices
4
{{alias}}.prototype.outDegree( i )
Returns the outdegree of a vertex (i.e., number of edges starting at a
vertex).
Parameters
----------
i: integer
Vertex.
Returns
-------
v: integer
Outdegree.
Examples
--------
> var adj = {{alias}}( 4 );
> adj.addEdge( 0, 1 );
> adj.addEdge( 0, 2 );
> adj.addEdge( 1, 2 );
> adj.addEdge( 2, 3 );
> var v = adj.outDegree( 2 )
1
{{alias}}.prototype.outEdges( i )
Returns a list of vertices having edges starting at a specified vertex.
Parameters
----------
i: integer
Vertex.
Returns
-------
out: Array<integer>
List of vertices.
Examples
--------
> var adj = {{alias}}( 4 );
> adj.addEdge( 0, 1 );
> adj.addEdge( 0, 2 );
> adj.addEdge( 1, 2 );
> adj.addEdge( 2, 3 );
> var out = adj.outEdges( 2 )
[ 3 ]
{{alias}}.prototype.removeEdge( i, j )
Removes a directed edge between two vertices.
Parameters
----------
i: integer
Starting vertex.
j: integer
Ending vertex.
Returns
-------
adj: Object
Adjacency matrix instance.
Examples
--------
> var adj = {{alias}}( 4 );
> adj.addEdge( 0, 1 );
> adj.edges
{{alias}}.prototype.toAdjacencyList()
Returns an adjacency list representation.
Returns
-------
out: Array<Array>
Adjacency list.
Examples
--------
> var adj = {{alias}}( 4 );
> adj.addEdge( 0, 1 );
> adj.addEdge( 0, 2 );
> adj.addEdge( 1, 2 );
> adj.addEdge( 2, 3 );
> var out = adj.toAdjacencyList()
[ [ 1, 2 ], [ 2 ], [ 3 ], [] ]
{{alias}}.prototype.toposort()
Returns a topological ordering of the directed graph.
The function returns a two-element array.
If the function is able to compute a topological ordering, the first array
element is the topological ordering and the second element is `null`.
If a topological ordering cannot be achieved (e.g., due to the graph not
being a directed acyclic graph (DAG)), the first array element is `null` and
the second element is the first encountered cycle.
Returns
-------
out: Array
Results.
Examples
--------
> var adj = {{alias}}( 4 );
> adj.addEdge( 1, 0 );
> adj.addEdge( 1, 2 );
> adj.addEdge( 0, 2 );
> adj.addEdge( 2, 3 );
> var results = adj.toposort();
> var o = results[ 0 ]
[ 1, 0, 2, 3 ]
> var c = results[ 1 ]
null
> adj.addEdge( 3, 1 );
> results = adj.toposort();
> o = results[ 0 ]
null
> var c = results[ 1 ]
[ 0, 1, 3, 2, 0 ]
See Also
--------
|
