-
Notifications
You must be signed in to change notification settings - Fork 123
/
Copy pathclassCXXGRAPH_1_1Graph.html
566 lines (531 loc) · 38 KB
/
classCXXGRAPH_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
<!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">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>CXXGraph: CXXGRAPH::Graph< T > Class Template 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>
<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>
<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 style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="../../logo.png"/></td>
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">CXXGraph
 <span id="projectnumber">0.1.3</span>
</div>
<div id="projectbrief">CXXGraph is a small library, header only, that manages the Graph and it's algorithm in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
<!-- 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">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><b>CXXGRAPH</b></li><li class="navelem"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">Graph</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="summary">
<a href="#pub-types">Public Types</a> |
<a href="#pub-methods">Public Member Functions</a> |
<a href="#friends">Friends</a> |
<a href="../../de/d77/classCXXGRAPH_1_1Graph-members.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">CXXGRAPH::Graph< T > Class Template Reference</div> </div>
</div><!--header-->
<div class="contents">
<div class="dynheader">
Inheritance diagram for CXXGRAPH::Graph< T >:</div>
<div class="dyncontent">
<div class="center"><img src="../../dc/d80/classCXXGRAPH_1_1Graph__inherit__graph.png" border="0" usemap="#aCXXGRAPH_1_1Graph_3_01T_01_4_inherit__map" alt="Inheritance graph"/></div>
<map name="aCXXGRAPH_1_1Graph_3_01T_01_4_inherit__map" id="aCXXGRAPH_1_1Graph_3_01T_01_4_inherit__map">
<area shape="rect" title=" " alt="" coords="12,5,179,32"/>
<area shape="rect" href="../../d4/d32/classCXXGRAPH_1_1Partition.html" title=" " alt="" coords="5,80,185,107"/>
</map>
<center><span class="legend">[<a href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-types"></a>
Public Types</h2></td></tr>
<tr class="memitem:af40584c5cd15ce35ad36a736b3429c71"><td class="memItemLeft" align="right" valign="top">enum  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#af40584c5cd15ce35ad36a736b3429c71">E_InputOutputFormat</a> { <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#af40584c5cd15ce35ad36a736b3429c71a12e3f194ab31b8c22b5789dda8d4645c">STANDARD_CSV</a>
, <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#af40584c5cd15ce35ad36a736b3429c71a28e4461e98949e163fe3ad5982065d76">STANDARD_TSV</a>
, <b>OUT_1</b>
, <b>OUT_2</b>
}</td></tr>
<tr class="memdesc:af40584c5cd15ce35ad36a736b3429c71"><td class="mdescLeft"> </td><td class="mdescRight">Specify the Input/Output format of the <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">Graph</a> for Import/Export functions. <a href="../../d0/df2/classCXXGRAPH_1_1Graph.html#af40584c5cd15ce35ad36a736b3429c71">More...</a><br /></td></tr>
<tr class="separator:af40584c5cd15ce35ad36a736b3429c71"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1549d3208d57a922c72d0885894f1c32"><td class="memItemLeft" align="right" valign="top">enum  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a1549d3208d57a922c72d0885894f1c32">E_PartitionAlgorithm</a> { <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a1549d3208d57a922c72d0885894f1c32acc15214a985a3049a81a874878ffbabb">GREEDY_VC</a>
, <b>ALG_1</b>
, <b>ALG_2</b>
}</td></tr>
<tr class="memdesc:a1549d3208d57a922c72d0885894f1c32"><td class="mdescLeft"> </td><td class="mdescRight">Specify the <a class="el" href="../../d4/d32/classCXXGRAPH_1_1Partition.html">Partition</a> Algorithm. <a href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a1549d3208d57a922c72d0885894f1c32">More...</a><br /></td></tr>
<tr class="separator:a1549d3208d57a922c72d0885894f1c32"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a41742703923f919470b2ca1496b124d6"><td class="memItemLeft" align="right" valign="top"><a id="a41742703923f919470b2ca1496b124d6"></a>
typedef enum <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#af40584c5cd15ce35ad36a736b3429c71">CXXGRAPH::Graph::E_InputOutputFormat</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a41742703923f919470b2ca1496b124d6">InputOutputFormat</a></td></tr>
<tr class="memdesc:a41742703923f919470b2ca1496b124d6"><td class="mdescLeft"> </td><td class="mdescRight">Specify the Input/Output format of the <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">Graph</a> for Import/Export functions. <br /></td></tr>
<tr class="separator:a41742703923f919470b2ca1496b124d6"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a3df0188b5897ee4404982a27cd543485"><td class="memItemLeft" align="right" valign="top"><a id="a3df0188b5897ee4404982a27cd543485"></a>
typedef enum <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a1549d3208d57a922c72d0885894f1c32">CXXGRAPH::Graph::E_PartitionAlgorithm</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a3df0188b5897ee4404982a27cd543485">PartitionAlgorithm</a></td></tr>
<tr class="memdesc:a3df0188b5897ee4404982a27cd543485"><td class="mdescLeft"> </td><td class="mdescRight">Specify the <a class="el" href="../../d4/d32/classCXXGRAPH_1_1Partition.html">Partition</a> Algorithm. <br /></td></tr>
<tr class="separator:a3df0188b5897ee4404982a27cd543485"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a49433844912894835ea1142fd90abfb1"><td class="memItemLeft" align="right" valign="top"><a id="a49433844912894835ea1142fd90abfb1"></a>
 </td><td class="memItemRight" valign="bottom"><b>Graph</b> (const std::list< const <a class="el" href="../../d7/d2a/classCXXGRAPH_1_1Edge.html">Edge</a>< T > * > &edgeSet)</td></tr>
