-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathclasslal_1_1graphs_1_1graph.html
724 lines (674 loc) · 47.9 KB
/
classlal_1_1graphs_1_1graph.html
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
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.11.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>LAL: Linear Arrangement Library: lal::graphs::graph Class Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script type="text/javascript" src="clipboard.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="cookie.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">LAL: Linear Arrangement Library<span id="projectnumber"> 21.07.01</span>
</div>
<div id="projectbrief">A library focused on algorithms on linear arrangements of graphs.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.11.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
$(function() { codefold.init(0); });
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
$(function() {
initMenu('',true,false,'search.php','Search',false);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
$(function(){ initResizable(false); });
/* @license-end */
</script>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="namespacelal.html">lal</a></li><li class="navelem"><a class="el" href="namespacelal_1_1graphs.html">graphs</a></li><li class="navelem"><a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a></li> </ul>
</div>
</div><!-- top -->
<div id="doc-content">
<div class="header">
<div class="summary">
<a href="#pub-methods">Public Member Functions</a> |
<a href="#pro-methods">Protected Member Functions</a> |
<a href="#pro-attribs">Protected Attributes</a> |
<a href="classlal_1_1graphs_1_1graph-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">lal::graphs::graph Class Reference<span class="mlabels"><span class="mlabel">abstract</span></span></div></div>
</div><!--header-->
<div class="contents">
<p>Abstract class for graphs.
<a href="#details">More...</a></p>
<p><code>#include <<a class="el" href="graph_8hpp_source.html">graph.hpp</a>></code></p>
<div class="dynheader">
Inheritance diagram for lal::graphs::graph:</div>
<div class="dyncontent">
<div class="center">
<img src="classlal_1_1graphs_1_1graph.png" usemap="#lal::graphs::graph_map" alt=""/>
<map id="lal::graphs::graph_map" name="lal::graphs::graph_map">
<area href="classlal_1_1graphs_1_1directed__graph.html" title="Directed graph class." alt="lal::graphs::directed_graph" shape="rect" coords="0,56,176,80"/>
<area href="classlal_1_1graphs_1_1tree.html" title="Tree graph class." alt="lal::graphs::tree" shape="rect" coords="279,56,455,80"/>
<area href="classlal_1_1graphs_1_1undirected__graph.html" title="Undirected graph class." alt="lal::graphs::undirected_graph" shape="rect" coords="558,56,734,80"/>
<area href="classlal_1_1graphs_1_1rooted__tree.html" title="Rooted tree graph class." alt="lal::graphs::rooted_tree" shape="rect" coords="0,112,176,136"/>
<area href="classlal_1_1graphs_1_1free__tree.html" title="Free tree graph class." alt="lal::graphs::free_tree" shape="rect" coords="186,112,362,136"/>
<area href="classlal_1_1graphs_1_1rooted__tree.html" title="Rooted tree graph class." alt="lal::graphs::rooted_tree" shape="rect" coords="372,112,548,136"/>
<area href="classlal_1_1graphs_1_1free__tree.html" title="Free tree graph class." alt="lal::graphs::free_tree" shape="rect" coords="558,112,734,136"/>
</map>
</div></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a8ec87987aeead9ba011d0857c63a1ca0" id="r_a8ec87987aeead9ba011d0857c63a1ca0"><td class="memItemLeft" align="right" valign="top"><a id="a8ec87987aeead9ba011d0857c63a1ca0" name="a8ec87987aeead9ba011d0857c63a1ca0"></a>
 </td><td class="memItemRight" valign="bottom"><b>graph</b> () noexcept</td></tr>
<tr class="memdesc:a8ec87987aeead9ba011d0857c63a1ca0"><td class="mdescLeft"> </td><td class="mdescRight">Empty constructor. <br /></td></tr>
<tr class="separator:a8ec87987aeead9ba011d0857c63a1ca0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae97bef5689f2fa9e9f050102e2b18306" id="r_ae97bef5689f2fa9e9f050102e2b18306"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="#ae97bef5689f2fa9e9f050102e2b18306">graph</a> (uint32_t n) noexcept</td></tr>
<tr class="memdesc:ae97bef5689f2fa9e9f050102e2b18306"><td class="mdescLeft"> </td><td class="mdescRight">Constructor with number of nodes. <br /></td></tr>
<tr class="separator:ae97bef5689f2fa9e9f050102e2b18306"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a37a5f16f34dcee866f898936334ae251" id="r_a37a5f16f34dcee866f898936334ae251"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="#a37a5f16f34dcee866f898936334ae251">graph</a> (const <a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> &g) noexcept</td></tr>
<tr class="memdesc:a37a5f16f34dcee866f898936334ae251"><td class="mdescLeft"> </td><td class="mdescRight">Copy constructor. <br /></td></tr>
<tr class="separator:a37a5f16f34dcee866f898936334ae251"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a910034f8130952ca8ec6d7d4c0e550ab" id="r_a910034f8130952ca8ec6d7d4c0e550ab"><td class="memItemLeft" align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="#a910034f8130952ca8ec6d7d4c0e550ab">graph</a> (<a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> &&g) noexcept</td></tr>
<tr class="memdesc:a910034f8130952ca8ec6d7d4c0e550ab"><td class="mdescLeft"> </td><td class="mdescRight">Move constructor. <br /></td></tr>
<tr class="separator:a910034f8130952ca8ec6d7d4c0e550ab"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a26e982ef807765291ef59033c2c17a20" id="r_a26e982ef807765291ef59033c2c17a20"><td class="memItemLeft" align="right" valign="top"><a id="a26e982ef807765291ef59033c2c17a20" name="a26e982ef807765291ef59033c2c17a20"></a>
virtual </td><td class="memItemRight" valign="bottom"><b>~graph</b> () noexcept</td></tr>
<tr class="memdesc:a26e982ef807765291ef59033c2c17a20"><td class="mdescLeft"> </td><td class="mdescRight">Destructor. <br /></td></tr>
<tr class="separator:a26e982ef807765291ef59033c2c17a20"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4e5c5ab71609a17784b5868cdc8249e9" id="r_a4e5c5ab71609a17784b5868cdc8249e9"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="#a4e5c5ab71609a17784b5868cdc8249e9">operator=</a> (const <a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> &g) noexcept</td></tr>
<tr class="memdesc:a4e5c5ab71609a17784b5868cdc8249e9"><td class="mdescLeft"> </td><td class="mdescRight">Copy assignment operator. <br /></td></tr>
<tr class="separator:a4e5c5ab71609a17784b5868cdc8249e9"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8209dcd0f8c06f8272688ad1151ef8bd" id="r_a8209dcd0f8c06f8272688ad1151ef8bd"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> & </td><td class="memItemRight" valign="bottom"><a class="el" href="#a8209dcd0f8c06f8272688ad1151ef8bd">operator=</a> (<a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> &&g) noexcept</td></tr>
<tr class="memdesc:a8209dcd0f8c06f8272688ad1151ef8bd"><td class="mdescLeft"> </td><td class="mdescRight">Move assignment operator. <br /></td></tr>
<tr class="separator:a8209dcd0f8c06f8272688ad1151ef8bd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a94098eb987f7c24d4d248571fe32e893" id="r_a94098eb987f7c24d4d248571fe32e893"><td class="memItemLeft" align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a94098eb987f7c24d4d248571fe32e893">init</a> (uint32_t n) noexcept</td></tr>
<tr class="memdesc:a94098eb987f7c24d4d248571fe32e893"><td class="mdescLeft"> </td><td class="mdescRight">Allocates the necessary memory for this class. <br /></td></tr>
<tr class="separator:a94098eb987f7c24d4d248571fe32e893"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af8ba9ec6acf2306c84d9ddbd88fc8474" id="r_af8ba9ec6acf2306c84d9ddbd88fc8474"><td class="memItemLeft" align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="#af8ba9ec6acf2306c84d9ddbd88fc8474">clear</a> () noexcept</td></tr>
<tr class="memdesc:af8ba9ec6acf2306c84d9ddbd88fc8474"><td class="mdescLeft"> </td><td class="mdescRight">Frees the memory occupied by this graph. <br /></td></tr>
<tr class="separator:af8ba9ec6acf2306c84d9ddbd88fc8474"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a32fef69d99615a885bb8a0f421108c76" id="r_a32fef69d99615a885bb8a0f421108c76"><td class="memItemLeft" align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a32fef69d99615a885bb8a0f421108c76">normalise</a> () noexcept</td></tr>
<tr class="memdesc:a32fef69d99615a885bb8a0f421108c76"><td class="mdescLeft"> </td><td class="mdescRight">Normalises the graph. <br /></td></tr>
<tr class="separator:a32fef69d99615a885bb8a0f421108c76"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af992e20fc9b8c988c8189bbc6e2f68c0" id="r_af992e20fc9b8c988c8189bbc6e2f68c0"><td class="memItemLeft" align="right" valign="top">virtual bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#af992e20fc9b8c988c8189bbc6e2f68c0">check_normalised</a> () noexcept</td></tr>
<tr class="memdesc:af992e20fc9b8c988c8189bbc6e2f68c0"><td class="mdescLeft"> </td><td class="mdescRight">Checks if the graph is normalised. <br /></td></tr>
<tr class="separator:af992e20fc9b8c988c8189bbc6e2f68c0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8557150991968f72048da41cef993413" id="r_a8557150991968f72048da41cef993413"><td class="memItemLeft" align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a8557150991968f72048da41cef993413">finish_bulk_add</a> (bool norm=true, bool check=true) noexcept=0</td></tr>
<tr class="memdesc:a8557150991968f72048da41cef993413"><td class="mdescLeft"> </td><td class="mdescRight">Completes the inner structure of the graph after adding a bulk of edges. <br /></td></tr>
<tr class="separator:a8557150991968f72048da41cef993413"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ade7d7dfb09b3da30c49c8f6a47aa4987" id="r_ade7d7dfb09b3da30c49c8f6a47aa4987"><td class="memItemLeft" align="right" valign="top"><a id="ade7d7dfb09b3da30c49c8f6a47aa4987" name="ade7d7dfb09b3da30c49c8f6a47aa4987"></a>
void </td><td class="memItemRight" valign="bottom"><b>set_normalised</b> (bool v=true) noexcept</td></tr>
<tr class="memdesc:ade7d7dfb09b3da30c49c8f6a47aa4987"><td class="mdescLeft"> </td><td class="mdescRight">Sets whether this graph is normalised or not. <br /></td></tr>
<tr class="separator:ade7d7dfb09b3da30c49c8f6a47aa4987"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a91155aa7578956540e8811aa896d06c5" id="r_a91155aa7578956540e8811aa896d06c5"><td class="memItemLeft" align="right" valign="top">virtual std::vector< <a class="el" href="namespacelal.html#a235d5351556fbc73aa51767ab7765f5c">edge_pair</a> > </td><td class="memItemRight" valign="bottom"><a class="el" href="#a91155aa7578956540e8811aa896d06c5">get_Q</a> () const noexcept=0</td></tr>
<tr class="memdesc:a91155aa7578956540e8811aa896d06c5"><td class="mdescLeft"> </td><td class="mdescRight">Returns all independent pairs of edges of this graph. <br /></td></tr>
<tr class="separator:a91155aa7578956540e8811aa896d06c5"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1c03143c2956cc87a14cd55e03107d10" id="r_a1c03143c2956cc87a14cd55e03107d10"><td class="memItemLeft" align="right" valign="top"><a id="a1c03143c2956cc87a14cd55e03107d10" name="a1c03143c2956cc87a14cd55e03107d10"></a>
bool </td><td class="memItemRight" valign="bottom"><b>has_node</b> (<a class="el" href="namespacelal.html#abd94045faecfc68a03268dde9c9a13eb">node</a> u) const noexcept</td></tr>
<tr class="memdesc:a1c03143c2956cc87a14cd55e03107d10"><td class="mdescLeft"> </td><td class="mdescRight">Returns true if node <em>u</em> is in this graph. <br /></td></tr>
<tr class="separator:a1c03143c2956cc87a14cd55e03107d10"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3d04a922d0e8eda9924a441004499108" id="r_a3d04a922d0e8eda9924a441004499108"><td class="memItemLeft" align="right" valign="top"><a id="a3d04a922d0e8eda9924a441004499108" name="a3d04a922d0e8eda9924a441004499108"></a>
virtual bool </td><td class="memItemRight" valign="bottom"><b>has_edge</b> (<a class="el" href="namespacelal.html#abd94045faecfc68a03268dde9c9a13eb">node</a> u, <a class="el" href="namespacelal.html#abd94045faecfc68a03268dde9c9a13eb">node</a> v) const =0</td></tr>
<tr class="memdesc:a3d04a922d0e8eda9924a441004499108"><td class="mdescLeft"> </td><td class="mdescRight">Returns true if the undirected edge (<em>u</em>, <em>v</em>) exists in the graph. <br /></td></tr>
<tr class="separator:a3d04a922d0e8eda9924a441004499108"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a9c334a5bbfc9557c25e98af3ec40e1c2" id="r_a9c334a5bbfc9557c25e98af3ec40e1c2"><td class="memItemLeft" align="right" valign="top"><a id="a9c334a5bbfc9557c25e98af3ec40e1c2" name="a9c334a5bbfc9557c25e98af3ec40e1c2"></a>
uint32_t </td><td class="memItemRight" valign="bottom"><b>get_num_nodes</b> () const noexcept</td></tr>
<tr class="memdesc:a9c334a5bbfc9557c25e98af3ec40e1c2"><td class="mdescLeft"> </td><td class="mdescRight">Returns the number of ndoes. <br /></td></tr>
<tr class="separator:a9c334a5bbfc9557c25e98af3ec40e1c2"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac4853c4505fe9fb997dcd1f9608297ec" id="r_ac4853c4505fe9fb997dcd1f9608297ec"><td class="memItemLeft" align="right" valign="top"><a id="ac4853c4505fe9fb997dcd1f9608297ec" name="ac4853c4505fe9fb997dcd1f9608297ec"></a>
uint32_t </td><td class="memItemRight" valign="bottom"><b>get_num_edges</b> () const noexcept</td></tr>
<tr class="memdesc:ac4853c4505fe9fb997dcd1f9608297ec"><td class="mdescLeft"> </td><td class="mdescRight">Returns the number of edges. <br /></td></tr>
<tr class="separator:ac4853c4505fe9fb997dcd1f9608297ec"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aebdf79ccbdd3d0217ab4ebc2b85da9b1" id="r_aebdf79ccbdd3d0217ab4ebc2b85da9b1"><td class="memItemLeft" align="right" valign="top"><a id="aebdf79ccbdd3d0217ab4ebc2b85da9b1" name="aebdf79ccbdd3d0217ab4ebc2b85da9b1"></a>
virtual std::vector< <a class="el" href="namespacelal.html#a5969ec7ecc85697ebb9ec0ace78fbcab">edge</a> > </td><td class="memItemRight" valign="bottom"><b>get_edges</b> () const noexcept=0</td></tr>
<tr class="memdesc:aebdf79ccbdd3d0217ab4ebc2b85da9b1"><td class="mdescLeft"> </td><td class="mdescRight">Returns all edges of this graph. <br /></td></tr>
<tr class="separator:aebdf79ccbdd3d0217ab4ebc2b85da9b1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a20e3c4adafeb9a479e4fa6b5b5fa5a32" id="r_a20e3c4adafeb9a479e4fa6b5b5fa5a32"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#a20e3c4adafeb9a479e4fa6b5b5fa5a32">is_normalised</a> () const noexcept</td></tr>
<tr class="memdesc:a20e3c4adafeb9a479e4fa6b5b5fa5a32"><td class="mdescLeft"> </td><td class="mdescRight">Returns whether this graph is normalised or not. <br /></td></tr>
<tr class="separator:a20e3c4adafeb9a479e4fa6b5b5fa5a32"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a49c2a4c21b5d1bc7a29c09af9fc555bc" id="r_a49c2a4c21b5d1bc7a29c09af9fc555bc"><td class="memItemLeft" align="right" valign="top"><a id="a49c2a4c21b5d1bc7a29c09af9fc555bc" name="a49c2a4c21b5d1bc7a29c09af9fc555bc"></a>
virtual bool </td><td class="memItemRight" valign="bottom"><b>is_directed</b> () const noexcept=0</td></tr>
<tr class="memdesc:a49c2a4c21b5d1bc7a29c09af9fc555bc"><td class="mdescLeft"> </td><td class="mdescRight">Returns whether this graph is directed or not. <br /></td></tr>
<tr class="separator:a49c2a4c21b5d1bc7a29c09af9fc555bc"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a73db3be0a36fe9f49189b05258af2590" id="r_a73db3be0a36fe9f49189b05258af2590"><td class="memItemLeft" align="right" valign="top"><a id="a73db3be0a36fe9f49189b05258af2590" name="a73db3be0a36fe9f49189b05258af2590"></a>
virtual bool </td><td class="memItemRight" valign="bottom"><b>is_undirected</b> () const noexcept=0</td></tr>
<tr class="memdesc:a73db3be0a36fe9f49189b05258af2590"><td class="mdescLeft"> </td><td class="mdescRight">Returns whether this graph is undirected or not. <br /></td></tr>
<tr class="separator:a73db3be0a36fe9f49189b05258af2590"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pro-methods" name="pro-methods"></a>
Protected Member Functions</h2></td></tr>
<tr class="memitem:af084f1de2935553fb7f861642cc1858c" id="r_af084f1de2935553fb7f861642cc1858c"><td class="memItemLeft" align="right" valign="top"><a id="af084f1de2935553fb7f861642cc1858c" name="af084f1de2935553fb7f861642cc1858c"></a>
virtual void </td><td class="memItemRight" valign="bottom"><b>_init</b> (uint32_t n) noexcept</td></tr>
<tr class="memdesc:af084f1de2935553fb7f861642cc1858c"><td class="mdescLeft"> </td><td class="mdescRight">Initialises memory of <a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> class. <br /></td></tr>
<tr class="separator:af084f1de2935553fb7f861642cc1858c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a6e650acae6ec4cf32e74670676455368" id="r_a6e650acae6ec4cf32e74670676455368"><td class="memItemLeft" align="right" valign="top"><a id="a6e650acae6ec4cf32e74670676455368" name="a6e650acae6ec4cf32e74670676455368"></a>
virtual void </td><td class="memItemRight" valign="bottom"><b>_clear</b> () noexcept</td></tr>
<tr class="memdesc:a6e650acae6ec4cf32e74670676455368"><td class="mdescLeft"> </td><td class="mdescRight">Clears memory for the <a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> class. <br /></td></tr>
<tr class="separator:a6e650acae6ec4cf32e74670676455368"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0ea60f01e9535ae965e54b9caa3d08fd" id="r_a0ea60f01e9535ae965e54b9caa3d08fd"><td class="memItemLeft" align="right" valign="top"><a id="a0ea60f01e9535ae965e54b9caa3d08fd" name="a0ea60f01e9535ae965e54b9caa3d08fd"></a>
void </td><td class="memItemRight" valign="bottom"><b>copy_full_graph</b> (const <a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> &g) noexcept</td></tr>
<tr class="memdesc:a0ea60f01e9535ae965e54b9caa3d08fd"><td class="mdescLeft"> </td><td class="mdescRight">Copies all members of this class. <br /></td></tr>
<tr class="separator:a0ea60f01e9535ae965e54b9caa3d08fd"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:aca19fcaa6d290a97c92ef95df92160ae" id="r_aca19fcaa6d290a97c92ef95df92160ae"><td class="memItemLeft" align="right" valign="top"><a id="aca19fcaa6d290a97c92ef95df92160ae" name="aca19fcaa6d290a97c92ef95df92160ae"></a>
void </td><td class="memItemRight" valign="bottom"><b>move_full_graph</b> (<a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> &&g) noexcept</td></tr>
<tr class="memdesc:aca19fcaa6d290a97c92ef95df92160ae"><td class="mdescLeft"> </td><td class="mdescRight">Moves all members of this class. <br /></td></tr>
<tr class="separator:aca19fcaa6d290a97c92ef95df92160ae"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a2953c51682d770519cac771dc26c77ee" id="r_a2953c51682d770519cac771dc26c77ee"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a2953c51682d770519cac771dc26c77ee">__disjoint_union</a> (const <a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> &g) noexcept</td></tr>
<tr class="memdesc:a2953c51682d770519cac771dc26c77ee"><td class="mdescLeft"> </td><td class="mdescRight">Disjoint union of graphs. <br /></td></tr>
<tr class="separator:a2953c51682d770519cac771dc26c77ee"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a0f5a5e810aceb0e557a4e1debf79a8a3" id="r_a0f5a5e810aceb0e557a4e1debf79a8a3"><td class="memItemLeft" align="right" valign="top"><a id="a0f5a5e810aceb0e557a4e1debf79a8a3" name="a0f5a5e810aceb0e557a4e1debf79a8a3"></a>
virtual void </td><td class="memItemRight" valign="bottom"><b>extra_work_per_edge_add</b> (<a class="el" href="namespacelal.html#abd94045faecfc68a03268dde9c9a13eb">node</a> u, <a class="el" href="namespacelal.html#abd94045faecfc68a03268dde9c9a13eb">node</a> v) noexcept</td></tr>
<tr class="memdesc:a0f5a5e810aceb0e557a4e1debf79a8a3"><td class="mdescLeft"> </td><td class="mdescRight">Do some extra work after an edge has been added. <br /></td></tr>
<tr class="separator:a0f5a5e810aceb0e557a4e1debf79a8a3"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a72db97a2f52da5d9b20d5c2c5c80a876" id="r_a72db97a2f52da5d9b20d5c2c5c80a876"><td class="memItemLeft" align="right" valign="top"><a id="a72db97a2f52da5d9b20d5c2c5c80a876" name="a72db97a2f52da5d9b20d5c2c5c80a876"></a>
virtual void </td><td class="memItemRight" valign="bottom"><b>extra_work_per_edge_remove</b> (<a class="el" href="namespacelal.html#abd94045faecfc68a03268dde9c9a13eb">node</a> u, <a class="el" href="namespacelal.html#abd94045faecfc68a03268dde9c9a13eb">node</a> v) noexcept</td></tr>
<tr class="memdesc:a72db97a2f52da5d9b20d5c2c5c80a876"><td class="mdescLeft"> </td><td class="mdescRight">Do some extra work after an edge has been removed. <br /></td></tr>
<tr class="separator:a72db97a2f52da5d9b20d5c2c5c80a876"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ac20a37d52aae815d45d150f1952cfcf0" id="r_ac20a37d52aae815d45d150f1952cfcf0"><td class="memItemLeft" align="right" valign="top"><a id="ac20a37d52aae815d45d150f1952cfcf0" name="ac20a37d52aae815d45d150f1952cfcf0"></a>
void </td><td class="memItemRight" valign="bottom"><b>normalise_after_add</b> (bool norm, bool check) noexcept</td></tr>
<tr class="memdesc:ac20a37d52aae815d45d150f1952cfcf0"><td class="mdescLeft"> </td><td class="mdescRight">Normalise the graph after one (or more) edges have been added. <br /></td></tr>
<tr class="separator:ac20a37d52aae815d45d150f1952cfcf0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abc06f71010fd4a4bb706ae779ace05ab" id="r_abc06f71010fd4a4bb706ae779ace05ab"><td class="memItemLeft" align="right" valign="top"><a id="abc06f71010fd4a4bb706ae779ace05ab" name="abc06f71010fd4a4bb706ae779ace05ab"></a>
void </td><td class="memItemRight" valign="bottom"><b>normalise_after_remove</b> (bool norm, bool check) noexcept</td></tr>
<tr class="memdesc:abc06f71010fd4a4bb706ae779ace05ab"><td class="mdescLeft"> </td><td class="mdescRight">Normalise the graph after one (or more) edges have been removed. <br /></td></tr>
<tr class="separator:abc06f71010fd4a4bb706ae779ace05ab"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pro-attribs" name="pro-attribs"></a>
Protected Attributes</h2></td></tr>
<tr class="memitem:ad87c640988218838def15ea96645bb84" id="r_ad87c640988218838def15ea96645bb84"><td class="memItemLeft" align="right" valign="top"><a id="ad87c640988218838def15ea96645bb84" name="ad87c640988218838def15ea96645bb84"></a>
std::vector< <a class="el" href="namespacelal.html#aef91d923414879a998619e9c65181d1f">neighbourhood</a> > </td><td class="memItemRight" valign="bottom"><b>m_adjacency_list</b></td></tr>
<tr class="memdesc:ad87c640988218838def15ea96645bb84"><td class="mdescLeft"> </td><td class="mdescRight">Data structure that implements the graph. <br /></td></tr>
<tr class="separator:ad87c640988218838def15ea96645bb84"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a94279fece660b0028a7d0d53482d26d9" id="r_a94279fece660b0028a7d0d53482d26d9"><td class="memItemLeft" align="right" valign="top"><a id="a94279fece660b0028a7d0d53482d26d9" name="a94279fece660b0028a7d0d53482d26d9"></a>
uint32_t </td><td class="memItemRight" valign="bottom"><b>m_num_edges</b> = 0</td></tr>
<tr class="memdesc:a94279fece660b0028a7d0d53482d26d9"><td class="mdescLeft"> </td><td class="mdescRight">Amount of edges of this graph. <br /></td></tr>
<tr class="separator:a94279fece660b0028a7d0d53482d26d9"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:afbd9fef263d20c982a21371e3d1e9307" id="r_afbd9fef263d20c982a21371e3d1e9307"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#afbd9fef263d20c982a21371e3d1e9307">m_normalised</a> = true</td></tr>
<tr class="memdesc:afbd9fef263d20c982a21371e3d1e9307"><td class="mdescLeft"> </td><td class="mdescRight">Is this graph normalised? <br /></td></tr>
<tr class="separator:afbd9fef263d20c982a21371e3d1e9307"><td class="memSeparator" colspan="2"> </td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Abstract class for graphs. </p>
<p>Class used as an interface for all types of graphs. This means that this class cannot be instantiated. The classes that can be instantiated are <a class="el" href="classlal_1_1graphs_1_1undirected__graph.html">undirected_graph</a>, <a class="el" href="classlal_1_1graphs_1_1directed__graph.html">directed_graph</a>, <a class="el" href="classlal_1_1graphs_1_1free__tree.html">free_tree</a>, <a class="el" href="classlal_1_1graphs_1_1rooted__tree.html">rooted_tree</a>.</p>
<p>A usual way of initialising classes inheriting from this one is to use one of the <a class="el" href="#a94098eb987f7c24d4d248571fe32e893">init</a> methods available. Depending on the subclass, this method admits either the number of nodes of the graph or a whole other graph and further information (see <a class="el" href="classlal_1_1graphs_1_1rooted__tree.html#a5ff9b63d93b90cb03fde9e69111ff598">rooted_tree::init_rooted(const free_tree&,node)</a>. While these classes' internal memory can be initialised, it can also be cleared using method <a class="el" href="#af8ba9ec6acf2306c84d9ddbd88fc8474">clear</a>. Each class reimplements this method to carry this task appropriately. </p>
</div><h2 class="groupheader">Constructor & Destructor Documentation</h2>
<a id="ae97bef5689f2fa9e9f050102e2b18306" name="ae97bef5689f2fa9e9f050102e2b18306"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae97bef5689f2fa9e9f050102e2b18306">◆ </a></span>graph() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">lal::graphs::graph::graph </td>
<td>(</td>
<td class="paramtype">uint32_t</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Constructor with number of nodes. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">n</td><td>Number of nodes. </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a37a5f16f34dcee866f898936334ae251" name="a37a5f16f34dcee866f898936334ae251"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a37a5f16f34dcee866f898936334ae251">◆ </a></span>graph() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">lal::graphs::graph::graph </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> &</td> <td class="paramname"><span class="paramname"><em>g</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Copy constructor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">g</td><td>Graph. </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a910034f8130952ca8ec6d7d4c0e550ab" name="a910034f8130952ca8ec6d7d4c0e550ab"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a910034f8130952ca8ec6d7d4c0e550ab">◆ </a></span>graph() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">lal::graphs::graph::graph </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> &&</td> <td class="paramname"><span class="paramname"><em>g</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Move constructor. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">g</td><td>Graph. </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a2953c51682d770519cac771dc26c77ee" name="a2953c51682d770519cac771dc26c77ee"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2953c51682d770519cac771dc26c77ee">◆ </a></span>__disjoint_union()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void lal::graphs::graph::__disjoint_union </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> &</td> <td class="paramname"><span class="paramname"><em>g</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Disjoint union of graphs. </p>
<p>Given a graph, append it to the current graph.</p>
<p>All the nodes in <em>g</em> are relabelled starting at <em>n</em>, the number of nodes of the current graph. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">g</td><td>Input graph. </td></tr>
</table>
</dd>
</dl>
<dl class="section pre"><dt>Precondition</dt><dd>This graph and <em>g</em> must be of the same type (both must be either undirected, or both directed). </dd></dl>
<dl class="section post"><dt>Postcondition</dt><dd>The graph is normalised only if it was normalised before the call and <em>g</em> is also normalised. </dd></dl>
</div>
</div>
<a id="af992e20fc9b8c988c8189bbc6e2f68c0" name="af992e20fc9b8c988c8189bbc6e2f68c0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af992e20fc9b8c988c8189bbc6e2f68c0">◆ </a></span>check_normalised()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">virtual bool lal::graphs::graph::check_normalised </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">virtual</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Checks if the graph is normalised. </p>
<p>Checks, whether the graph's adjacency structure is normalised or not. In case it is, attribute <a class="el" href="#afbd9fef263d20c982a21371e3d1e9307">m_normalised</a> is set to true, so method <a class="el" href="#a20e3c4adafeb9a479e4fa6b5b5fa5a32">is_normalised</a> evaluates to true. </p>
<p>Reimplemented in <a class="el" href="classlal_1_1graphs_1_1directed__graph.html#a67a5bb67a3b5ed28c44473d1e0d2f051">lal::graphs::directed_graph</a>.</p>
</div>
</div>
<a id="af8ba9ec6acf2306c84d9ddbd88fc8474" name="af8ba9ec6acf2306c84d9ddbd88fc8474"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af8ba9ec6acf2306c84d9ddbd88fc8474">◆ </a></span>clear()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">virtual void lal::graphs::graph::clear </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">virtual</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Frees the memory occupied by this graph. </p>
<p>See <a class="el" href="#a6e650acae6ec4cf32e74670676455368">_clear</a> for details. </p><dl class="section post"><dt>Postcondition</dt><dd>The graph is normalised. The number of edges is 0. </dd></dl>
</div>
</div>
<a id="a8557150991968f72048da41cef993413" name="a8557150991968f72048da41cef993413"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8557150991968f72048da41cef993413">◆ </a></span>finish_bulk_add()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">virtual void lal::graphs::graph::finish_bulk_add </td>
<td>(</td>
<td class="paramtype">bool</td> <td class="paramname"><span class="paramname"><em>norm</em></span><span class="paramdefsep"> = </span><span class="paramdefval">true</span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool</td> <td class="paramname"><span class="paramname"><em>check</em></span><span class="paramdefsep"> = </span><span class="paramdefval">true</span> )</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">pure virtual</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Completes the inner structure of the graph after adding a bulk of edges. </p>
<p>This is meant to be used after several calls to <a class="el" href="classlal_1_1graphs_1_1undirected__graph.html#aff5345340dbc02e33c0d38360558ee29">undirected_graph::add_edge_bulk</a>, <a class="el" href="classlal_1_1graphs_1_1directed__graph.html#a8134851a1ed8f81fe624fcb37e8ffa77">directed_graph::add_edge_bulk</a>. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">norm</td><td>Normalise the graph </td></tr>
<tr><td class="paramname">check</td><td>Check wether the graph is normalised or not. </td></tr>
</table>
</dd>
</dl>
<p>Implemented in <a class="el" href="classlal_1_1graphs_1_1directed__graph.html#acbce7afc53f5df523ff7745ca794b884">lal::graphs::directed_graph</a>, <a class="el" href="classlal_1_1graphs_1_1free__tree.html#aad64cfa05c23d84dc799f47a3fdf6f9e">lal::graphs::free_tree</a>, <a class="el" href="classlal_1_1graphs_1_1rooted__tree.html#abe50e618c75559487ae18fb837fe49fe">lal::graphs::rooted_tree</a>, and <a class="el" href="classlal_1_1graphs_1_1undirected__graph.html#afc4b91d30bcbeaa344b0adce2ca8bba6">lal::graphs::undirected_graph</a>.</p>
</div>
</div>
<a id="a91155aa7578956540e8811aa896d06c5" name="a91155aa7578956540e8811aa896d06c5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a91155aa7578956540e8811aa896d06c5">◆ </a></span>get_Q()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">virtual std::vector< <a class="el" href="namespacelal.html#a235d5351556fbc73aa51767ab7765f5c">edge_pair</a> > lal::graphs::graph::get_Q </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">pure virtual</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns all independent pairs of edges of this graph. </p>
<p>The set \(Q(G)\) is defined as the pairs of edges of \(G\), \(E(G) \times E(G)\), that are independent, that is, that share no nodes. </p>
<p>Implemented in <a class="el" href="classlal_1_1graphs_1_1directed__graph.html#a116071bf1763e9454e1fc047b6c236d8">lal::graphs::directed_graph</a>, and <a class="el" href="classlal_1_1graphs_1_1undirected__graph.html#a742dbaac9c82914744e76de4bdcec277">lal::graphs::undirected_graph</a>.</p>
</div>
</div>
<a id="a94098eb987f7c24d4d248571fe32e893" name="a94098eb987f7c24d4d248571fe32e893"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a94098eb987f7c24d4d248571fe32e893">◆ </a></span>init()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">virtual void lal::graphs::graph::init </td>
<td>(</td>
<td class="paramtype">uint32_t</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">virtual</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Allocates the necessary memory for this class. </p>
<p>See <a class="el" href="#af084f1de2935553fb7f861642cc1858c">_init</a> for details. </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">n</td><td>Number of nodes. </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a20e3c4adafeb9a479e4fa6b5b5fa5a32" name="a20e3c4adafeb9a479e4fa6b5b5fa5a32"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a20e3c4adafeb9a479e4fa6b5b5fa5a32">◆ </a></span>is_normalised()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool lal::graphs::graph::is_normalised </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Returns whether this graph is normalised or not. </p>
<p>A graph is normalised if every node's adjacency list is sorted increasingly. For this, use method <a class="el" href="#a32fef69d99615a885bb8a0f421108c76">normalise()</a>. </p><dl class="section return"><dt>Returns</dt><dd>The value of <a class="el" href="#afbd9fef263d20c982a21371e3d1e9307">m_normalised</a>. </dd></dl>
</div>
</div>
<a id="a32fef69d99615a885bb8a0f421108c76" name="a32fef69d99615a885bb8a0f421108c76"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a32fef69d99615a885bb8a0f421108c76">◆ </a></span>normalise()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">virtual void lal::graphs::graph::normalise </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">virtual</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Normalises the graph. </p>
<p>Sorts this graph's adjacency list structure in increasing order.</p>
<p>Besides expensive, this method may be unnecessary. Method <a class="el" href="#af992e20fc9b8c988c8189bbc6e2f68c0">check_normalised()</a> checks whether the graph is normalised or not; in case it is, using this method is completely unnecessary. </p><dl class="section post"><dt>Postcondition</dt><dd>Method <a class="el" href="#a20e3c4adafeb9a479e4fa6b5b5fa5a32">is_normalised</a> evaluates to true. </dd></dl>
<p>Reimplemented in <a class="el" href="classlal_1_1graphs_1_1directed__graph.html#ae1bf2e53e7081b79fa13ee24daef9993">lal::graphs::directed_graph</a>.</p>
</div>
</div>
<a id="a4e5c5ab71609a17784b5868cdc8249e9" name="a4e5c5ab71609a17784b5868cdc8249e9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4e5c5ab71609a17784b5868cdc8249e9">◆ </a></span>operator=() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> & lal::graphs::graph::operator= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> &</td> <td class="paramname"><span class="paramname"><em>g</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Copy assignment operator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">g</td><td>Graph. </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a id="a8209dcd0f8c06f8272688ad1151ef8bd" name="a8209dcd0f8c06f8272688ad1151ef8bd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8209dcd0f8c06f8272688ad1151ef8bd">◆ </a></span>operator=() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> & lal::graphs::graph::operator= </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classlal_1_1graphs_1_1graph.html">graph</a> &&</td> <td class="paramname"><span class="paramname"><em>g</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">noexcept</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Move assignment operator. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">g</td><td>Graph. </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a id="afbd9fef263d20c982a21371e3d1e9307" name="afbd9fef263d20c982a21371e3d1e9307"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afbd9fef263d20c982a21371e3d1e9307">◆ </a></span>m_normalised</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool lal::graphs::graph::m_normalised = true</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Is this graph normalised? </p>
<p>An undirected graph is normalised iff every node's adjacency list is sorted in increasing order.</p>
<p>In directed graphs, however, it is necessary that the adjacency lists of the out-neighbours and in-neighbours of nodes be sorted.</p>
<p>This attribute is set to 'true' in all graph's initialisation and destruction (when <a class="el" href="#af8ba9ec6acf2306c84d9ddbd88fc8474">clear()</a> method is called). </p>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>lal/graphs/<a class="el" href="graph_8hpp_source.html">graph.hpp</a></li>
</ul>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.11.0
</small></address>
</div><!-- doc-content -->
</body>
</html>