<tr class="separator:a49433844912894835ea1142fd90abfb1"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a1d00ee150e0876b4edb10616e052021a"><td class="memItemLeft" align="right" valign="top"><a id="a1d00ee150e0876b4edb10616e052021a"></a>
const std::list< const <a class="el" href="../../d7/d2a/classCXXGRAPH_1_1Edge.html">Edge</a>< T > * > & </td><td class="memItemRight" valign="bottom"><b>getEdgeSet</b> () const</td></tr>
<tr class="separator:a1d00ee150e0876b4edb10616e052021a"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:af2cd256d3638bf15ea926b6da6bc6097"><td class="memItemLeft" align="right" valign="top"><a id="af2cd256d3638bf15ea926b6da6bc6097"></a>
void </td><td class="memItemRight" valign="bottom"><b>setEdgeSet</b> (std::list< const <a class="el" href="../../d7/d2a/classCXXGRAPH_1_1Edge.html">Edge</a>< T > * > &edgeSet)</td></tr>
<tr class="separator:af2cd256d3638bf15ea926b6da6bc6097"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a95fc676b51609323126e1d6f2366c4bb"><td class="memItemLeft" align="right" valign="top"><a id="a95fc676b51609323126e1d6f2366c4bb"></a>
void </td><td class="memItemRight" valign="bottom"><b>addEdge</b> (const <a class="el" href="../../d7/d2a/classCXXGRAPH_1_1Edge.html">Edge</a>< T > *edge)</td></tr>
<tr class="separator:a95fc676b51609323126e1d6f2366c4bb"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4fe93321484d4144d3ff7db0ef33707c"><td class="memItemLeft" align="right" valign="top"><a id="a4fe93321484d4144d3ff7db0ef33707c"></a>
void </td><td class="memItemRight" valign="bottom"><b>removeEdge</b> (unsigned long edgeId)</td></tr>
<tr class="separator:a4fe93321484d4144d3ff7db0ef33707c"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae68cf3b1eb04907935c032755bd81004"><td class="memItemLeft" align="right" valign="top"><a id="ae68cf3b1eb04907935c032755bd81004"></a>
const std::list< const <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a>< T > * > </td><td class="memItemRight" valign="bottom"><b>getNodeSet</b> () const</td></tr>
<tr class="separator:ae68cf3b1eb04907935c032755bd81004"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4671c249cc900ab644b9142e1deaa534"><td class="memItemLeft" align="right" valign="top"><a id="a4671c249cc900ab644b9142e1deaa534"></a>
const std::optional< const <a class="el" href="../../d7/d2a/classCXXGRAPH_1_1Edge.html">Edge</a>< T > * > </td><td class="memItemRight" valign="bottom"><b>getEdge</b> (unsigned long edgeId) const</td></tr>
<tr class="separator:a4671c249cc900ab644b9142e1deaa534"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ad000477b7a25ea7bfd1edf589133b042"><td class="memItemLeft" align="right" valign="top"><a id="ad000477b7a25ea7bfd1edf589133b042"></a>
const AdjacencyMatrix< T > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#ad000477b7a25ea7bfd1edf589133b042">getAdjMatrix</a> () const</td></tr>
<tr class="memdesc:ad000477b7a25ea7bfd1edf589133b042"><td class="mdescLeft"> </td><td class="mdescRight">This function generate a list of adjacency matrix with every element of the matrix contain the node where is directed the link and the <a class="el" href="../../d7/d2a/classCXXGRAPH_1_1Edge.html">Edge</a> corrispondent to the link. <br /></td></tr>
<tr class="separator:ad000477b7a25ea7bfd1edf589133b042"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a8d655cd624cedf47ee366d8c0ab31921"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="../../dd/d6c/structCXXGRAPH_1_1DijkstraResult__struct.html">DijkstraResult</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a8d655cd624cedf47ee366d8c0ab31921">dijkstra</a> (const <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a>< T > &source, const <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a>< T > &target) const</td></tr>
<tr class="memdesc:a8d655cd624cedf47ee366d8c0ab31921"><td class="mdescLeft"> </td><td class="mdescRight">Function runs the dijkstra algorithm for some source node and target node in the graph and returns the shortest distance of target from the source. <a href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a8d655cd624cedf47ee366d8c0ab31921">More...</a><br /></td></tr>
<tr class="separator:a8d655cd624cedf47ee366d8c0ab31921"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:ae94a68dc57331c26070c3aec035264ef"><td class="memItemLeft" align="right" valign="top">const std::vector< <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a>< T > > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#ae94a68dc57331c26070c3aec035264ef">breadth_first_search</a> (const <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a>< T > &start) const</td></tr>
<tr class="memdesc:ae94a68dc57331c26070c3aec035264ef"><td class="mdescLeft"> </td><td class="mdescRight">Function performs the breadth first search algorithm over the graph. <a href="../../d0/df2/classCXXGRAPH_1_1Graph.html#ae94a68dc57331c26070c3aec035264ef">More...</a><br /></td></tr>
<tr class="separator:ae94a68dc57331c26070c3aec035264ef"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a05d230bd6185b99b624227c4c82b7811"><td class="memItemLeft" align="right" valign="top">const std::vector< <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a>< T > > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a05d230bd6185b99b624227c4c82b7811">depth_first_search</a> (const <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a>< T > &start) const</td></tr>
<tr class="memdesc:a05d230bd6185b99b624227c4c82b7811"><td class="mdescLeft"> </td><td class="mdescRight">Function performs the depth first search algorithm over the graph. <a href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a05d230bd6185b99b624227c4c82b7811">More...</a><br /></td></tr>
<tr class="separator:a05d230bd6185b99b624227c4c82b7811"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a91a818601c0df0e5abfbaf4da5918afa"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a91a818601c0df0e5abfbaf4da5918afa">isCyclicDirectedGraphDFS</a> () const</td></tr>
<tr class="memdesc:a91a818601c0df0e5abfbaf4da5918afa"><td class="mdescLeft"> </td><td class="mdescRight">This function uses DFS to check for cycle in the graph. Pay Attention, this function work only with directed <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">Graph</a>. <a href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a91a818601c0df0e5abfbaf4da5918afa">More...</a><br /></td></tr>
<tr class="separator:a91a818601c0df0e5abfbaf4da5918afa"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a4f76bb7230c1654dd6b1ec24d0291875"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a4f76bb7230c1654dd6b1ec24d0291875">isCyclicDirectedGraphBFS</a> () const</td></tr>
<tr class="memdesc:a4f76bb7230c1654dd6b1ec24d0291875"><td class="mdescLeft"> </td><td class="mdescRight">This function uses BFS to check for cycle in the graph. Pay Attention, this function work only with directed <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">Graph</a>. <a href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a4f76bb7230c1654dd6b1ec24d0291875">More...</a><br /></td></tr>
<tr class="separator:a4f76bb7230c1654dd6b1ec24d0291875"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5c7ddb5c91f3ab7456c8203a740f52c9"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a5c7ddb5c91f3ab7456c8203a740f52c9">isDirectedGraph</a> () const</td></tr>
<tr class="memdesc:a5c7ddb5c91f3ab7456c8203a740f52c9"><td class="mdescLeft"> </td><td class="mdescRight">This function checks if a graph is directed. <a href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a5c7ddb5c91f3ab7456c8203a740f52c9">More...</a><br /></td></tr>
<tr class="separator:a5c7ddb5c91f3ab7456c8203a740f52c9"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a5a1ffeb9ef3b62b38c10bd84b44170a0"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a5a1ffeb9ef3b62b38c10bd84b44170a0">writeToFile</a> (<a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a41742703923f919470b2ca1496b124d6">InputOutputFormat</a> format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const</td></tr>
<tr class="memdesc:a5a1ffeb9ef3b62b38c10bd84b44170a0"><td class="mdescLeft"> </td><td class="mdescRight">This function write the graph in an output file. <a href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a5a1ffeb9ef3b62b38c10bd84b44170a0">More...</a><br /></td></tr>
<tr class="separator:a5a1ffeb9ef3b62b38c10bd84b44170a0"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abd5baeb88c2b588c14383155fff4ec3e"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#abd5baeb88c2b588c14383155fff4ec3e">readFromFile</a> (<a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a41742703923f919470b2ca1496b124d6">InputOutputFormat</a> format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false)</td></tr>
<tr class="memdesc:abd5baeb88c2b588c14383155fff4ec3e"><td class="mdescLeft"> </td><td class="mdescRight">This function write the graph in an output file. <a href="../../d0/df2/classCXXGRAPH_1_1Graph.html#abd5baeb88c2b588c14383155fff4ec3e">More...</a><br /></td></tr>
<tr class="separator:abd5baeb88c2b588c14383155fff4ec3e"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:abb1d335334b510d037729719e8f579b6"><td class="memItemLeft" align="right" valign="top">PartitionMap< T > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#abb1d335334b510d037729719e8f579b6">partitionGraph</a> (<a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a3df0188b5897ee4404982a27cd543485">PartitionAlgorithm</a> algorithm, unsigned int numberOfPartitions) const</td></tr>
<tr class="memdesc:abb1d335334b510d037729719e8f579b6"><td class="mdescLeft"> </td><td class="mdescRight">This function partition a graph in a set of partitions. <a href="../../d0/df2/classCXXGRAPH_1_1Graph.html#abb1d335334b510d037729719e8f579b6">More...</a><br /></td></tr>
<tr class="separator:abb1d335334b510d037729719e8f579b6"><td class="memSeparator" colspan="2"> </td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="friends"></a>
Friends</h2></td></tr>
<tr class="memitem:a8cf06edd83359e8fb9634e9036e0334b"><td class="memItemLeft" align="right" valign="top"><a id="a8cf06edd83359e8fb9634e9036e0334b"></a>
std::ostream & </td><td class="memItemRight" valign="bottom"><b>operator<<</b> (std::ostream &os, const <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">Graph</a>< T > &graph)</td></tr>
<tr class="separator:a8cf06edd83359e8fb9634e9036e0334b"><td class="memSeparator" colspan="2"> </td></tr>
<tr class="memitem:a35626ad6a1edaf1309a82bcdd9ab4ee1"><td class="memItemLeft" align="right" valign="top"><a id="a35626ad6a1edaf1309a82bcdd9ab4ee1"></a>
std::ostream & </td><td class="memItemRight" valign="bottom"><b>operator<<</b> (std::ostream &os, const AdjacencyMatrix< T > &adj)</td></tr>
<tr class="separator:a35626ad6a1edaf1309a82bcdd9ab4ee1"><td class="memSeparator" colspan="2"> </td></tr>
</table>
<h2 class="groupheader">Member Enumeration Documentation</h2>
<a id="af40584c5cd15ce35ad36a736b3429c71"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af40584c5cd15ce35ad36a736b3429c71">◆ </a></span>E_InputOutputFormat</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename T > </div>
<table class="memname">
<tr>
<td class="memname">enum <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#af40584c5cd15ce35ad36a736b3429c71">CXXGRAPH::Graph::E_InputOutputFormat</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Specify the Input/Output format of the <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">Graph</a> for Import/Export functions. </p>
<table class="fieldtable">
<tr><th colspan="2">Enumerator</th></tr><tr><td class="fieldname"><a id="af40584c5cd15ce35ad36a736b3429c71a12e3f194ab31b8c22b5789dda8d4645c"></a>STANDARD_CSV </td><td class="fielddoc"><p>A standard csv format. </p>
</td></tr>
<tr><td class="fieldname"><a id="af40584c5cd15ce35ad36a736b3429c71a28e4461e98949e163fe3ad5982065d76"></a>STANDARD_TSV </td><td class="fielddoc"><p>A standard tsv format. </p>
</td></tr>
</table>
</div>
</div>
<a id="a1549d3208d57a922c72d0885894f1c32"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1549d3208d57a922c72d0885894f1c32">◆ </a></span>E_PartitionAlgorithm</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename T > </div>
<table class="memname">
<tr>
<td class="memname">enum <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a1549d3208d57a922c72d0885894f1c32">CXXGRAPH::Graph::E_PartitionAlgorithm</a></td>
</tr>
</table>
</div><div class="memdoc">
<p>Specify the <a class="el" href="../../d4/d32/classCXXGRAPH_1_1Partition.html">Partition</a> Algorithm. </p>
<table class="fieldtable">
<tr><th colspan="2">Enumerator</th></tr><tr><td class="fieldname"><a id="a1549d3208d57a922c72d0885894f1c32acc15214a985a3049a81a874878ffbabb"></a>GREEDY_VC </td><td class="fielddoc"><p>A Greedy Vertex-Cut Algorithm. </p>
</td></tr>
</table>
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="ae94a68dc57331c26070c3aec035264ef"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae94a68dc57331c26070c3aec035264ef">◆ </a></span>breadth_first_search()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename T > </div>
<table class="memname">
<tr>
<td class="memname">const std::vector< <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a>< T > > <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">CXXGRAPH::Graph</a>< T >::breadth_first_search </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a>< T > & </td>
<td class="paramname"><em>start</em></td><td>)</td>
<td> const</td>
</tr>
</table>
</div><div class="memdoc">
<p>Function performs the breadth first search algorithm over the graph. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">start</td><td><a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a> from where traversing starts </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>a vector of <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a> indicating which <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a> were visited during the search. </dd></dl>
</div>
</div>
<a id="a05d230bd6185b99b624227c4c82b7811"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a05d230bd6185b99b624227c4c82b7811">◆ </a></span>depth_first_search()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename T > </div>
<table class="memname">
<tr>
<td class="memname">const std::vector< <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a>< T > > <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">CXXGRAPH::Graph</a>< T >::depth_first_search </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a>< T > & </td>
<td class="paramname"><em>start</em></td><td>)</td>
<td> const</td>
</tr>
</table>
</div><div class="memdoc">
<p>Function performs the depth first search algorithm over the graph. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">start</td><td><a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a> from where traversing starts </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>a vector of <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a> indicating which <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a> were visited during the search. </dd></dl>
</div>
</div>
<a id="a8d655cd624cedf47ee366d8c0ab31921"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8d655cd624cedf47ee366d8c0ab31921">◆ </a></span>dijkstra()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename T > </div>
<table class="memname">
<tr>
<td class="memname">const <a class="el" href="../../dd/d6c/structCXXGRAPH_1_1DijkstraResult__struct.html">DijkstraResult</a> <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">CXXGRAPH::Graph</a>< T >::dijkstra </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a>< T > & </td>
<td class="paramname"><em>source</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a>< T > & </td>
<td class="paramname"><em>target</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</div><div class="memdoc">
<p>Function runs the dijkstra algorithm for some source node and target node in the graph and returns the shortest distance of target from the source. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">source</td><td>source vertex </td></tr>
<tr><td class="paramname">target</td><td>target vertex</td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>shortest distance if target is reachable from source else ERROR in case if target is not reachable from source or there is error in the computation. </dd></dl>
</div>
</div>
<a id="a4f76bb7230c1654dd6b1ec24d0291875"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4f76bb7230c1654dd6b1ec24d0291875">◆ </a></span>isCyclicDirectedGraphBFS()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename T > </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">CXXGRAPH::Graph</a>< T >::isCyclicDirectedGraphBFS</td>
</tr>
</table>
</div><div class="memdoc">
<p>This function uses BFS to check for cycle in the graph. Pay Attention, this function work only with directed <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">Graph</a>. </p>
<dl class="section return"><dt>Returns</dt><dd>true if a cycle is detected, else false. ( false is returned also if the graph in indirected) </dd></dl>
</div>
</div>
<a id="a91a818601c0df0e5abfbaf4da5918afa"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a91a818601c0df0e5abfbaf4da5918afa">◆ </a></span>isCyclicDirectedGraphDFS()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename T > </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">CXXGRAPH::Graph</a>< T >::isCyclicDirectedGraphDFS</td>
</tr>
</table>
</div><div class="memdoc">
<p>This function uses DFS to check for cycle in the graph. Pay Attention, this function work only with directed <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">Graph</a>. </p>
<dl class="section return"><dt>Returns</dt><dd>true if a cycle is detected, else false. ( false is returned also if the graph in indirected) </dd></dl>
</div>
</div>
<a id="a5c7ddb5c91f3ab7456c8203a740f52c9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5c7ddb5c91f3ab7456c8203a740f52c9">◆ </a></span>isDirectedGraph()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename T > </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">CXXGRAPH::Graph</a>< T >::isDirectedGraph</td>
</tr>
</table>
</div><div class="memdoc">
<p>This function checks if a graph is directed. </p>
<dl class="section return"><dt>Returns</dt><dd>true if the graph is directed, else false. </dd></dl>
</div>
</div>
<a id="abb1d335334b510d037729719e8f579b6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abb1d335334b510d037729719e8f579b6">◆ </a></span>partitionGraph()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename T > </div>
<table class="memname">
<tr>
<td class="memname">PartitionMap< T > <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">CXXGRAPH::Graph</a>< T >::partitionGraph </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a3df0188b5897ee4404982a27cd543485">PartitionAlgorithm</a> </td>
<td class="paramname"><em>algorithm</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned int </td>
<td class="paramname"><em>numberOfPartitions</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</div><div class="memdoc">
<p>This function partition a graph in a set of partitions. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">algorithm</td><td>The partition algorithm </td></tr>
<tr><td class="paramname">numberOfPartition</td><td>The number of partitions </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The partiton Map of the partitioned graph </dd></dl>
</div>
</div>
<a id="abd5baeb88c2b588c14383155fff4ec3e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abd5baeb88c2b588c14383155fff4ec3e">◆ </a></span>readFromFile()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename T > </div>
<table class="memname">
<tr>
<td class="memname">int <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">CXXGRAPH::Graph</a>< T >::readFromFile </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a41742703923f919470b2ca1496b124d6">InputOutputFormat</a> </td>
<td class="paramname"><em>format</em> = <code>InputOutputFormat::STANDARD_CSV</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const std::string & </td>
<td class="paramname"><em>workingDir</em> = <code>"."</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const std::string & </td>
<td class="paramname"><em>OFileName</em> = <code>"graph"</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"><em>compress</em> = <code>false</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"><em>readNodeFeat</em> = <code>false</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"><em>readEdgeWeight</em> = <code>false</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>This function write the graph in an output file. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">format</td><td>The Input format of the file </td></tr>
<tr><td class="paramname">workingDir</td><td>The path to the directory in which is placed the Input file </td></tr>
<tr><td class="paramname">OFileName</td><td>The Input File Name ( ) </td></tr>
<tr><td class="paramname">compress</td><td>Indicates if the Input is compressed </td></tr>
<tr><td class="paramname">writeNodeFeat</td><td>Indicates if import also <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a> Features </td></tr>
<tr><td class="paramname">writeEdgeWeight</td><td>Indicates if import also <a class="el" href="../../d7/d2a/classCXXGRAPH_1_1Edge.html">Edge</a> Weights </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>0 if all OK, else return a negative value </dd></dl>
</div>
</div>
<a id="a5a1ffeb9ef3b62b38c10bd84b44170a0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5a1ffeb9ef3b62b38c10bd84b44170a0">◆ </a></span>writeToFile()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template<typename T > </div>
<table class="memname">
<tr>
<td class="memname">int <a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html">CXXGRAPH::Graph</a>< T >::writeToFile </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d0/df2/classCXXGRAPH_1_1Graph.html#a41742703923f919470b2ca1496b124d6">InputOutputFormat</a> </td>
<td class="paramname"><em>format</em> = <code>InputOutputFormat::STANDARD_CSV</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const std::string & </td>
<td class="paramname"><em>workingDir</em> = <code>"."</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const std::string & </td>
<td class="paramname"><em>OFileName</em> = <code>"graph"</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"><em>compress</em> = <code>false</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"><em>writeNodeFeat</em> = <code>false</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"><em>writeEdgeWeight</em> = <code>false</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td> const</td>
</tr>
</table>
</div><div class="memdoc">
<p>This function write the graph in an output file. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">format</td><td>The Output format of the file </td></tr>
<tr><td class="paramname">workingDir</td><td>The path to the directory in which will be placed the output file </td></tr>
<tr><td class="paramname">OFileName</td><td>The Output File Name ( ) </td></tr>
<tr><td class="paramname">compress</td><td>Indicates if the output will be compressed </td></tr>
<tr><td class="paramname">writeNodeFeat</td><td>Indicates if export also <a class="el" href="../../d3/dd2/classCXXGRAPH_1_1Node.html">Node</a> Features </td></tr>
<tr><td class="paramname">writeEdgeWeight</td><td>Indicates if export also <a class="el" href="../../d7/d2a/classCXXGRAPH_1_1Edge.html">Edge</a> Weights </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>0 if all OK, else return a negative value </dd></dl>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>/github/workspace/include/<a class="el" href="../../d9/d69/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.9.1
</small></address>
</body>
</html>