From 3192e2fa8640ecdafcb93cdf904f06f7d17dd23f Mon Sep 17 00:00:00 2001 From: ZigRazor Date: Thu, 9 Sep 2021 11:37:32 +0200 Subject: [PATCH 1/2] Documentation Update (#52) * Updated Doxygen Documentation * [CodeFactor] Apply fixes to commit 0527010 Co-authored-by: codefactor-io --- docs/html/annotated.html | 45 +- docs/html/classes.html | 18 +- ...rdinatedPartitionState__inherit__graph.map | 4 + ...rdinatedPartitionState__inherit__graph.md5 | 1 + ...rdinatedPartitionState__inherit__graph.png | Bin 0 -> 7372 bytes ...ITIONING_1_1CoordinatedPartitionState.html | 149 + docs/html/d0/df2/classCXXGRAPH_1_1Graph.html | 106 +- ...PH_1_1PARTITIONING_1_1Globals-members.html | 93 + ...classCXXGRAPH_1_1PARTITIONING_1_1HDRF.html | 115 + .../UndirectedWeightedEdge_8hpp_source.html | 197 + docs/html/d2/d3f/classCXXGRAPH_1_1Reader.html | 4 +- .../d2/d40/PartitioningStats_8hpp_source.html | 151 + .../classCXXGRAPH_1_1Graph__TS-members.html | 26 +- docs/html/d2/de9/ThreadSafe_8hpp_source.html | 132 + docs/html/d2/df2/HDRF_8hpp_source.html | 291 ++ docs/html/d3/d4d/Typedef_8hpp_source.html | 170 + docs/html/d3/d6b/Record_8hpp_source.html | 125 + docs/html/d3/d91/Graph__TS_8hpp_source.html | 340 ++ docs/html/d3/dd2/classCXXGRAPH_1_1Node.html | 2 +- ...assCXXGRAPH_1_1PARTITIONING_1_1Record.html | 124 + docs/html/d4/d1e/ConstValue_8hpp_source.html | 113 + .../d5/d2e/classCXXGRAPH_1_1Runnable.html | 94 + .../d36/PartitionAlgorithm_8hpp_source.html | 120 + docs/html/d5/d64/Globals_8hpp_source.html | 147 + docs/html/d5/d80/CXXGraph_8hpp_source.html | 107 + .../structCXXGRAPH_1_1DialResult__struct.html | 4 +- .../d5/db2/UndirectedEdge_8hpp_source.html | 188 + ...PARTITIONING_1_1Partition__coll__graph.map | 4 + ...PARTITIONING_1_1Partition__coll__graph.md5 | 1 + ...PARTITIONING_1_1Partition__coll__graph.png | Bin 0 -> 6031 bytes .../html/d6/d85/DirectedEdge_8hpp_source.html | 189 + .../d6/d85/PartitionStrategy_8hpp_source.html | 125 + ..._1_1PARTITIONING_1_1PartitionerThread.html | 104 + ...assCXXGRAPH_1_1UndirectedWeightedEdge.html | 5 +- docs/html/d7/d2a/classCXXGRAPH_1_1Edge.html | 2 +- ..._1_1PARTITIONING_1_1Partition-members.html | 111 + .../d7/d59/CoordinatedRecord_8hpp_source.html | 210 + ...ITIONING_1_1PartitioningStats-members.html | 98 + docs/html/d7/dc6/Node_8hpp_source.html | 175 + docs/html/d7/dde/classCXXGRAPH_1_1Writer.html | 4 +- docs/html/d7/de1/ConstString_8hpp_source.html | 115 + docs/html/d8/d2b/Runnable_8hpp_source.html | 116 + ..._1PARTITIONING_1_1Partitioner-members.html | 87 + ...TITIONING_1_1Partition__inherit__graph.map | 4 + ...TITIONING_1_1Partition__inherit__graph.md5 | 1 + ...TITIONING_1_1Partition__inherit__graph.png | Bin 0 -> 6031 bytes ...XGRAPH_1_1PARTITIONING_1_1Partitioner.html | 97 + docs/html/d8/d91/Partitioner_8hpp_source.html | 190 + ...NING_1_1CoordinatedRecord__coll__graph.map | 4 + ...NING_1_1CoordinatedRecord__coll__graph.md5 | 1 + ...NING_1_1CoordinatedRecord__coll__graph.png | Bin 0 -> 6846 bytes ...H_1_1PARTITIONING_1_1HDRF__coll__graph.map | 4 + ...H_1_1PARTITIONING_1_1HDRF__coll__graph.md5 | 1 + ...H_1_1PARTITIONING_1_1HDRF__coll__graph.png | Bin 0 -> 6630 bytes .../d9/d2f/classCXXGRAPH_1_1ThreadSafe.html | 2 +- docs/html/d9/d69/Graph_8hpp_source.html | 3733 ++++++----------- ...ITIONING_1_1PartitionerThread-members.html | 88 + .../da/d0e/PartitionerThread_8hpp_source.html | 160 + ...NING_1_1PartitionState__inherit__graph.map | 4 + ...NING_1_1PartitionState__inherit__graph.md5 | 1 + ...NING_1_1PartitionState__inherit__graph.png | Bin 0 -> 7351 bytes ...classCXXGRAPH_1_1DirectedWeightedEdge.html | 2 +- ...ITIONING_1_1CoordinatedRecord-members.html | 96 + ..._1_1PARTITIONING_1_1PartitioningStats.html | 137 + .../da/da5/classCXXGRAPH_1_1Graph__TS.html | 85 +- ...CoordinatedPartitionState__coll__graph.map | 4 + ...CoordinatedPartitionState__coll__graph.md5 | 1 + ...CoordinatedPartitionState__coll__graph.png | Bin 0 -> 7372 bytes .../dea/DirectedWeightedEdge_8hpp_source.html | 196 + ...ITIONING_1_1PartitionStrategy-members.html | 85 + ...PARTITIONING_1_1Record__inherit__graph.map | 4 + ...PARTITIONING_1_1Record__inherit__graph.md5 | 1 + ...PARTITIONING_1_1Record__inherit__graph.png | Bin 0 -> 6808 bytes .../db/d54/classCXXGRAPH_1_1Weighted.html | 2 +- ...ssCXXGRAPH_1_1PARTITIONING_1_1Globals.html | 119 + docs/html/dc/d4d/Partition_8hpp_source.html | 348 ++ .../dc/d50/PartitionState_8hpp_source.html | 130 + ...classCXXGRAPH_1_1Graph__inherit__graph.map | 6 +- ...classCXXGRAPH_1_1Graph__inherit__graph.md5 | 2 +- ...classCXXGRAPH_1_1Graph__inherit__graph.png | Bin 7217 -> 9738 bytes docs/html/dc/d91/Edge_8hpp_source.html | 201 + ...GRAPH_1_1PARTITIONING_1_1HDRF-members.html | 87 + ...uctCXXGRAPH_1_1DijkstraResult__struct.html | 4 +- ..._1_1PARTITIONING_1_1CoordinatedRecord.html | 143 + ...ARTITIONING_1_1PartitionState-members.html | 93 + ...CXXGRAPH_1_1PARTITIONING_1_1Partition.html | 229 + ..._1_1CoordinatedPartitionState-members.html | 98 + .../d77/classCXXGRAPH_1_1Graph-members.html | 23 +- ...G_1_1PartitionStrategy__inherit__graph.map | 4 + ...G_1_1PartitionStrategy__inherit__graph.md5 | 1 + ...G_1_1PartitionStrategy__inherit__graph.png | Bin 0 -> 6592 bytes .../classCXXGRAPH_1_1Runnable-members.html | 85 + ...G_1_1CoordinatedRecord__inherit__graph.map | 4 + ...G_1_1CoordinatedRecord__inherit__graph.md5 | 1 + ...G_1_1CoordinatedRecord__inherit__graph.png | Bin 0 -> 6846 bytes docs/html/de/dac/Writer_8hpp_source.html | 123 + ...APH_1_1PARTITIONING_1_1Record-members.html | 92 + ...CoordinatedPartitionState_8hpp_source.html | 274 ++ ..._1_1PARTITIONING_1_1PartitionStrategy.html | 103 + .../de/df5/classCXXGRAPH_1_1DirectedEdge.html | 2 +- docs/html/df/d03/Reader_8hpp_source.html | 117 + ..._1PARTITIONING_1_1HDRF__inherit__graph.map | 4 + ..._1PARTITIONING_1_1HDRF__inherit__graph.md5 | 1 + ..._1PARTITIONING_1_1HDRF__inherit__graph.png | Bin 0 -> 6630 bytes ...APH_1_1PARTITIONING_1_1PartitionState.html | 127 + .../d71/classCXXGRAPH_1_1UndirectedEdge.html | 5 +- docs/html/df/dd3/Weighted_8hpp_source.html | 149 + .../dir_5a1c299fe071d2684abbfdc4f5a71058.html | 81 + .../dir_664b94fe24dd8b5b31bd73b721ea4656.html | 81 + .../dir_701c8f06b1c05dfef7c59ec059aa05bd.html | 81 + .../dir_b647303d7dac632cf2e2685370b563a8.html | 81 + .../dir_c632fc99025ef8bfa3e097f773c00de6.html | 85 + .../dir_d192150ed164ec0bf3db1023d7b06f0a.html | 81 + .../dir_d44c64559bbebec7f509842c48db8b23.html | 4 + docs/html/files.html | 38 +- docs/html/functions.html | 31 +- docs/html/functions_func.html | 12 +- docs/html/hierarchy.html | 34 +- docs/html/inherit_graph_10.map | 4 + docs/html/inherit_graph_10.md5 | 1 + docs/html/inherit_graph_10.png | Bin 0 -> 4536 bytes docs/html/inherit_graph_11.map | 4 + docs/html/inherit_graph_11.md5 | 1 + docs/html/inherit_graph_11.png | Bin 0 -> 4126 bytes docs/html/inherit_graph_12.map | 3 + docs/html/inherit_graph_12.md5 | 1 + docs/html/inherit_graph_12.png | Bin 0 -> 2151 bytes docs/html/inherit_graph_13.map | 3 + docs/html/inherit_graph_13.md5 | 1 + docs/html/inherit_graph_13.png | Bin 0 -> 2200 bytes docs/html/inherit_graph_14.map | 3 + docs/html/inherit_graph_14.md5 | 1 + docs/html/inherit_graph_14.png | Bin 0 -> 2246 bytes docs/html/inherit_graph_2.md5 | 2 +- docs/html/inherit_graph_3.map | 6 +- docs/html/inherit_graph_3.md5 | 2 +- docs/html/inherit_graph_3.png | Bin 8261 -> 8631 bytes docs/html/inherit_graph_5.map | 2 +- docs/html/inherit_graph_5.md5 | 2 +- docs/html/inherit_graph_5.png | Bin 2991 -> 2771 bytes docs/html/inherit_graph_6.map | 2 +- docs/html/inherit_graph_6.md5 | 2 +- docs/html/inherit_graph_6.png | Bin 2151 -> 3042 bytes docs/html/inherit_graph_7.map | 2 +- docs/html/inherit_graph_7.md5 | 2 +- docs/html/inherit_graph_7.png | Bin 2246 -> 3298 bytes docs/html/inherit_graph_8.map | 3 + docs/html/inherit_graph_8.md5 | 1 + docs/html/inherit_graph_8.png | Bin 0 -> 3255 bytes docs/html/inherit_graph_9.map | 4 + docs/html/inherit_graph_9.md5 | 1 + docs/html/inherit_graph_9.png | Bin 0 -> 4815 bytes docs/html/inherits.html | 54 +- docs/html/menudata.js | 5 +- docs/html/search/all_2.js | 9 +- docs/html/search/all_3.js | 10 +- docs/html/search/all_4.js | 9 +- docs/html/search/all_5.js | 11 +- docs/html/search/all_6.js | 2 +- docs/html/search/all_7.js | 6 +- docs/html/search/all_8.js | 4 +- docs/html/search/all_9.js | 11 +- docs/html/search/all_a.js | 6 +- docs/html/search/all_b.js | 4 +- docs/html/search/all_c.js | 5 +- docs/html/search/all_d.html | 37 + docs/html/search/all_d.js | 5 + docs/html/search/all_e.html | 37 + docs/html/search/all_e.js | 7 + docs/html/search/classes_0.js | 6 +- docs/html/search/classes_1.js | 5 +- docs/html/search/classes_2.js | 3 +- docs/html/search/classes_3.js | 4 +- docs/html/search/classes_4.js | 3 +- docs/html/search/classes_5.js | 2 +- docs/html/search/classes_6.js | 7 +- docs/html/search/classes_7.js | 5 +- docs/html/search/classes_8.js | 3 +- docs/html/search/classes_9.html | 37 + docs/html/search/classes_9.js | 5 + docs/html/search/classes_a.html | 37 + docs/html/search/classes_a.js | 5 + docs/html/search/functions_0.js | 2 +- docs/html/search/functions_1.js | 2 +- docs/html/search/functions_2.js | 6 +- docs/html/search/functions_3.js | 10 +- docs/html/search/functions_4.js | 6 +- docs/html/search/functions_5.js | 2 +- docs/html/search/functions_6.js | 4 +- docs/html/search/functions_7.js | 4 +- docs/html/search/functions_8.js | 4 +- docs/html/search/searchdata.js | 16 +- docs/latex/annotated.tex | 14 +- ...rdinatedPartitionState__inherit__graph.md5 | 1 + ...rdinatedPartitionState__inherit__graph.pdf | Bin 0 -> 6958 bytes ...TITIONING_1_1CoordinatedPartitionState.tex | 66 + docs/latex/d0/df2/classCXXGRAPH_1_1Graph.tex | 92 +- .../classCXXGRAPH_1_1PARTITIONING_1_1HDRF.tex | 36 + docs/latex/d2/d3f/classCXXGRAPH_1_1Reader.tex | 4 +- docs/latex/d3/dd2/classCXXGRAPH_1_1Node.tex | 2 +- ...lassCXXGRAPH_1_1PARTITIONING_1_1Record.tex | 44 + .../d5/d2e/classCXXGRAPH_1_1Runnable.tex | 13 + .../structCXXGRAPH_1_1DialResult__struct.tex | 4 +- ...PARTITIONING_1_1Partition__coll__graph.md5 | 1 + ...PARTITIONING_1_1Partition__coll__graph.pdf | Bin 0 -> 6620 bytes ...H_1_1PARTITIONING_1_1PartitionerThread.tex | 22 + ...lassCXXGRAPH_1_1UndirectedWeightedEdge.tex | 5 +- docs/latex/d7/d2a/classCXXGRAPH_1_1Edge.tex | 2 +- docs/latex/d7/dde/classCXXGRAPH_1_1Writer.tex | 4 +- ...TITIONING_1_1Partition__inherit__graph.md5 | 1 + ...TITIONING_1_1Partition__inherit__graph.pdf | Bin 0 -> 6620 bytes ...XXGRAPH_1_1PARTITIONING_1_1Partitioner.tex | 16 + ...NING_1_1CoordinatedRecord__coll__graph.md5 | 1 + ...NING_1_1CoordinatedRecord__coll__graph.pdf | Bin 0 -> 6816 bytes ...H_1_1PARTITIONING_1_1HDRF__coll__graph.md5 | 1 + ...H_1_1PARTITIONING_1_1HDRF__coll__graph.pdf | Bin 0 -> 7302 bytes .../d9/d2f/classCXXGRAPH_1_1ThreadSafe.tex | 2 +- ...NING_1_1PartitionState__inherit__graph.md5 | 1 + ...NING_1_1PartitionState__inherit__graph.pdf | Bin 0 -> 6964 bytes .../classCXXGRAPH_1_1DirectedWeightedEdge.tex | 2 +- ...H_1_1PARTITIONING_1_1PartitioningStats.tex | 55 + .../da/da5/classCXXGRAPH_1_1Graph__TS.tex | 34 +- ...CoordinatedPartitionState__coll__graph.md5 | 1 + ...CoordinatedPartitionState__coll__graph.pdf | Bin 0 -> 6958 bytes ...PARTITIONING_1_1Record__inherit__graph.md5 | 1 + ...PARTITIONING_1_1Record__inherit__graph.pdf | Bin 0 -> 6810 bytes .../db/d54/classCXXGRAPH_1_1Weighted.tex | 2 +- ...assCXXGRAPH_1_1PARTITIONING_1_1Globals.tex | 37 + ...classCXXGRAPH_1_1Graph__inherit__graph.md5 | 2 +- ...classCXXGRAPH_1_1Graph__inherit__graph.pdf | Bin 7054 -> 7385 bytes ...ructCXXGRAPH_1_1DijkstraResult__struct.tex | 4 +- ...H_1_1PARTITIONING_1_1CoordinatedRecord.tex | 63 + ...sCXXGRAPH_1_1PARTITIONING_1_1Partition.tex | 77 + ...G_1_1PartitionStrategy__inherit__graph.md5 | 1 + ...G_1_1PartitionStrategy__inherit__graph.pdf | Bin 0 -> 7293 bytes ...G_1_1CoordinatedRecord__inherit__graph.md5 | 1 + ...G_1_1CoordinatedRecord__inherit__graph.pdf | Bin 0 -> 6816 bytes ...H_1_1PARTITIONING_1_1PartitionStrategy.tex | 23 + .../de/df5/classCXXGRAPH_1_1DirectedEdge.tex | 2 +- ..._1PARTITIONING_1_1HDRF__inherit__graph.md5 | 1 + ..._1PARTITIONING_1_1HDRF__inherit__graph.pdf | Bin 0 -> 7302 bytes ...RAPH_1_1PARTITIONING_1_1PartitionState.tex | 47 + .../d71/classCXXGRAPH_1_1UndirectedEdge.tex | 5 +- docs/latex/hierarchy.tex | 20 +- docs/latex/refman.tex | 14 +- 245 files changed, 10629 insertions(+), 2847 deletions(-) create mode 100644 docs/html/d0/d69/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__inherit__graph.map create mode 100644 docs/html/d0/d69/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__inherit__graph.md5 create mode 100644 docs/html/d0/d69/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__inherit__graph.png create mode 100644 docs/html/d0/d70/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState.html create mode 100644 docs/html/d1/d0d/classCXXGRAPH_1_1PARTITIONING_1_1Globals-members.html create mode 100644 docs/html/d1/d63/classCXXGRAPH_1_1PARTITIONING_1_1HDRF.html create mode 100644 docs/html/d1/db4/UndirectedWeightedEdge_8hpp_source.html create mode 100644 docs/html/d2/d40/PartitioningStats_8hpp_source.html create mode 100644 docs/html/d2/de9/ThreadSafe_8hpp_source.html create mode 100644 docs/html/d2/df2/HDRF_8hpp_source.html create mode 100644 docs/html/d3/d4d/Typedef_8hpp_source.html create mode 100644 docs/html/d3/d6b/Record_8hpp_source.html create mode 100644 docs/html/d3/d91/Graph__TS_8hpp_source.html create mode 100644 docs/html/d3/de1/classCXXGRAPH_1_1PARTITIONING_1_1Record.html create mode 100644 docs/html/d4/d1e/ConstValue_8hpp_source.html create mode 100644 docs/html/d5/d2e/classCXXGRAPH_1_1Runnable.html create mode 100644 docs/html/d5/d36/PartitionAlgorithm_8hpp_source.html create mode 100644 docs/html/d5/d64/Globals_8hpp_source.html create mode 100644 docs/html/d5/d80/CXXGraph_8hpp_source.html create mode 100644 docs/html/d5/db2/UndirectedEdge_8hpp_source.html create mode 100644 docs/html/d6/d2c/classCXXGRAPH_1_1PARTITIONING_1_1Partition__coll__graph.map create mode 100644 docs/html/d6/d2c/classCXXGRAPH_1_1PARTITIONING_1_1Partition__coll__graph.md5 create mode 100644 docs/html/d6/d2c/classCXXGRAPH_1_1PARTITIONING_1_1Partition__coll__graph.png create mode 100644 docs/html/d6/d85/DirectedEdge_8hpp_source.html create mode 100644 docs/html/d6/d85/PartitionStrategy_8hpp_source.html create mode 100644 docs/html/d7/d1b/classCXXGRAPH_1_1PARTITIONING_1_1PartitionerThread.html create mode 100644 docs/html/d7/d41/classCXXGRAPH_1_1PARTITIONING_1_1Partition-members.html create mode 100644 docs/html/d7/d59/CoordinatedRecord_8hpp_source.html create mode 100644 docs/html/d7/d70/classCXXGRAPH_1_1PARTITIONING_1_1PartitioningStats-members.html create mode 100644 docs/html/d7/dc6/Node_8hpp_source.html create mode 100644 docs/html/d7/de1/ConstString_8hpp_source.html create mode 100644 docs/html/d8/d2b/Runnable_8hpp_source.html create mode 100644 docs/html/d8/d4b/classCXXGRAPH_1_1PARTITIONING_1_1Partitioner-members.html create mode 100644 docs/html/d8/d63/classCXXGRAPH_1_1PARTITIONING_1_1Partition__inherit__graph.map create mode 100644 docs/html/d8/d63/classCXXGRAPH_1_1PARTITIONING_1_1Partition__inherit__graph.md5 create mode 100644 docs/html/d8/d63/classCXXGRAPH_1_1PARTITIONING_1_1Partition__inherit__graph.png create mode 100644 docs/html/d8/d6d/classCXXGRAPH_1_1PARTITIONING_1_1Partitioner.html create mode 100644 docs/html/d8/d91/Partitioner_8hpp_source.html create mode 100644 docs/html/d8/dad/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__coll__graph.map create mode 100644 docs/html/d8/dad/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__coll__graph.md5 create mode 100644 docs/html/d8/dad/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__coll__graph.png create mode 100644 docs/html/d9/d11/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__coll__graph.map create mode 100644 docs/html/d9/d11/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__coll__graph.md5 create mode 100644 docs/html/d9/d11/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__coll__graph.png create mode 100644 docs/html/d9/da1/classCXXGRAPH_1_1PARTITIONING_1_1PartitionerThread-members.html create mode 100644 docs/html/da/d0e/PartitionerThread_8hpp_source.html create mode 100644 docs/html/da/d21/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState__inherit__graph.map create mode 100644 docs/html/da/d21/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState__inherit__graph.md5 create mode 100644 docs/html/da/d21/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState__inherit__graph.png create mode 100644 docs/html/da/d5d/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord-members.html create mode 100644 docs/html/da/d71/classCXXGRAPH_1_1PARTITIONING_1_1PartitioningStats.html create mode 100644 docs/html/da/de0/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__coll__graph.map create mode 100644 docs/html/da/de0/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__coll__graph.md5 create mode 100644 docs/html/da/de0/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__coll__graph.png create mode 100644 docs/html/da/dea/DirectedWeightedEdge_8hpp_source.html create mode 100644 docs/html/db/d24/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy-members.html create mode 100644 docs/html/db/d3e/classCXXGRAPH_1_1PARTITIONING_1_1Record__inherit__graph.map create mode 100644 docs/html/db/d3e/classCXXGRAPH_1_1PARTITIONING_1_1Record__inherit__graph.md5 create mode 100644 docs/html/db/d3e/classCXXGRAPH_1_1PARTITIONING_1_1Record__inherit__graph.png create mode 100644 docs/html/db/d5b/classCXXGRAPH_1_1PARTITIONING_1_1Globals.html create mode 100644 docs/html/dc/d4d/Partition_8hpp_source.html create mode 100644 docs/html/dc/d50/PartitionState_8hpp_source.html create mode 100644 docs/html/dc/d91/Edge_8hpp_source.html create mode 100644 docs/html/dd/d69/classCXXGRAPH_1_1PARTITIONING_1_1HDRF-members.html create mode 100644 docs/html/de/d1d/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord.html create mode 100644 docs/html/de/d42/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState-members.html create mode 100644 docs/html/de/d59/classCXXGRAPH_1_1PARTITIONING_1_1Partition.html create mode 100644 docs/html/de/d6f/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState-members.html create mode 100644 docs/html/de/d82/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy__inherit__graph.map create mode 100644 docs/html/de/d82/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy__inherit__graph.md5 create mode 100644 docs/html/de/d82/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy__inherit__graph.png create mode 100644 docs/html/de/d82/classCXXGRAPH_1_1Runnable-members.html create mode 100644 docs/html/de/d93/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__inherit__graph.map create mode 100644 docs/html/de/d93/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__inherit__graph.md5 create mode 100644 docs/html/de/d93/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__inherit__graph.png create mode 100644 docs/html/de/dac/Writer_8hpp_source.html create mode 100644 docs/html/de/ddc/classCXXGRAPH_1_1PARTITIONING_1_1Record-members.html create mode 100644 docs/html/de/de1/CoordinatedPartitionState_8hpp_source.html create mode 100644 docs/html/de/deb/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy.html create mode 100644 docs/html/df/d03/Reader_8hpp_source.html create mode 100644 docs/html/df/d27/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__inherit__graph.map create mode 100644 docs/html/df/d27/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__inherit__graph.md5 create mode 100644 docs/html/df/d27/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__inherit__graph.png create mode 100644 docs/html/df/d6f/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState.html create mode 100644 docs/html/df/dd3/Weighted_8hpp_source.html create mode 100644 docs/html/dir_5a1c299fe071d2684abbfdc4f5a71058.html create mode 100644 docs/html/dir_664b94fe24dd8b5b31bd73b721ea4656.html create mode 100644 docs/html/dir_701c8f06b1c05dfef7c59ec059aa05bd.html create mode 100644 docs/html/dir_b647303d7dac632cf2e2685370b563a8.html create mode 100644 docs/html/dir_c632fc99025ef8bfa3e097f773c00de6.html create mode 100644 docs/html/dir_d192150ed164ec0bf3db1023d7b06f0a.html create mode 100644 docs/html/inherit_graph_10.map create mode 100644 docs/html/inherit_graph_10.md5 create mode 100644 docs/html/inherit_graph_10.png create mode 100644 docs/html/inherit_graph_11.map create mode 100644 docs/html/inherit_graph_11.md5 create mode 100644 docs/html/inherit_graph_11.png create mode 100644 docs/html/inherit_graph_12.map create mode 100644 docs/html/inherit_graph_12.md5 create mode 100644 docs/html/inherit_graph_12.png create mode 100644 docs/html/inherit_graph_13.map create mode 100644 docs/html/inherit_graph_13.md5 create mode 100644 docs/html/inherit_graph_13.png create mode 100644 docs/html/inherit_graph_14.map create mode 100644 docs/html/inherit_graph_14.md5 create mode 100644 docs/html/inherit_graph_14.png create mode 100644 docs/html/inherit_graph_8.map create mode 100644 docs/html/inherit_graph_8.md5 create mode 100644 docs/html/inherit_graph_8.png create mode 100644 docs/html/inherit_graph_9.map create mode 100644 docs/html/inherit_graph_9.md5 create mode 100644 docs/html/inherit_graph_9.png create mode 100644 docs/html/search/all_d.html create mode 100644 docs/html/search/all_d.js create mode 100644 docs/html/search/all_e.html create mode 100644 docs/html/search/all_e.js create mode 100644 docs/html/search/classes_9.html create mode 100644 docs/html/search/classes_9.js create mode 100644 docs/html/search/classes_a.html create mode 100644 docs/html/search/classes_a.js create mode 100644 docs/latex/d0/d69/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__inherit__graph.md5 create mode 100644 docs/latex/d0/d69/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__inherit__graph.pdf create mode 100644 docs/latex/d0/d70/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState.tex create mode 100644 docs/latex/d1/d63/classCXXGRAPH_1_1PARTITIONING_1_1HDRF.tex create mode 100644 docs/latex/d3/de1/classCXXGRAPH_1_1PARTITIONING_1_1Record.tex create mode 100644 docs/latex/d5/d2e/classCXXGRAPH_1_1Runnable.tex create mode 100644 docs/latex/d6/d2c/classCXXGRAPH_1_1PARTITIONING_1_1Partition__coll__graph.md5 create mode 100644 docs/latex/d6/d2c/classCXXGRAPH_1_1PARTITIONING_1_1Partition__coll__graph.pdf create mode 100644 docs/latex/d7/d1b/classCXXGRAPH_1_1PARTITIONING_1_1PartitionerThread.tex create mode 100644 docs/latex/d8/d63/classCXXGRAPH_1_1PARTITIONING_1_1Partition__inherit__graph.md5 create mode 100644 docs/latex/d8/d63/classCXXGRAPH_1_1PARTITIONING_1_1Partition__inherit__graph.pdf create mode 100644 docs/latex/d8/d6d/classCXXGRAPH_1_1PARTITIONING_1_1Partitioner.tex create mode 100644 docs/latex/d8/dad/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__coll__graph.md5 create mode 100644 docs/latex/d8/dad/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__coll__graph.pdf create mode 100644 docs/latex/d9/d11/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__coll__graph.md5 create mode 100644 docs/latex/d9/d11/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__coll__graph.pdf create mode 100644 docs/latex/da/d21/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState__inherit__graph.md5 create mode 100644 docs/latex/da/d21/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState__inherit__graph.pdf create mode 100644 docs/latex/da/d71/classCXXGRAPH_1_1PARTITIONING_1_1PartitioningStats.tex create mode 100644 docs/latex/da/de0/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__coll__graph.md5 create mode 100644 docs/latex/da/de0/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__coll__graph.pdf create mode 100644 docs/latex/db/d3e/classCXXGRAPH_1_1PARTITIONING_1_1Record__inherit__graph.md5 create mode 100644 docs/latex/db/d3e/classCXXGRAPH_1_1PARTITIONING_1_1Record__inherit__graph.pdf create mode 100644 docs/latex/db/d5b/classCXXGRAPH_1_1PARTITIONING_1_1Globals.tex create mode 100644 docs/latex/de/d1d/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord.tex create mode 100644 docs/latex/de/d59/classCXXGRAPH_1_1PARTITIONING_1_1Partition.tex create mode 100644 docs/latex/de/d82/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy__inherit__graph.md5 create mode 100644 docs/latex/de/d82/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy__inherit__graph.pdf create mode 100644 docs/latex/de/d93/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__inherit__graph.md5 create mode 100644 docs/latex/de/d93/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__inherit__graph.pdf create mode 100644 docs/latex/de/deb/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy.tex create mode 100644 docs/latex/df/d27/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__inherit__graph.md5 create mode 100644 docs/latex/df/d27/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__inherit__graph.pdf create mode 100644 docs/latex/df/d6f/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState.tex diff --git a/docs/html/annotated.html b/docs/html/annotated.html index d093615e2..ce20977c0 100644 --- a/docs/html/annotated.html +++ b/docs/html/annotated.html @@ -69,24 +69,35 @@
Here are the classes, structs, unions and interfaces with brief descriptions:
-
[detail level 12]
+
[detail level 123]
- - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + +
 ▼NCXXGRAPH
 CNode
 CEdge
 CDirectedEdge
 CUndirectedEdge
 CDirectedWeightedEdge
 CUndirectedWeightedEdge
 CGraphClass that implement the Graph. ( This class is not Thread Safe )
 CPartition
 CWriter
 CReader
 CDijkstraResult_structStruct that contains the information about Dijsktra's Algorithm results
 CDialResult_structStruct that contains the information about Dijsktra's Algorithm results
 CPartitioningStats_structStruct that contains the information about the partitioning statistics
 CWeighted
 CThreadSafe
 CGraph_TSClass that implement the Thread Safe Graph
 ▼NPARTITIONING
 CPartition
 CCoordinatedPartitionState
 CCoordinatedRecord
 CHDRF
 CPartitioner
 CPartitionerThread
 CPartitioningStats
 CPartitionState
 CPartitionStrategy
 CRecord
 CGlobals
 CUndirectedEdge
 CDirectedEdge
 CUndirectedWeightedEdge
 CDirectedWeightedEdge
 CEdge
 CWeighted
 CGraphClass that implement the Graph. ( This class is not Thread Safe )
 CGraph_TSClass that implement the Thread Safe Graph
 CNode
 CReader
 CRunnable
 CThreadSafe
 CDijkstraResult_structStruct that contains the information about Dijsktra's Algorithm results
 CDialResult_structStruct that contains the information about Dijsktra's Algorithm results
 CWriter
diff --git a/docs/html/classes.html b/docs/html/classes.html index 1f67dd646..a83a3f930 100644 --- a/docs/html/classes.html +++ b/docs/html/classes.html @@ -68,26 +68,32 @@
Class Index
-
D | E | G | N | P | R | T | U | W
+
C | D | E | G | H | N | P | R | T | U | W
+
C
+
CoordinatedPartitionState (CXXGRAPH::PARTITIONING)
CoordinatedRecord (CXXGRAPH::PARTITIONING)
+
D
DialResult_struct (CXXGRAPH)
DijkstraResult_struct (CXXGRAPH)
DirectedEdge (CXXGRAPH)
DirectedWeightedEdge (CXXGRAPH)
-
+
E
Edge (CXXGRAPH)
-
+
G
-
Graph (CXXGRAPH)
Graph_TS (CXXGRAPH)
+
Globals (CXXGRAPH::PARTITIONING)
Graph (CXXGRAPH)
Graph_TS (CXXGRAPH)
+
+
H
+
HDRF (CXXGRAPH::PARTITIONING)
N
Node (CXXGRAPH)
P
-
Partition (CXXGRAPH)
PartitioningStats_struct (CXXGRAPH)
+
Partition (CXXGRAPH::PARTITIONING)
Partitioner (CXXGRAPH::PARTITIONING)
PartitionerThread (CXXGRAPH::PARTITIONING)
PartitioningStats (CXXGRAPH::PARTITIONING)
PartitionState (CXXGRAPH::PARTITIONING)
PartitionStrategy (CXXGRAPH::PARTITIONING)
R
-
Reader (CXXGRAPH)
+
Reader (CXXGRAPH)
Record (CXXGRAPH::PARTITIONING)
Runnable (CXXGRAPH)
T
ThreadSafe (CXXGRAPH)
diff --git a/docs/html/d0/d69/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__inherit__graph.map b/docs/html/d0/d69/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__inherit__graph.map new file mode 100644 index 000000000..6be14b3bc --- /dev/null +++ b/docs/html/d0/d69/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/docs/html/d0/d69/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__inherit__graph.md5 b/docs/html/d0/d69/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__inherit__graph.md5 new file mode 100644 index 000000000..519875feb --- /dev/null +++ b/docs/html/d0/d69/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__inherit__graph.md5 @@ -0,0 +1 @@ +7b2859755e79dd0c86a1a9919e3e96cc \ No newline at end of file diff --git a/docs/html/d0/d69/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__inherit__graph.png b/docs/html/d0/d69/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__inherit__graph.png new file mode 100644 index 0000000000000000000000000000000000000000..3d8e9a055d931673ec906c25652c497d1c852db0 GIT binary patch literal 7372 zcmc&(g;y2-wm&LLiiDJa#F0`;KtNKuLzM3Bl({AR!IXNF#6i zyLa97)_s4#8<#K)XM*qE`%@F9tSEI8>kbwIfw(CnEv^FJC*gl2##Q)Q)hgWt-)~tTKq_? zD9_Z}?`pNuOj!x>)u;3^Ig1k z#`VpG`d7Tu`}YOxS56;_iQu6*DSiQl5$g1DV9*uva)?CJZwBXBpDHji6kMSGIDaQ zeIlf9+Ay}k1C@^E67mMBq0#WxFM&0}NS_wJ$n=;)+5L<=t9WXAi$%lCI9;LU7n zYs<^a`;eOpx4BpmzC2kkC^dMd0H}6kxC&*N0jJhk>a(J=V%~q!7 zO<|<;bCiafh9*G6zID{d&kq$Ft72qCYi3xcvA({(s#RTGou8Md^Ti>c-KaN($Nuuq zMG`rRo;yX*=k%bd>4`U6BCBpPx9y$UUYfL-89hW(9D~w86x0<93kwqy6BhX50#51F z6A=-Sl#~=m!3(JRN-4X8#ycb#TGXDNp3c^IOv}uSGn<^4D3v`pQ|}Q(KexWlXZxM& zMo>UCfkjNlN_2r(Q?wSv)?+>fhL^o&{Jgvd#P<_U|6F)UNl77^j&~Pe&9_(nZsVh) zM0j}qHM`dLnV3F(`ZQT#eyfp$jjbd<|Gw{IWyafNWMt0#G&E4?v5pQi2M6{C55lQm z5Qo!!MJz2Y7V9;|yoZCj^g-hO&m&pfe&PB0eZH zBK)PI?p{GKv#?x2xVpMpT3X`VxP~3FMMqC>W@J?Eyr$yk=T{hZMxh|U=$nNmz_mvOVqeoSrKOgPxl5yNoQW8;U%wvcz70KNBPGuV?E)j}>frF?f{>7K>ihS5_wF&?eqB&t zZEnu+hdFF>baIl6kPr#$yq9+pLco6IO{G-ur)Rlp>gvX~Xxa4|y&psG)YHLvY;4<| zRDKj3^q+I73y>VGqd&_{yET}JT_pm`joPvF_4N@={lb?N1O!eed!`4@zm}FlPIjyT z64tl2-b6)pqWARnZmzA(Z|SP24E6RF!K_wQxfmEwKYH{VDmO823y6|^!lAo^wqqIf zeEaR&w@?)lHoZ3T{r&y$@bI*>v|UM6)lq+ce?hN92Z7f=L#LkQjpDzZw|c6k#?8y? zK3=TL#KZ)E3Xl~L5CE{N{n^g6Ok-*ECccHVatPFt&gz5iSVcrj@ zBPA(0Ha_m=?0k=bVf%Yk`0OJr&y(5V;kcNXhrGOBoR(w@yPBJ6SXd&@ly@0uo?q4Y zjvTFvh>(B&JU$~sUtC-qTGrlvJB{CMtVG}MXImJoq7(1-bj>q8Jt2O6udk&P=`F=? zlp~rd?39%H_gDJSZ``&jr3^bOD?Xo7uJxRcA6*u|#+0D` z)YjCz%fv*KzF6s7U0qE|BGuLX!SpQW9v$6}Iyd{SSULeOb!Fuz8Cg)IiHQkm85u(b z>+xb(>aLz1ioR8}nkY&9`&XDZ=NCHyva=V0&~L$rK!YX3#|H)lwYIk2qU3Aal=-N_ zrdQ9qSS6&Sl%*!c$cTnnr2QEek62igIxuJ~0)O>pV^nDL^*jj-O@FQ6f9)LiRPvfM zyrn)ro4s829q1kAy+zgfM~ z$zL!YrY0t-d@iyR81M1KV`iAtx&Tf6>&)ZI6!JLmt`zGV|u!ttSlBHGcV6#@V!Lm8_KwZghw14 zr@zPb6WR3dQc_+VZfYMm+gMt5*`gs#%*^`UalTZ{B_|^zx_#Rqi5 zyETZW|4dg;uNZ1R*K`F<s5)c#?7E(}Bt~sB+Wzk;l&&Wtl#zKHl!NA2;Q&ui5EgcvbI6mG* zBB)_wW3z`jqM@N7WKh&8H4u@J!IXO9TVn`4QlwGV(%dYfsMy!uZaUu*Vqqz-uRmL5 zJ-*zRwz0i!Z*H!xr^h-XUZhjQAuNo_&Fvf*aM)k&oeqnMq-o>{3|?Gb{O` z>eK|ZY=hSkba!=G8NR;kS2msqx9u4~ci4=Gf#Q04gw*6)6uE_@?WI(#(iqR~wmjl^0l9C-4 zXGc?0Qz4Ys)Bhz}TwGnXG&FD+`Z9X;#lxT9SCx=3{T9!(J=1WuoMMlMHm@g)6*4q4 z)AzLTo2?GY*9T;VtgNh?+Yx9gSvfgdTU!s;T9d9=Kv%dn%IB;ag+kTV@=;Sa0hI`P z8^xR~g+2zEH&gRs1yq*BQc7T;sE5Z%1R2ofZf8V9#L@OFIVq{lk6NNjw)(&(19l^0 zV+DEnYP%n`4)ZPQC3@GdU&kaetfcw!mSW$FL{oF}fqJonjl;Px0-hlJiP3^D z`|MdoW#w&=Xjnd%jWM6yc9PiGSWu*1M_Zd48w;;`IC<)?1yX}X2GJ1@LUDXNDk^G) zR2Lxomhid%R{KqqS0aE0EC&c{f}R}QJ-Lb9L;f>JY_y-7qB1`W1yI9~aG?;xLu zG;bTHwde=X%#0Ef5oIZn(V(55SG;cYO{qLESIvC1J~BQ|$d6|^I5FWa9(Q6rG$psO znP6cV^G@JoSYt)hie54Gl`kQ!@T-}+Cus9M@6hMxqqw+k%gIGWxUgpM?07nAP-DcV zo>L%TiuCmKc*fSeXP&U&hG+QwQ4$m5M?BF<_1vE6H%{wYxjFK)R9b|jKm#GuD%Wo^->-=zu*t73zf z`WGj4jJt4HM&@JzEwaS~7upEbdQV&$~?MKReqk{@E!u!Wt=_ z)!0aR`MQ0Acc%^0ORjq@NkTzEL}hRP%r~j*dS4==d}`iT!>4LF)>gg`>ATKN{Z}mh z7rp(5=ltO<`F9+qt)VwTVo3@X6&0PGon1;NN~Um_z6KRLUGt*Mq@|^0Xn0sDT_9|;rEL6* zjmiPmw#`J2L%N|r-JyOU@R;uB4N>TK3ILq+yVe(-j}+zxQK>m z`nL%UeC4Fm^X(fSSm@>6l;Ppw?Dy|MN&!HV;dFqP0D5k1X&IOuI=wiW9UdCOy(=J{ zJ&2KvKoAiToq-Z4HE0HbVn5qxYi#^tZ?OxkbYUkD-_r8m4P+aOM(Nzw803#1e&?Bj zDZQ+WjLNF2z1`glUkQI~fb`7D%A%vAb98j1RT#v}3YGUq+Jblu zQAqiRl52tYUlTn5IhCEAUE`Jb_N}Xn%jVWr@uyEBEa0Q%>4&?!H$bb()5m#{V1>Ld zDuN|=rlocNm%(++MsZs5@IKkw zMqQ@28{H&}%*a(P;FJ#@Gt$%~OX=;%=z~-sHZJZdcADZW$nwzwAcKbQhqzWIt#)DF~+ zNk|X=))yB_3QQ0Y6$LrPQj%x70;m8W4-O8Fz=N6baS{@e+}vCq@JI+mcst}1>^wX` z4_q7^o_mX!N30luBO@b_a**G-W7Gk1A$h^V&aNZ*u8{W^NEps<{1ZGVdWq+il#CAy zJYjR%v9PoRN18SD{QmEa5>%tdKE1EM!2Al+$T|*T*0yfwxvnaG+$6~Sk18AM>tVchvhg3Pl_US|Dq^C}jcu8lmDTspxyM1&m4-Hvgfi!~p`9HE z`Zy+5);FF;UR__mCM6}=%+!-%J8exre&a>*Q)CyL&fqGA<>e<3jPqO4>ouNle8YG-SE0XP9dmpJ_Qu##{Z zuOsadij%V@rV_EQ^ry`rrvYcMbv$5|`xISOCa&1NOcB{U}QQWe76 zaL20SYZZxK3FqeK_B#Akx z^I#D}3@55c+P|i`wJY)(Xk(Zu0k6ZJuCBFiHWWxB0#5;lqa(Jz!vgQcJ*MjgD4jW+D)!z;-H8;>4-WK?`7x(jVO(lV=i`N^F0TgNXhI$i%Kw< zTZOzg7{B879XUQQY8{0(lj<+h(Su}=<3GB#clrjg-gjdGC0^g zjDc|9UseDID6DpGL0?Uy z{QSVy!Vd!j%8-~vM@J_-P_M44@;Tf5OwMid1-Kf7#KrkJ#6Ez_ulRp55-dz&3+?CS zF&0WOV+h^+`ELF(1aY;7t)XCYA@?;mHLa?y-iu)Vjx&d@{q!k59v;jtGM-eg!E@>7 zPXcoC2ZgU{$O1Mb0`HekPwOC&$OD9>scFKycP9WTV9CR#z)1F*Re<6V`KUrA;BEk1 zPmF^2;>JZvN2>{kpr9ZSH`v#L!oumv$xpetK)|8Z`JX=hJ=-`DXbTh>SpTbkBgKmH za!`Ws)3Hlig|yB3$R`1>W)2eXA@{zB>T2$z0iYd_e&DtM2EcYh&lKh6t}HAB5%py6 zbVs`10RP=#!0zPa1WWpWf#I|3=J)N!GsT^!2m~>+hQpup6L`A-_3cmNAMfjXgM8Rb zc7=uDd5q8bv13ax=7f}s%Wp{Nii=t8va75ADZ-MCt!+E%$BOT8NnYNohU=32rtGAU zTZ4936-nmr0xkubI!ArzNf%7XM5ap^oqNJVQ>1fd!`cXP-M)71+5yoHB$l*DB_@#?XPIDLWTr&n zYdCD0G&nx44vDsm47|?3;smT)Ut5!rm31P&Vz-`Gg18Ykh z?y@!n9F_y-9l}O{T5N3W=dUzO2F;$x$vt3XWaQ;NhHi(bw7Iz%ZY0*neV0D&WOXnb zA|!Nl^veaROAziI)wWZ?ul*lhJsR})BYFq!-}9!Oy?sV(EWz#DTo8(n6es~2fK@;P;e5FF72$OLsgfk~E$qlfJ8VyE>M z5D?_>pcID3#)zwtz72EDp7*$MA7he2JHY!hDk1Nkg9Dukv)<+)ba>dZR&rv^O0uTd z$ueUp9i8cewP9GLm#MY_5)u;a?d>x&GoT9K&A`N^`YXg=$9@x7MO5!U@74bAj(h#J z#XomNFihGYy@yjfwB0Rs;UTjVZY|pP!VPw*n8bYTNzpj?nl}D-Ec(|jhFo4_EM3{& U7Yo9L*OLet2}SW@QG>w$0Y71QjsO4v literal 0 HcmV?d00001 diff --git a/docs/html/d0/d70/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState.html b/docs/html/d0/d70/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState.html new file mode 100644 index 000000000..6ff1e1aff --- /dev/null +++ b/docs/html/d0/d70/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState.html @@ -0,0 +1,149 @@ + + + + + + + +CXXGraph: CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Public Member Functions | +List of all members
+
+
CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T > Class Template Reference
+
+
+
+Inheritance diagram for CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >:
+
+
Inheritance graph
+ + + + +
[legend]
+
+Collaboration diagram for CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >:
+
+
Collaboration graph
+ + + + +
[legend]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

+ CoordinatedPartitionState (Globals &G)
 
+Record< T > & getRecord (int x)
 
+int getMachineLoad (int m)
 
+void incrementMachineLoad (int m, Edge< T > &e)
 
+int getMinLoad ()
 
+int getMaxLoad ()
 
+std::vector< int > getMachines_load ()
 
+int getTotalReplicas ()
 
+int getNumVertices ()
 
+std::set< int > getVertexIds ()
 
+void incrementMachineLoadVertices (int m)
 
+std::vector< int > getMachines_loadVertices ()
 
- Public Member Functions inherited from CXXGRAPH::PARTITIONING::PartitionState< T >
+virtual void incrementMachineLoad (int m, Edge< T > e)=0
 
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d0/df2/classCXXGRAPH_1_1Graph.html b/docs/html/d0/df2/classCXXGRAPH_1_1Graph.html index 48826b29a..99b98c26c 100644 --- a/docs/html/d0/df2/classCXXGRAPH_1_1Graph.html +++ b/docs/html/d0/df2/classCXXGRAPH_1_1Graph.html @@ -69,7 +69,6 @@
-Public Types | Public Member Functions | Friends | List of all members
@@ -87,34 +86,12 @@
Inheritance graph
- - - + + +
[legend]
- - - - - - - - - - - -

-Public Types

enum  E_InputOutputFormat { STANDARD_CSV -, STANDARD_TSV -, OUT_1 -, OUT_2 - }
 Specify the Input/Output format of the Graph for Import/Export functions. More...
 
enum  E_PartitionAlgorithm { GREEDY_VC -, ALG_1 -, ALG_2 - }
 Specify the Partition Algorithm. More...
 
-typedef E_InputOutputFormat InputOutputFormat
 
-typedef E_PartitionAlgorithm PartitionAlgorithm
 
- + - + - - - + + +

Public Member Functions

@@ -163,15 +140,15 @@
virtual const DialResult dial (const Node< T > &source, int maxWeight) const
 This function write the graph in an output file Note: No Thread Safe. More...
 
virtual int writeToFile (InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const
virtual int writeToFile (InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const
 This function write the graph in an output file Note: No Thread Safe. More...
 
virtual int readFromFile (InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false)
virtual int readFromFile (InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false)
 This function read the graph from an input file Note: No Thread Safe. More...
 
virtual PartitionMap< T > partitionGraph (PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const
 This function partition a graph in a set of partitions Note: No Thread Safe. More...
 
virtual PartitionMap< T > partitionGraph (PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const
 This function partition a graph in a set of partitions Note: No Thread Safe. More...
 
@@ -187,54 +164,7 @@ class CXXGRAPH::Graph< T >

Class that implement the Graph. ( This class is not Thread Safe )

-

Member Enumeration Documentation

- -

◆ E_InputOutputFormat

- -
-
-
-template<typename T >
-

Friends

- - - -
enum CXXGRAPH::Graph::E_InputOutputFormat
-
- -

Specify the Input/Output format of the Graph for Import/Export functions.

- - - -
Enumerator
STANDARD_CSV 

A standard csv format.

-
STANDARD_TSV 

A standard tsv format.

-
- -
-
- -

◆ E_PartitionAlgorithm

- -
-
-
-template<typename T >
- - - - -
enum CXXGRAPH::Graph::E_PartitionAlgorithm
-
- -

Specify the Partition Algorithm.

- - -
Enumerator
GREEDY_VC 

A Greedy Vertex-Cut Algorithm.

-
- -
-
-

Member Function Documentation

+

Member Function Documentation

◆ addEdge()

@@ -648,8 +578,8 @@

-

◆ partitionGraph()

+ +

◆ partitionGraph()

@@ -662,7 +592,7 @@

PartitionMap< T > CXXGRAPH::Graph< T >::partitionGraph ( - PartitionAlgorithm  + PARTITIONING::PartitionAlgorithm  algorithm, @@ -694,6 +624,8 @@

Returns
The partiton Map of the partitioned graph
+

Reimplemented in CXXGRAPH::Graph_TS< T >.

+

@@ -710,7 +642,7 @@

int CXXGRAPH::Graph< T >::readFromFile ( - InputOutputFormat  + InputOutputFormat  format = InputOutputFormat::STANDARD_CSV, @@ -770,6 +702,8 @@

Returns
0 if all OK, else return a negative value
+

Reimplemented in CXXGRAPH::Graph_TS< T >.

+ @@ -862,7 +796,7 @@

int CXXGRAPH::Graph< T >::writeToFile ( - InputOutputFormat  + InputOutputFormat  format = InputOutputFormat::STANDARD_CSV, @@ -922,10 +856,12 @@

Returns
0 if all OK, else return a negative value
+

Reimplemented in CXXGRAPH::Graph_TS< T >.

+
The documentation for this class was generated from the following file: diff --git a/docs/html/d1/d0d/classCXXGRAPH_1_1PARTITIONING_1_1Globals-members.html b/docs/html/d1/d0d/classCXXGRAPH_1_1PARTITIONING_1_1Globals-members.html new file mode 100644 index 000000000..d1f5f4601 --- /dev/null +++ b/docs/html/d1/d0d/classCXXGRAPH_1_1PARTITIONING_1_1Globals-members.html @@ -0,0 +1,93 @@ + + + + + + + +CXXGraph: Member List + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
CXXGRAPH::PARTITIONING::Globals Member List
+
+
+ +

This is the complete list of members for CXXGRAPH::PARTITIONING::Globals, including all inherited members.

+ + + + + + + + + + +
Globals(int numberOfPartiton, double lambda=1, PartitionAlgorithm algorithm=PartitionAlgorithm::HDRF_ALG, unsigned int threads=std::thread::hardware_concurrency()) (defined in CXXGRAPH::PARTITIONING::Globals)CXXGRAPH::PARTITIONING::Globalsinline
lambda (defined in CXXGRAPH::PARTITIONING::Globals)CXXGRAPH::PARTITIONING::Globals
numberOfPartition (defined in CXXGRAPH::PARTITIONING::Globals)CXXGRAPH::PARTITIONING::Globals
partitionStategy (defined in CXXGRAPH::PARTITIONING::Globals)CXXGRAPH::PARTITIONING::Globals
PLACES (defined in CXXGRAPH::PARTITIONING::Globals)CXXGRAPH::PARTITIONING::Globals
print() (defined in CXXGRAPH::PARTITIONING::Globals)CXXGRAPH::PARTITIONING::Globals
SLEEP_LIMIT (defined in CXXGRAPH::PARTITIONING::Globals)CXXGRAPH::PARTITIONING::Globals
threads (defined in CXXGRAPH::PARTITIONING::Globals)CXXGRAPH::PARTITIONING::Globals
~Globals() (defined in CXXGRAPH::PARTITIONING::Globals)CXXGRAPH::PARTITIONING::Globalsinline
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d1/d63/classCXXGRAPH_1_1PARTITIONING_1_1HDRF.html b/docs/html/d1/d63/classCXXGRAPH_1_1PARTITIONING_1_1HDRF.html new file mode 100644 index 000000000..c15fbaffd --- /dev/null +++ b/docs/html/d1/d63/classCXXGRAPH_1_1PARTITIONING_1_1HDRF.html @@ -0,0 +1,115 @@ + + + + + + + +CXXGraph: CXXGRAPH::PARTITIONING::HDRF< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Public Member Functions | +List of all members
+
+
CXXGRAPH::PARTITIONING::HDRF< T > Class Template Reference
+
+
+
+Inheritance diagram for CXXGRAPH::PARTITIONING::HDRF< T >:
+
+
Inheritance graph
+ + + + +
[legend]
+
+Collaboration diagram for CXXGRAPH::PARTITIONING::HDRF< T >:
+
+
Collaboration graph
+ + + + +
[legend]
+ + + + + + +

+Public Member Functions

+ HDRF (Globals G)
 
+void performStep (Edge< T > &e, PartitionState< T > &Sstate)
 
+
The documentation for this class was generated from the following file:
    +
  • /github/workspace/include/Partitioning/HDRF.hpp
    • +
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d1/db4/UndirectedWeightedEdge_8hpp_source.html b/docs/html/d1/db4/UndirectedWeightedEdge_8hpp_source.html new file mode 100644 index 000000000..2d9ca709a --- /dev/null +++ b/docs/html/d1/db4/UndirectedWeightedEdge_8hpp_source.html @@ -0,0 +1,197 @@ + + + + + + + +CXXGraph: /github/workspace/include/Edge/UndirectedWeightedEdge.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
UndirectedWeightedEdge.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __UNDIRECTEDWEIGHTEDEDGE_H__
+
21 #define __UNDIRECTEDWEIGHTEDEDGE_H__
+
22 
+
23 #pragma once
+
24 
+
25 #include "UndirectedEdge.hpp"
+
26 #include "Weighted.hpp"
+
27 
+
28 namespace CXXGRAPH
+
29 {
+
30  //Foward Declaration
+
31  template <typename T>
+
32  class DirectedWeightedEdge;
+
33 
+
34  template <typename T>
+
35  class UndirectedWeightedEdge;
+
36 
+
37  // ostream operator
+
38  template <typename T>
+
39  std::ostream &operator<<(std::ostream &o, const UndirectedWeightedEdge<T> &edge);
+
40 
+
41  template <typename T>
+
42  class UndirectedWeightedEdge : public UndirectedEdge<T>, public Weighted
+
43  {
+
44  public:
+
45  UndirectedWeightedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2, const double weight);
+
46  UndirectedWeightedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair, const double weight);
+
47  UndirectedWeightedEdge(const UndirectedEdge<T> &edge, const double weight);
+
48  UndirectedWeightedEdge(const Edge<T> &edge, const double weight);
+
49  UndirectedWeightedEdge(const UndirectedEdge<T> &edge);
+
50  UndirectedWeightedEdge(const Edge<T> &edge);
+
51  UndirectedWeightedEdge(const DirectedWeightedEdge<T> &edge);
+
52  virtual ~UndirectedWeightedEdge() = default;
+
53  const std::optional<bool> isWeighted() const override;
+
54  //operator
+
55  explicit operator DirectedWeightedEdge<T>() const { return DirectedWeightedEdge<T>(Edge<T>::getId(), Edge<T>::getNodePair(), Weighted::getWeight()); }
+
56 
+
57  friend std::ostream &operator<<<>(std::ostream &os, const UndirectedWeightedEdge<T> &edge);
+
58  };
+
59 
+
60  template <typename T>
+
61  UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2, const double weight) : UndirectedEdge<T>(id, node1, node2), Weighted(weight)
+
62  {
+
63  }
+
64 
+
65  template <typename T>
+
66  UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair, const double weight) : UndirectedEdge<T>(id, nodepair), Weighted(weight)
+
67  {
+
68  }
+
69 
+
70  template <typename T>
+
71  UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const UndirectedEdge<T> &edge, const double weight) : UndirectedEdge<T>(edge), Weighted(weight)
+
72  {
+
73  }
+
74 
+
75  template <typename T>
+
76  UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const Edge<T> &edge, const double weight) : UndirectedEdge<T>(edge), Weighted(weight)
+
77  {
+
78  }
+
79 
+
80  template <typename T>
+
81  UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const UndirectedEdge<T> &edge) : UndirectedEdge<T>(edge), Weighted()
+
82  {
+
83  }
+
84 
+
85  template <typename T>
+
86  UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const Edge<T> &edge) : UndirectedEdge<T>(edge), Weighted()
+
87  {
+
88  }
+
89 
+
90  template <typename T>
+
91  UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const DirectedWeightedEdge<T> &edge) : UndirectedEdge<T>(edge), Weighted(edge.getWeight())
+
92  {
+
93  }
+
94 
+
95  template <typename T>
+
96  const std::optional<bool> UndirectedWeightedEdge<T>::isWeighted() const
+
97  {
+
98  return true;
+
99  }
+
100 
+
101  template <typename T>
+
102  std::ostream &operator<<(std::ostream &os, const UndirectedWeightedEdge<T> &edge)
+
103  {
+
104  os << "((Node: " << edge.getNode1().getId() << ")) <----- |Edge: #" << edge.getId() << " W:" << edge.getWeight() << "|-----> ((Node: " << edge.getNode2().getId() << "))";
+
105  return os;
+
106  }
+
107 
+
108 }
+
109 
+
110 #endif // __UNDIRECTEDWEIGHTEDEDGE_H__
+
CXXGRAPH::DirectedWeightedEdge
Definition: DirectedWeightedEdge.hpp:42
+
CXXGRAPH::Edge
Definition: Edge.hpp:40
+
CXXGRAPH::Node
Definition: Node.hpp:35
+
CXXGRAPH::UndirectedEdge
Definition: UndirectedEdge.hpp:39
+
CXXGRAPH::UndirectedWeightedEdge
Definition: UndirectedWeightedEdge.hpp:43
+
CXXGRAPH::Weighted
Definition: Weighted.hpp:28
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d2/d3f/classCXXGRAPH_1_1Reader.html b/docs/html/d2/d3f/classCXXGRAPH_1_1Reader.html index 3790c7a9d..5766f52b6 100644 --- a/docs/html/d2/d3f/classCXXGRAPH_1_1Reader.html +++ b/docs/html/d2/d3f/classCXXGRAPH_1_1Reader.html @@ -75,14 +75,14 @@
-

#include <Graph.hpp>

+

#include <Reader.hpp>

Detailed Description

template<typename T>
class CXXGRAPH::Reader< T >

Interface to implement for a custom reader.

The documentation for this class was generated from the following file:
diff --git a/docs/html/d2/d40/PartitioningStats_8hpp_source.html b/docs/html/d2/d40/PartitioningStats_8hpp_source.html new file mode 100644 index 000000000..b96623757 --- /dev/null +++ b/docs/html/d2/d40/PartitioningStats_8hpp_source.html @@ -0,0 +1,151 @@ + + + + + + + +CXXGraph: /github/workspace/include/Partitioning/PartitioningStats.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
PartitioningStats.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __PARTITIONINGSTATS_H__
+
21 #define __PARTITIONINGSTATS_H__
+
22 
+
23 #include <iostream>
+
24 #include "Utility/Typedef.hpp"
+
25 namespace CXXGRAPH
+
26 {
+
27  namespace PARTITIONING
+
28  {
+
29  class PartitioningStats
+
30  {
+
31  public:
+
32  unsigned int numberOfPartitions; // The number of Partitions
+
33  unsigned int numberOfNodes; // The number of Nodes
+
34  unsigned int replicatedNodesCount; // The number of Nodes that are replicated
+
35  unsigned int numberOfEdges; // The number of edges
+
36  unsigned int replicatedEdgesCount; // The number of edges that are replicated
+
37  unsigned int maxEdgesLoad; // Maximum edges load of the partitions
+
38  unsigned int minEdgesLoad; // Minimun edges load of the partitions
+
39  unsigned int maxNodesLoad; // Maximum nodes load of the partitions
+
40  unsigned int minNodesLoad; // Minimun nodes load of the partitions
+
41  double balanceEdgesFactor; // The balance edges factor of the partitions (maxEdgesLoad - minEdgesLoad) / (maxEdgesLoad), 0 is the optimal partitioning
+
42  double balanceNodesFactor; // The balance edges factor of the partitions (maxNodesLoad - minNodesLoad) / (maxNodesLoad), 0 is the optimal partitioning
+
43  double nodesReplicationFactor; // The replication factor of the Nodes (replicatedNodesCount / numberOfNodes), 1 is the optimal partitioning
+
44  double edgesReplicationFactor; // The replication factor of the edges (replicatedEdgesCount / numberOfEdges), 1 is the optimal partitioning
+
45 
+
46  friend std::ostream &operator<<(std::ostream &os, const PartitioningStats &partitionStats)
+
47  {
+
48  os << "Partitioning Stats:\n";
+
49  os << "\tNumber of Partitions: " << partitionStats.numberOfPartitions << "\n";
+
50  os << "\tNumber of Nodes: " << partitionStats.numberOfNodes << "\n";
+
51  os << "\tNumber of Edges: " << partitionStats.numberOfEdges << "\n";
+
52  os << "\tNumber of Nodes Replica: " << partitionStats.replicatedNodesCount << "\n";
+
53  os << "\tNumber of Edges Replica: " << partitionStats.replicatedEdgesCount << "\n";
+
54  os << "\tNodes Replication Factor: " << partitionStats.nodesReplicationFactor << "\n";
+
55  os << "\tEdges Replication Factor: " << partitionStats.edgesReplicationFactor << "\n";
+
56  os << "\tMax Edges Load: " << partitionStats.maxEdgesLoad << "\n";
+
57  os << "\tMin Edges Load: " << partitionStats.minEdgesLoad << "\n";
+
58  os << "\tBalance Edges Factor: " << partitionStats.balanceEdgesFactor << "\n";
+
59  os << "\tMax Nodes Load: " << partitionStats.maxNodesLoad << "\n";
+
60  os << "\tMin Nodes Load: " << partitionStats.minNodesLoad << "\n";
+
61  os << "\tBalance Nodes Factor: " << partitionStats.balanceNodesFactor << "\n";
+
62  return os;
+
63  }
+
64  };
+
65  }
+
66 
+
67 }
+
68 
+
69 #endif // __PARTITIONINGSTATS_H__
+
CXXGRAPH::PARTITIONING::PartitioningStats
Definition: PartitioningStats.hpp:30
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d2/d6c/classCXXGRAPH_1_1Graph__TS-members.html b/docs/html/d2/d6c/classCXXGRAPH_1_1Graph__TS-members.html index f0305ea7c..6df1169f5 100644 --- a/docs/html/d2/d6c/classCXXGRAPH_1_1Graph__TS-members.html +++ b/docs/html/d2/d6c/classCXXGRAPH_1_1Graph__TS-members.html @@ -76,14 +76,10 @@

This is the complete list of members for CXXGRAPH::Graph_TS< T >, including all inherited members.

- - - - @@ -94,26 +90,16 @@ - - - - - - - - - - - - - - - - + + + + + +
addEdge(const Edge< T > *edge) overrideCXXGRAPH::Graph_TS< T >virtual
ALG_1 enum value (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
ALG_2 enum value (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
breadth_first_search(const Node< T > &start) const overrideCXXGRAPH::Graph_TS< T >virtual
depth_first_search(const Node< T > &start) const overrideCXXGRAPH::Graph_TS< T >virtual
dial(const Node< T > &source, int maxWeight) const overrideCXXGRAPH::Graph_TS< T >virtual
dijkstra(const Node< T > &source, const Node< T > &target) const overrideCXXGRAPH::Graph_TS< T >virtual
E_InputOutputFormat enum nameCXXGRAPH::Graph< T >
E_PartitionAlgorithm enum nameCXXGRAPH::Graph< T >
getAdjMatrix() const overrideCXXGRAPH::Graph_TS< T >virtual
getEdge(unsigned long edgeId) const overrideCXXGRAPH::Graph_TS< T >virtual
getEdgeSet() const overrideCXXGRAPH::Graph_TS< T >virtual
Graph_TS()=default (defined in CXXGRAPH::Graph_TS< T >)CXXGRAPH::Graph_TS< T >
Graph_TS(const std::list< const Edge< T > * > &edgeSet) (defined in CXXGRAPH::Graph_TS< T >)CXXGRAPH::Graph_TS< T >
Graph_TS(const Graph< T > &graph) (defined in CXXGRAPH::Graph_TS< T >)CXXGRAPH::Graph_TS< T >
GREEDY_VC enum valueCXXGRAPH::Graph< T >
InputOutputFormat typedef (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
isCyclicDirectedGraphBFS() const overrideCXXGRAPH::Graph_TS< T >virtual
isCyclicDirectedGraphDFS() const overrideCXXGRAPH::Graph_TS< T >virtual
isDirectedGraph() const overrideCXXGRAPH::Graph_TS< T >virtual
mutex (defined in CXXGRAPH::ThreadSafe)CXXGRAPH::ThreadSafemutableprotected
OUT_1 enum value (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
OUT_2 enum value (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
PartitionAlgorithm typedef (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
partitionGraph(typename Graph< T >::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const overrideCXXGRAPH::Graph_TS< T >
CXXGRAPH::Graph::partitionGraph(PartitionAlgorithm algorithm, unsigned int numberOfPartitions) constCXXGRAPH::Graph< T >virtual
readFromFile(typename Graph< T >::InputOutputFormat format=Graph< T >::InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false) overrideCXXGRAPH::Graph_TS< T >
CXXGRAPH::Graph::readFromFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false)CXXGRAPH::Graph< T >virtual
releaseLock() const (defined in CXXGRAPH::ThreadSafe)CXXGRAPH::ThreadSafeinline
removeEdge(unsigned long edgeId) overrideCXXGRAPH::Graph_TS< T >virtual
setEdgeSet(std::list< const Edge< T > * > &edgeSet) overrideCXXGRAPH::Graph_TS< T >virtual
STANDARD_CSV enum valueCXXGRAPH::Graph< T >
STANDARD_TSV enum valueCXXGRAPH::Graph< T >
writeToFile(typename Graph< T >::InputOutputFormat format=Graph< T >::InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const overrideCXXGRAPH::Graph_TS< T >
CXXGRAPH::Graph::writeToFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) constCXXGRAPH::Graph< T >virtual
partitionGraph(PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const overrideCXXGRAPH::Graph_TS< T >virtual
readFromFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false) overrideCXXGRAPH::Graph_TS< T >virtual
releaseLock() const (defined in CXXGRAPH::ThreadSafe)CXXGRAPH::ThreadSafeinline
removeEdge(unsigned long edgeId) overrideCXXGRAPH::Graph_TS< T >virtual
setEdgeSet(std::list< const Edge< T > * > &edgeSet) overrideCXXGRAPH::Graph_TS< T >virtual
writeToFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const overrideCXXGRAPH::Graph_TS< T >virtual
~Graph()=default (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
~Graph_TS()=default (defined in CXXGRAPH::Graph_TS< T >)CXXGRAPH::Graph_TS< T >
diff --git a/docs/html/d2/de9/ThreadSafe_8hpp_source.html b/docs/html/d2/de9/ThreadSafe_8hpp_source.html new file mode 100644 index 000000000..c93c95042 --- /dev/null +++ b/docs/html/d2/de9/ThreadSafe_8hpp_source.html @@ -0,0 +1,132 @@ + + + + + + + +CXXGraph: /github/workspace/include/Utility/ThreadSafe.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
ThreadSafe.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __THREADSAFE_H__
+
21 #define __THREADSAFE_H__
+
22 
+
23 #pragma once
+
24 
+
25 #include <mutex>
+
26 
+
27 namespace CXXGRAPH
+
28 {
+
29  class ThreadSafe
+
30  {
+
31  public:
+
32  void getLock() const;
+
33  void releaseLock() const;
+
34 
+
35  protected:
+
36  mutable std::mutex mutex;
+
37  };
+
38  //inline because the implementation of non-template function in header file
+
39  inline void ThreadSafe::getLock() const
+
40  {
+
41  mutex.lock();
+
42  }
+
43  //inline because the implementation of non-template function in header file
+
44  inline void ThreadSafe::releaseLock() const
+
45  {
+
46  mutex.unlock();
+
47  }
+
48 }
+
49 
+
50 #endif // __THREADSAFE_H__
+
CXXGRAPH::ThreadSafe
Definition: ThreadSafe.hpp:30
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d2/df2/HDRF_8hpp_source.html b/docs/html/d2/df2/HDRF_8hpp_source.html new file mode 100644 index 000000000..fd5a20481 --- /dev/null +++ b/docs/html/d2/df2/HDRF_8hpp_source.html @@ -0,0 +1,291 @@ + + + + + + + +CXXGraph: /github/workspace/include/Partitioning/HDRF.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
HDRF.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __CXXGRAPH_PARTITIONING_HDRF_H__
+
21 #define __CXXGRAPH_PARTITIONING_HDRF_H__
+
22 
+
23 #pragma once
+
24 
+
25 #include "Partitioning/Utility/Globals.hpp"
+
26 #include "Edge/Edge.hpp"
+
27 #include "PartitionStrategy.hpp"
+
28 
+
29 namespace CXXGRAPH
+
30 {
+
31  namespace PARTITIONING
+
32  {
+
33  template <typename T>
+
34  class HDRF : public PartitionStrategy<T>
+
35  {
+
36  private:
+
37  Globals GLOBALS;
+
38 
+
39  public:
+
40  HDRF(Globals G);
+
41  ~HDRF();
+
42 
+
43  void performStep(Edge<T> &e, PartitionState<T> &Sstate);
+
44  };
+
45  template <typename T>
+
46  HDRF<T>::HDRF(Globals G)
+
47  {
+
48  this->GLOBALS = G;
+
49  }
+
50  template <typename T>
+
51  HDRF<T>::~HDRF()
+
52  {
+
53  }
+
54  template <typename T>
+
55  void HDRF<T>::performStep(Edge<T> &e, PartitionState<T> &state)
+
56  {
+
57 
+
58  int P = GLOBALS.numberOfPartition;
+
59  int epsilon = 1;
+
60  int u = e.getU();
+
61  int v = e.getV();
+
62 
+
63  Record u_record = state.getRecord(u);
+
64  Record v_record = state.getRecord(v);
+
65 
+
66  //*** ASK FOR LOCK
+
67  int sleep_time = 2;
+
68  while (!u_record.getLock())
+
69  {
+
70  sleep(sleep_time);
+
71  sleep = (int)pow(sleep_time, 2);
+
72  }
+
73  sleep_time = 2;
+
74  while (!v_record.getLock())
+
75  {
+
76  sleep(sleep_time);
+
77  sleep = (int)pow(sleep_time, 2);
+
78  if (sleep_time > GLOBALS.SLEEP_LIMIT)
+
79  {
+
80  u_record.releaseLock();
+
81  performStep(e, state);
+
82  return;
+
83  } //TO AVOID DEADLOCK
+
84  }
+
85  //*** LOCK TAKEN
+
86 
+
87  int machine_id = -1;
+
88 
+
89  //*** COMPUTE MAX AND MIN LOAD
+
90  int MIN_LOAD = state.getMinLoad();
+
91  int MAX_LOAD = state.getMaxLoad();
+
92 
+
93  //*** COMPUTE SCORES, FIND MIN SCORE, AND COMPUTE CANDIDATES PARITIONS
+
94  std::list<int> candidates;
+
95  double MAX_SCORE = 0.0;
+
96 
+
97  for (int m = 0; m < P; m++)
+
98  {
+
99 
+
100  int degree_u = u_record.getDegree() + 1;
+
101  int degree_v = v_record.getDegree() + 1;
+
102  int SUM = degree_u + degree_v;
+
103  double fu = 0;
+
104  double fv = 0;
+
105  if (u_record.hasReplicaInPartition(m))
+
106  {
+
107  fu = degree_u;
+
108  fu /= SUM;
+
109  fu = 1 + (1 - fu);
+
110  }
+
111  if (v_record.hasReplicaInPartition(m))
+
112  {
+
113  fv = degree_v;
+
114  fv /= SUM;
+
115  fv = 1 + (1 - fv);
+
116  }
+
117  int load = state.getMachineLoad(m);
+
118  double bal = (MAX_LOAD - load);
+
119  bal /= (epsilon + MAX_LOAD - MIN_LOAD);
+
120  if (bal < 0)
+
121  {
+
122  bal = 0;
+
123  }
+
124  double SCORE_m = fu + fv + GLOBALS.lambda * bal;
+
125  if (SCORE_m < 0)
+
126  {
+
127  std::cout << "ERRORE: SCORE_m<0" << std::endl;
+
128  std::cout << "fu: " << fu << std::endl;
+
129  std::cout << "fv: " << fv << std::endl;
+
130  std::cout << "GLOBALS.LAMBDA: " << GLOBALS.lambda << std::endl;
+
131  std::cout << "bal: " << bal << std::endl;
+
132  exit(-1);
+
133  }
+
134  if (SCORE_m > MAX_SCORE)
+
135  {
+
136  MAX_SCORE = SCORE_m;
+
137  candidates.clear();
+
138  candidates.push_back(m);
+
139  }
+
140  else if (SCORE_m == MAX_SCORE)
+
141  {
+
142  candidates.push_back(m);
+
143  }
+
144  }
+
145 
+
146  //*** CHECK TO AVOID ERRORS
+
147  if (candidates.empty())
+
148  {
+
149  std::cout << "ERROR: GreedyObjectiveFunction.performStep -> candidates.isEmpty()" << std::endl;
+
150  std::cout << "MAX_SCORE: " << MAX_SCORE << std::endl;
+
151  exit(-1);
+
152  }
+
153 
+
154  //*** PICK A RANDOM ELEMENT FROM CANDIDATES
+
155  /* initialize random seed: */
+
156  srand(time(NULL));
+
157 
+
158  int choice = rand() % candidates.size();
+
159  // TODOOOOOOOOO
+
160  //machine_id = candidates.at(choice);
+
161 
+
162  try
+
163  {
+
164  CoordinatedPartitionState<T> &cord_state = dynamic_cast<CoordinatedPartitionState<T> &>(state);
+
165  //NEW UPDATE RECORDS RULE TO UPFDATE THE SIZE OF THE PARTITIONS EXPRESSED AS THE NUMBER OF VERTICES THEY CONTAINS
+
166  if (!u_record.hasReplicaInPartition(machine_id))
+
167  {
+
168  u_record.addPartition(machine_id);
+
169  cord_state.incrementMachineLoadVertices(machine_id);
+
170  }
+
171  if (!v_record.hasReplicaInPartition(machine_id))
+
172  {
+
173  v_record.addPartition(machine_id);
+
174  cord_state.incrementMachineLoadVertices(machine_id);
+
175  }
+
176  }
+
177  catch (std::bad_cast)
+
178  {
+
179  // use employee's member functions
+
180  //1-UPDATE RECORDS
+
181  if (!u_record.hasReplicaInPartition(machine_id))
+
182  {
+
183  u_record.addPartition(machine_id);
+
184  }
+
185  if (!v_record.hasReplicaInPartition(machine_id))
+
186  {
+
187  v_record.addPartition(machine_id);
+
188  }
+
189  }
+
190 
+
191  //2-UPDATE EDGES
+
192  state.incrementMachineLoad(machine_id, e);
+
193 
+
194  //3-UPDATE DEGREES
+
195  u_record.incrementDegree();
+
196  v_record.incrementDegree();
+
197 
+
198  //*** RELEASE LOCK
+
199  u_record.releaseLock();
+
200  v_record.releaseLock();
+
201  }
+
202  }
+
203 }
+
204 
+
205 #endif // __CXXGRAPH_PARTITIONING_HDRF_H__
+
CXXGRAPH::Edge
Definition: Edge.hpp:40
+
CXXGRAPH::PARTITIONING::Globals
Definition: Globals.hpp:32
+
CXXGRAPH::PARTITIONING::HDRF
Definition: HDRF.hpp:35
+
CXXGRAPH::PARTITIONING::PartitionState
Definition: PartitionState.hpp:31
+
CXXGRAPH::PARTITIONING::PartitionStrategy
Definition: PartitionStrategy.hpp:34
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d3/d4d/Typedef_8hpp_source.html b/docs/html/d3/d4d/Typedef_8hpp_source.html new file mode 100644 index 000000000..cc3ca74f3 --- /dev/null +++ b/docs/html/d3/d4d/Typedef_8hpp_source.html @@ -0,0 +1,170 @@ + + + + + + + +CXXGraph: /github/workspace/include/Utility/Typedef.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Typedef.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __CXXGRAPH_TYPEDEF_H__
+
21 #define __CXXGRAPH_TYPEDEF_H__
+
22 
+
23 #pragma once
+
24 
+
25 #include <map>
+
26 #include <string>
+
27 #include <fstream>
+
28 
+
29 namespace CXXGRAPH
+
30 {
+
31 
+
32  template <typename T>
+
33  class Node;
+
34 
+
35  template <typename T>
+
36  class Edge;
+
37 
+
38  namespace PARTITIONING{
+
39  template<typename T>
+
40  class Partition;
+
41  }
+
42  // ENUMERATION //////////////////////////////////////
+
43 
+
45  enum E_InputOutputFormat
+
46  {
+
47  STANDARD_CSV,
+
48  STANDARD_TSV,
+
49  OUT_1,
+
50  OUT_2
+
51  };
+
52 
+
53  typedef E_InputOutputFormat InputOutputFormat;
+
54 
+
55 
+
56 
+
58  // Structures ///////////////////////////////////////
+
59 
+
61  struct DijkstraResult_struct
+
62  {
+
63  bool success; // TRUE if the function does not return error, FALSE otherwise
+
64  std::string errorMessage; //message of error
+
65  double result; //result (valid only if success is TRUE)
+
66  };
+
67  typedef DijkstraResult_struct DijkstraResult;
+
68 
+
70  struct DialResult_struct
+
71  {
+
72  bool success; // TRUE if the function does not return error, FALSE otherwise
+
73  std::string errorMessage; //message of error
+
74  std::map<unsigned long, long> minDistanceMap; //result a map that contains the node id and the minumum distance from source (valid only if success is TRUE)
+
75  };
+
76  typedef DialResult_struct DialResult;
+
77 
+
79 
+
80 
+
82  // Using Definition ///////////////////////////////////////////////////////////////
+
83 
+
84  template <typename T>
+
85  using AdjacencyMatrix = std::map<const Node<T> *, std::vector<std::pair<const Node<T> *, const Edge<T> *>>>;
+
86 
+
87  template <typename T>
+
88  using PartitionMap = std::map<unsigned int, PARTITIONING::Partition<T> *>;
+
89 
+
91 }
+
92 
+
93 #endif // __CXXGRAPH_TYPEDEF_H__
+
CXXGRAPH::Edge
Definition: Edge.hpp:40
+
CXXGRAPH::DialResult_struct
Struct that contains the information about Dijsktra's Algorithm results.
Definition: Typedef.hpp:71
+
CXXGRAPH::DijkstraResult_struct
Struct that contains the information about Dijsktra's Algorithm results.
Definition: Typedef.hpp:62
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d3/d6b/Record_8hpp_source.html b/docs/html/d3/d6b/Record_8hpp_source.html new file mode 100644 index 000000000..b00f84cb0 --- /dev/null +++ b/docs/html/d3/d6b/Record_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + + + +CXXGraph: /github/workspace/include/Partitioning/Record.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Record.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __CXXGRAPH_PARTITIONING_RECORD_H__
+
21 #define __CXXGRAPH_PARTITIONING_RECORD_H__
+
22 
+
23 #pragma once
+
24 
+
25 namespace CXXGRAPH {
+
26  namespace PARTITIONING {
+
27  template <typename T>
+
28  class Record
+
29  {
+
30  public:
+
31  virtual PartitionMap<T> &getPartitions() = 0;
+
32  virtual void addPartition(int m) = 0;
+
33  virtual bool hasReplicaInPartition(int m) = 0;
+
34  virtual bool getLock() = 0;
+
35  virtual bool releaseLock() = 0;
+
36  virtual int getReplicas() = 0;
+
37  virtual int getDegree() = 0;
+
38  virtual void incrementDegree() = 0;
+
39  };
+
40  }
+
41 }
+
42 
+
43 #endif // __CXXGRAPH_PARTITIONING_RECORD_H__
+
CXXGRAPH::PARTITIONING::Record
Definition: Record.hpp:29
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d3/d91/Graph__TS_8hpp_source.html b/docs/html/d3/d91/Graph__TS_8hpp_source.html new file mode 100644 index 000000000..7a61c9e21 --- /dev/null +++ b/docs/html/d3/d91/Graph__TS_8hpp_source.html @@ -0,0 +1,340 @@ + + + + + + + +CXXGraph: /github/workspace/include/Graph/Graph_TS.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Graph_TS.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __GRAPH_TS_H__
+
21 #define __GRAPH_TS_H__
+
22 
+
23 #pragma once
+
24 
+
25 #include "Graph/Graph.hpp"
+
26 
+
27 namespace CXXGRAPH
+
28 {
+
29 
+
31  template <typename T>
+
32  class Graph_TS : public Graph<T>, public ThreadSafe
+
33  {
+
34  public:
+
35  Graph_TS() = default;
+
36  Graph_TS(const std::list<const Edge<T> *> &edgeSet);
+
37  Graph_TS(const Graph<T> &graph);
+
38  ~Graph_TS() = default;
+
47  const std::list<const Edge<T> *> &getEdgeSet() const override;
+
56  void setEdgeSet(std::list<const Edge<T> *> &edgeSet) override;
+
65  void addEdge(const Edge<T> *edge) override;
+
74  void removeEdge(unsigned long edgeId) override;
+
83  const std::list<const Node<T> *> getNodeSet() const override;
+
93  const std::optional<const Edge<T> *> getEdge(unsigned long edgeId) const override;
+
99  const AdjacencyMatrix<T> getAdjMatrix() const override;
+
112  const DijkstraResult dijkstra(const Node<T> &source, const Node<T> &target) const override;
+
123  const std::vector<Node<T>> breadth_first_search(const Node<T> &start) const override;
+
134  const std::vector<Node<T>> depth_first_search(const Node<T> &start) const override;
+
135 
+
144  bool isCyclicDirectedGraphDFS() const override;
+
145 
+
154  bool isCyclicDirectedGraphBFS() const override;
+
155 
+
163  bool isDirectedGraph() const override;
+
164 
+
191  const DialResult dial(const Node<T> &source, int maxWeight) const override;
+
192 
+
206  int writeToFile(InputOutputFormat format = InputOutputFormat::STANDARD_CSV, const std::string &workingDir = ".", const std::string &OFileName = "graph", bool compress = false, bool writeNodeFeat = false, bool writeEdgeWeight = false) const override;
+
207 
+
221  int readFromFile(InputOutputFormat format = InputOutputFormat::STANDARD_CSV, const std::string &workingDir = ".", const std::string &OFileName = "graph", bool compress = false, bool readNodeFeat = false, bool readEdgeWeight = false) override;
+
222 
+
232  PartitionMap<T> partitionGraph(PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const override;
+
233  };
+
234 
+
235  template <typename T>
+
236  Graph_TS<T>::Graph_TS(const std::list<const Edge<T> *> &edgeSet) : Graph<T>(edgeSet), ThreadSafe() {}
+
237 
+
238  template <typename T>
+
239  Graph_TS<T>::Graph_TS(const Graph<T> &graph) : Graph<T>(graph), ThreadSafe() {}
+
240 
+
241  template <typename T>
+
242  const std::list<const Edge<T> *> &Graph_TS<T>::getEdgeSet() const
+
243  {
+
244  std::lock_guard<std::mutex> lock(mutex);
+
245  return Graph<T>::getEdgeSet();
+
246  }
+
247 
+
248  template <typename T>
+
249  void Graph_TS<T>::setEdgeSet(std::list<const Edge<T> *> &edgeSet)
+
250  {
+
251  getLock();
+
252  Graph<T>::setEdgeSet(edgeSet);
+
253  releaseLock();
+
254  }
+
255 
+
256  template <typename T>
+
257  void Graph_TS<T>::addEdge(const Edge<T> *edge)
+
258  {
+
259  getLock();
+
260  Graph<T>::addEdge(edge);
+
261  releaseLock();
+
262  }
+
263 
+
264  template <typename T>
+
265  void Graph_TS<T>::removeEdge(unsigned long edgeId)
+
266  {
+
267  getLock();
+
268  Graph<T>::removeEdge(edgeId);
+
269  releaseLock();
+
270  }
+
271 
+
272  template <typename T>
+
273  const std::list<const Node<T> *> Graph_TS<T>::getNodeSet() const
+
274  {
+
275  getLock();
+
276  auto ns = Graph<T>::getNodeSet();
+
277  releaseLock();
+
278  return ns;
+
279  }
+
280 
+
281  template <typename T>
+
282  const std::optional<const Edge<T> *> Graph_TS<T>::getEdge(unsigned long edgeId) const
+
283  {
+
284  getLock();
+
285  auto e = Graph<T>::getEdge(edgeId);
+
286  releaseLock();
+
287  return e;
+
288  }
+
289 
+
290  template <typename T>
+
291  const AdjacencyMatrix<T> Graph_TS<T>::getAdjMatrix() const
+
292  {
+
293  getLock();
+
294  auto adjm = Graph<T>::getAdjMatrix();
+
295  releaseLock();
+
296  return adjm;
+
297  }
+
298 
+
299  template <typename T>
+
300  const DijkstraResult Graph_TS<T>::dijkstra(const Node<T> &source, const Node<T> &target) const
+
301  {
+
302  getLock();
+
303  auto dij = Graph<T>::dijkstra(source, target);
+
304  releaseLock();
+
305  return dij;
+
306  }
+
307 
+
308  template <typename T>
+
309  const std::vector<Node<T>> Graph_TS<T>::breadth_first_search(const Node<T> &start) const
+
310  {
+
311  getLock();
+
312  auto bfs = Graph<T>::breadth_first_search(start);
+
313  releaseLock();
+
314  return bfs;
+
315  }
+
316 
+
317  template <typename T>
+
318  const std::vector<Node<T>> Graph_TS<T>::depth_first_search(const Node<T> &start) const
+
319  {
+
320  getLock();
+
321  auto dfs = Graph<T>::depth_first_search(start);
+
322  releaseLock();
+
323  return dfs;
+
324  }
+
325 
+
326  template <typename T>
+
327  bool Graph_TS<T>::isCyclicDirectedGraphDFS() const
+
328  {
+
329  getLock();
+
330  auto result = Graph<T>::isCyclicDirectedGraphDFS();
+
331  releaseLock();
+
332  return result;
+
333  }
+
334 
+
335  template <typename T>
+
336  bool Graph_TS<T>::isCyclicDirectedGraphBFS() const
+
337  {
+
338  getLock();
+
339  auto result = Graph<T>::isCyclicDirectedGraphBFS();
+
340  releaseLock();
+
341  return result;
+
342  }
+
343 
+
344  template <typename T>
+
345  bool Graph_TS<T>::isDirectedGraph() const
+
346  {
+
347  getLock();
+
348  auto result = Graph<T>::isDirectedGraph();
+
349  releaseLock();
+
350  return result;
+
351  }
+
352 
+
353  template <typename T>
+
354  const DialResult Graph_TS<T>::dial(const Node<T> &source, int maxWeight) const
+
355  {
+
356  getLock();
+
357  auto dial = Graph<T>::dial(source, maxWeight);
+
358  releaseLock();
+
359  return dial;
+
360  }
+
361 
+
362  template <typename T>
+
363  int Graph_TS<T>::writeToFile(InputOutputFormat format, const std::string &workingDir, const std::string &OFileName, bool compress, bool writeNodeFeat, bool writeEdgeWeight) const
+
364  {
+
365  getLock();
+
366  auto result = Graph<T>::writeToFile(format, workingDir, OFileName, compress, writeNodeFeat, writeEdgeWeight);
+
367  releaseLock();
+
368  return result;
+
369  }
+
370 
+
371  template <typename T>
+
372  int Graph_TS<T>::readFromFile(InputOutputFormat format, const std::string &workingDir, const std::string &OFileName, bool compress, bool readNodeFeat, bool readEdgeWeight)
+
373  {
+
374  getLock();
+
375  auto result = Graph<T>::readFromFile(format, workingDir, OFileName, compress, readNodeFeat, readEdgeWeight);
+
376  releaseLock();
+
377  return result;
+
378  }
+
379 
+
380  template <typename T>
+
381  PartitionMap<T> Graph_TS<T>::partitionGraph(PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const
+
382  {
+
383  getLock();
+
384  auto partitions = Graph<T>::partitionGraph(algorithm, numberOfPartitions);
+
385  releaseLock();
+
386  return partitions;
+
387  }
+
388 }
+
389 #endif // __GRAPH_TS_H__
+
CXXGRAPH::Edge
Definition: Edge.hpp:40
+
CXXGRAPH::Graph_TS
Class that implement the Thread Safe Graph.
Definition: Graph_TS.hpp:33
+
CXXGRAPH::Graph_TS::getEdge
const std::optional< const Edge< T > * > getEdge(unsigned long edgeId) const override
Function that return an Edge with specific ID if Exist in the Graph Note: Thread Safe.
Definition: Graph_TS.hpp:282
+
CXXGRAPH::Graph_TS::getNodeSet
const std::list< const Node< T > * > getNodeSet() const override
Function that return the Node Set of the Graph Note: Thread Safe.
Definition: Graph_TS.hpp:273
+
CXXGRAPH::Graph_TS::setEdgeSet
void setEdgeSet(std::list< const Edge< T > * > &edgeSet) override
Function set the Edge Set of the Graph Note: Thread Safe.
Definition: Graph_TS.hpp:249
+
CXXGRAPH::Graph_TS::isDirectedGraph
bool isDirectedGraph() const override
This function checks if a graph is directed Note: Thread Safe.
Definition: Graph_TS.hpp:345
+
CXXGRAPH::Graph_TS::dijkstra
const DijkstraResult dijkstra(const Node< T > &source, const Node< T > &target) const override
Function runs the dijkstra algorithm for some source node and target node in the graph and returns th...
Definition: Graph_TS.hpp:300
+
CXXGRAPH::Graph_TS::writeToFile
int writeToFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const override
This function write the graph in an output file Note: Thread Safe.
Definition: Graph_TS.hpp:363
+
CXXGRAPH::Graph_TS::addEdge
void addEdge(const Edge< T > *edge) override
Function add an Edge to the Graph Edge Set Note: Thread Safe.
Definition: Graph_TS.hpp:257
+
CXXGRAPH::Graph_TS::partitionGraph
PartitionMap< T > partitionGraph(PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const override
This function partition a graph in a set of partitions Note: Thread Safe.
Definition: Graph_TS.hpp:381
+
CXXGRAPH::Graph_TS::isCyclicDirectedGraphBFS
bool isCyclicDirectedGraphBFS() const override
This function uses BFS to check for cycle in the graph. Pay Attention, this function work only with d...
Definition: Graph_TS.hpp:336
+
CXXGRAPH::Graph_TS::readFromFile
int readFromFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false) override
This function read the graph from an input file Note: Thread Safe.
Definition: Graph_TS.hpp:372
+
CXXGRAPH::Graph_TS::breadth_first_search
const std::vector< Node< T > > breadth_first_search(const Node< T > &start) const override
Function performs the breadth first search algorithm over the graph Note: Thread Safe.
Definition: Graph_TS.hpp:309
+
CXXGRAPH::Graph_TS::removeEdge
void removeEdge(unsigned long edgeId) override
Function remove an Edge from the Graph Edge Set Note: Thread Safe.
Definition: Graph_TS.hpp:265
+
CXXGRAPH::Graph_TS::getEdgeSet
const std::list< const Edge< T > * > & getEdgeSet() const override
Function that return the Edge set of the Graph Note: Thread Safe.
Definition: Graph_TS.hpp:242
+
CXXGRAPH::Graph_TS::depth_first_search
const std::vector< Node< T > > depth_first_search(const Node< T > &start) const override
Function performs the depth first search algorithm over the graph Note: Thread Safe.
Definition: Graph_TS.hpp:318
+
CXXGRAPH::Graph_TS::dial
const DialResult dial(const Node< T > &source, int maxWeight) const override
This function write the graph in an output file Note: Thread Safe.
Definition: Graph_TS.hpp:354
+
CXXGRAPH::Graph_TS::isCyclicDirectedGraphDFS
bool isCyclicDirectedGraphDFS() const override
This function uses DFS to check for cycle in the graph. Pay Attention, this function work only with d...
Definition: Graph_TS.hpp:327
+
CXXGRAPH::Graph_TS::getAdjMatrix
const AdjacencyMatrix< T > getAdjMatrix() const override
This function generate a list of adjacency matrix with every element of the matrix contain the node w...
Definition: Graph_TS.hpp:291
+
CXXGRAPH::Graph
Class that implement the Graph. ( This class is not Thread Safe )
Definition: Graph.hpp:76
+
CXXGRAPH::Graph::depth_first_search
virtual const std::vector< Node< T > > depth_first_search(const Node< T > &start) const
Function performs the depth first search algorithm over the graph Note: No Thread Safe.
Definition: Graph.hpp:1013
+
CXXGRAPH::Graph::getEdgeSet
virtual const std::list< const Edge< T > * > & getEdgeSet() const
Function that return the Edge set of the Graph Note: No Thread Safe.
Definition: Graph.hpp:307
+
CXXGRAPH::Graph::getEdge
virtual const std::optional< const Edge< T > * > getEdge(unsigned long edgeId) const
Function that return an Edge with specific ID if Exist in the Graph Note: No Thread Safe.
Definition: Graph.hpp:368
+
CXXGRAPH::Graph::isCyclicDirectedGraphBFS
virtual bool isCyclicDirectedGraphBFS() const
This function uses BFS to check for cycle in the graph. Pay Attention, this function work only with d...
Definition: Graph.hpp:1135
+
CXXGRAPH::Graph::removeEdge
virtual void removeEdge(unsigned long edgeId)
Function remove an Edge from the Graph Edge Set Note: No Thread Safe.
Definition: Graph.hpp:337
+
CXXGRAPH::Graph::writeToFile
virtual int writeToFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const
This function write the graph in an output file Note: No Thread Safe.
Definition: Graph.hpp:1348
+
CXXGRAPH::Graph::isDirectedGraph
virtual bool isDirectedGraph() const
This function checks if a graph is directed Note: No Thread Safe.
Definition: Graph.hpp:1204
+
CXXGRAPH::Graph::dial
virtual const DialResult dial(const Node< T > &source, int maxWeight) const
This function write the graph in an output file Note: No Thread Safe.
Definition: Graph.hpp:1220
+
CXXGRAPH::Graph::dijkstra
virtual const DijkstraResult dijkstra(const Node< T > &source, const Node< T > &target) const
Function runs the dijkstra algorithm for some source node and target node in the graph and returns th...
Definition: Graph.hpp:863
+
CXXGRAPH::Graph::isCyclicDirectedGraphDFS
virtual bool isCyclicDirectedGraphDFS() const
This function uses DFS to check for cycle in the graph. Pay Attention, this function work only with d...
Definition: Graph.hpp:1045
+
CXXGRAPH::Graph::addEdge
virtual void addEdge(const Edge< T > *edge)
Function add an Edge to the Graph Edge Set Note: No Thread Safe.
Definition: Graph.hpp:327
+
CXXGRAPH::Graph::partitionGraph
virtual PartitionMap< T > partitionGraph(PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const
This function partition a graph in a set of partitions Note: No Thread Safe.
Definition: Graph.hpp:1485
+
CXXGRAPH::Graph::readFromFile
virtual int readFromFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false)
This function read the graph from an input file Note: No Thread Safe.
Definition: Graph.hpp:1421
+
CXXGRAPH::Graph::getAdjMatrix
virtual const AdjacencyMatrix< T > getAdjMatrix() const
This function generate a list of adjacency matrix with every element of the matrix contain the node w...
Definition: Graph.hpp:836
+
CXXGRAPH::Graph::getNodeSet
virtual const std::list< const Node< T > * > getNodeSet() const
Function that return the Node Set of the Graph Note: No Thread Safe.
Definition: Graph.hpp:348
+
CXXGRAPH::Graph::breadth_first_search
virtual const std::vector< Node< T > > breadth_first_search(const Node< T > &start) const
Function performs the breadth first search algorithm over the graph Note: No Thread Safe.
Definition: Graph.hpp:973
+
CXXGRAPH::Graph::setEdgeSet
virtual void setEdgeSet(std::list< const Edge< T > * > &edgeSet)
Function set the Edge Set of the Graph Note: No Thread Safe.
Definition: Graph.hpp:313
+
CXXGRAPH::Node
Definition: Node.hpp:35
+
CXXGRAPH::ThreadSafe
Definition: ThreadSafe.hpp:30
+
CXXGRAPH::DialResult_struct
Struct that contains the information about Dijsktra's Algorithm results.
Definition: Typedef.hpp:71
+
CXXGRAPH::DijkstraResult_struct
Struct that contains the information about Dijsktra's Algorithm results.
Definition: Typedef.hpp:62
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d3/dd2/classCXXGRAPH_1_1Node.html b/docs/html/d3/dd2/classCXXGRAPH_1_1Node.html index f4b468c86..962916276 100644 --- a/docs/html/d3/dd2/classCXXGRAPH_1_1Node.html +++ b/docs/html/d3/dd2/classCXXGRAPH_1_1Node.html @@ -102,7 +102,7 @@  
The documentation for this class was generated from the following file: diff --git a/docs/html/d3/de1/classCXXGRAPH_1_1PARTITIONING_1_1Record.html b/docs/html/d3/de1/classCXXGRAPH_1_1PARTITIONING_1_1Record.html new file mode 100644 index 000000000..5ef8d9d3d --- /dev/null +++ b/docs/html/d3/de1/classCXXGRAPH_1_1PARTITIONING_1_1Record.html @@ -0,0 +1,124 @@ + + + + + + + +CXXGraph: CXXGRAPH::PARTITIONING::Record< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Public Member Functions | +List of all members
+
+
CXXGRAPH::PARTITIONING::Record< T > Class Template Referenceabstract
+
+
+
+Inheritance diagram for CXXGRAPH::PARTITIONING::Record< T >:
+
+
Inheritance graph
+ + + + +
[legend]
+ + + + + + + + + + + + + + + + + + +

+Public Member Functions

+virtual PartitionMap< T > & getPartitions ()=0
 
+virtual void addPartition (int m)=0
 
+virtual bool hasReplicaInPartition (int m)=0
 
+virtual bool getLock ()=0
 
+virtual bool releaseLock ()=0
 
+virtual int getReplicas ()=0
 
+virtual int getDegree ()=0
 
+virtual void incrementDegree ()=0
 
+
The documentation for this class was generated from the following file:
    +
  • /github/workspace/include/Partitioning/Record.hpp
    • +
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d4/d1e/ConstValue_8hpp_source.html b/docs/html/d4/d1e/ConstValue_8hpp_source.html new file mode 100644 index 000000000..6fa85eeff --- /dev/null +++ b/docs/html/d4/d1e/ConstValue_8hpp_source.html @@ -0,0 +1,113 @@ + + + + + + + +CXXGraph: /github/workspace/include/Utility/ConstValue.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
ConstValue.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __CONSTVALUE_H__
+
21 #define __CONSTVALUE_H__
+
22 
+
23 #pragma once
+
24 
+
25 #include <limits>
+
26 
+
27 namespace CXXGRAPH
+
28 {
+
29  constexpr double INF_DOUBLE = std::numeric_limits<double>::max();
+
30 }
+
31 
+
32 #endif // __CONSTVALUE_H__
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d5/d2e/classCXXGRAPH_1_1Runnable.html b/docs/html/d5/d2e/classCXXGRAPH_1_1Runnable.html new file mode 100644 index 000000000..dc5730a0a --- /dev/null +++ b/docs/html/d5/d2e/classCXXGRAPH_1_1Runnable.html @@ -0,0 +1,94 @@ + + + + + + + +CXXGraph: CXXGRAPH::Runnable Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Public Member Functions | +List of all members
+
+
CXXGRAPH::Runnable Class Referenceabstract
+
+
+ + + + +

+Public Member Functions

+virtual void run ()=0
 
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d5/d36/PartitionAlgorithm_8hpp_source.html b/docs/html/d5/d36/PartitionAlgorithm_8hpp_source.html new file mode 100644 index 000000000..e9f8684d3 --- /dev/null +++ b/docs/html/d5/d36/PartitionAlgorithm_8hpp_source.html @@ -0,0 +1,120 @@ + + + + + + + +CXXGraph: /github/workspace/include/Partitioning/PartitionAlgorithm.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
PartitionAlgorithm.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __CXXGRAPH_PARTITIONING_PARTITIONALGORITHM_H__
+
21 #define __CXXGRAPH_PARTITIONING_PARTITIONALGORITHM_H__
+
22 
+
23 #pragma once
+
24 
+
25 namespace CXXGRAPH
+
26 {
+
27  namespace PARTITIONING
+
28  {
+
30  enum E_PartitionAlgorithm
+
31  {
+
32  GREEDY_VC_ALG,
+
33  HDRF_ALG,
+
34  ALG_2
+
35  };
+
36  typedef E_PartitionAlgorithm PartitionAlgorithm;
+
37  }
+
38 }
+
39 
+
40 #endif // __CXXGRAPH_PARTITIONING_PARTITIONALGORITHM_H__
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d5/d64/Globals_8hpp_source.html b/docs/html/d5/d64/Globals_8hpp_source.html new file mode 100644 index 000000000..982003248 --- /dev/null +++ b/docs/html/d5/d64/Globals_8hpp_source.html @@ -0,0 +1,147 @@ + + + + + + + +CXXGraph: /github/workspace/include/Partitioning/Utility/Globals.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Globals.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __CXXGRAPH_PARTITIONING_GLOBALS_H__
+
21 #define __CXXGRAPH_PARTITIONING_GLOBALS_H__
+
22 
+
23 #pragma once
+
24 
+
25 #include <thread>
+
26 #include "Partitioning/PartitionAlgorithm.hpp"
+
27 
+
28 
+
29 namespace CXXGRAPH {
+
30  namespace PARTITIONING {
+
31  class Globals
+
32  {
+
33  private:
+
34  public:
+
35  Globals(int numberOfPartiton, double lambda = 1, PartitionAlgorithm algorithm = PartitionAlgorithm::HDRF_ALG, unsigned int threads = std::thread::hardware_concurrency());
+
36  ~Globals();
+
37 
+
38  void print();
+
39 
+
40  //CONSTANT
+
41  const int SLEEP_LIMIT = 1024;
+
42  const int PLACES = 4;
+
43 
+
44  int numberOfPartition; //number of partitions
+
45  //OPTIONAL
+
46  PartitionAlgorithm partitionStategy;
+
47  double lambda;
+
48  unsigned int threads;
+
49  };
+
50 
+
51  inline Globals::Globals(int numberOfPartiton, double lambda, PartitionAlgorithm algorithm, unsigned int threads)
+
52  {
+
53  this->numberOfPartition = numberOfPartiton;
+
54  this->partitionStategy = algorithm;
+
55  this->lambda = lambda;
+
56  this->threads = threads;
+
57  }
+
58 
+
59  inline Globals::~Globals()
+
60  {
+
61  }
+
62  }
+
63 }
+
64 
+
65 #endif // __CXXGRAPH_PARTITIONING_GLOBALS_H__
+
CXXGRAPH::PARTITIONING::Globals
Definition: Globals.hpp:32
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d5/d80/CXXGraph_8hpp_source.html b/docs/html/d5/d80/CXXGraph_8hpp_source.html new file mode 100644 index 000000000..938b069c9 --- /dev/null +++ b/docs/html/d5/d80/CXXGraph_8hpp_source.html @@ -0,0 +1,107 @@ + + + + + + + +CXXGraph: /github/workspace/include/CXXGraph.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
CXXGraph.hpp
+
+
+
1 #ifndef __CXXGRAPH_H__
+
2 #define __CXXGRAPH_H__
+
3 
+
4 #include "CXXGraphConfig.h"
+
5 #include "Edge/Edge.hpp"
+
6 #include "Edge/DirectedEdge.hpp"
+
7 #include "Edge/DirectedWeightedEdge.hpp"
+
8 #include "Edge/UndirectedEdge.hpp"
+
9 #include "Edge/UndirectedWeightedEdge.hpp"
+
10 #include "Edge/Weighted.hpp"
+
11 #include "Graph/Graph.hpp"
+
12 #include "Graph/Graph_TS.hpp"
+
13 #include "Node/Node.hpp"
+
14 #include "Partitioning/Partition.hpp"
+
15 #include "Partitioning/CoordinatedPartitionState.hpp"
+
16 #include "Partitioning/CoordinatedRecord.hpp"
+
17 #include "Partitioning/HDRF.hpp"
+
18 #include "Partitioning/PartitionAlgorithm.hpp"
+
19 #include "Partitioning/Partitioner.hpp"
+
20 #include "Partitioning/PartitionerThread.hpp"
+
21 #include "Partitioning/PartitioningStats.hpp"
+
22 #include "Partitioning/PartitionState.hpp"
+
23 #include "Partitioning/PartitionStrategy.hpp"
+
24 #include "Partitioning/Record.hpp"
+
25 
+
26 #endif // __CXXGRAPH_H__
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d5/d93/structCXXGRAPH_1_1DialResult__struct.html b/docs/html/d5/d93/structCXXGRAPH_1_1DialResult__struct.html index 9e751f670..ddf86fa92 100644 --- a/docs/html/d5/d93/structCXXGRAPH_1_1DialResult__struct.html +++ b/docs/html/d5/d93/structCXXGRAPH_1_1DialResult__struct.html @@ -79,7 +79,7 @@

Struct that contains the information about Dijsktra's Algorithm results. More...

-

#include <Graph.hpp>

+

#include <Typedef.hpp>

@@ -96,7 +96,7 @@

Detailed Description

Struct that contains the information about Dijsktra's Algorithm results.

The documentation for this struct was generated from the following file: diff --git a/docs/html/d5/db2/UndirectedEdge_8hpp_source.html b/docs/html/d5/db2/UndirectedEdge_8hpp_source.html new file mode 100644 index 000000000..1414f0d28 --- /dev/null +++ b/docs/html/d5/db2/UndirectedEdge_8hpp_source.html @@ -0,0 +1,188 @@ + + + + + + + +CXXGraph: /github/workspace/include/Edge/UndirectedEdge.hpp Source File + + + + + + + + + +
+
+

Public Attributes

+ + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+ + + + + + + + + +
+
+ + +
+ +
+ + + +
+
+
UndirectedEdge.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __UNDIRECTEDEDGE_H__
+
21 #define __UNDIRECTEDEDGE_H__
+
22 
+
23 #pragma once
+
24 
+
25 #include "Edge.hpp"
+
26 
+
27 namespace CXXGRAPH
+
28 {
+
29 
+
30  template <typename T>
+
31  class UndirectedEdge;
+
32 
+
33  // ostream operator
+
34  template <typename T>
+
35  std::ostream &operator<<(std::ostream &o, const UndirectedEdge<T> &edge);
+
36 
+
37  template <typename T>
+
38  class UndirectedEdge : public Edge<T>
+
39  {
+
40  public:
+
41  UndirectedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2);
+
42  UndirectedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair);
+
43  UndirectedEdge(const Edge<T> &edge);
+
44  virtual ~UndirectedEdge() = default;
+
45  const Node<T> &getNode1() const;
+
46  const Node<T> &getNode2() const;
+
47  const std::optional<bool> isDirected() const override;
+
48  const std::optional<bool> isWeighted() const override;
+
49  //operator
+
50  explicit operator DirectedEdge<T>() const { return DirectedEdge<T>(Edge<T>::getId(), Edge<T>::getNodePair()); }
+
51 
+
52  friend std::ostream &operator<<<>(std::ostream &os, const UndirectedEdge<T> &edge);
+
53  };
+
54 
+
55  template <typename T>
+
56  UndirectedEdge<T>::UndirectedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2) : Edge<T>(id, node1, node2)
+
57  {
+
58  }
+
59 
+
60  template <typename T>
+
61  UndirectedEdge<T>::UndirectedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair) : Edge<T>(id, nodepair)
+
62  {
+
63  }
+
64 
+
65  template <typename T>
+
66  UndirectedEdge<T>::UndirectedEdge(const Edge<T> &edge) : UndirectedEdge(edge.getId(), *(edge.getNodePair().first), *(edge.getNodePair().second))
+
67  {
+
68  }
+
69 
+
70  template <typename T>
+
71  const Node<T> &UndirectedEdge<T>::getNode1() const
+
72  {
+
73  return *(Edge<T>::getNodePair().first);
+
74  }
+
75 
+
76  template <typename T>
+
77  const Node<T> &UndirectedEdge<T>::getNode2() const
+
78  {
+
79  return *(Edge<T>::getNodePair().second);
+
80  }
+
81 
+
82  template <typename T>
+
83  const std::optional<bool> UndirectedEdge<T>::isDirected() const
+
84  {
+
85  return false;
+
86  }
+
87 
+
88  template <typename T>
+
89  const std::optional<bool> UndirectedEdge<T>::isWeighted() const
+
90  {
+
91  return false;
+
92  }
+
93 
+
94  template <typename T>
+
95  std::ostream &operator<<(std::ostream &os, const UndirectedEdge<T> &edge)
+
96  {
+
97  os << "((Node: " << edge.getNode1().getId() << ")) <----- |Edge: #" << edge.getId() << "|-----> ((Node: " << edge.getNode2().getId() << "))";
+
98  return os;
+
99  }
+
100 }
+
101 
+
102 
+
103 #endif // __UNDIRECTEDEDGE_H__
+
CXXGRAPH::DirectedEdge
Definition: DirectedEdge.hpp:39
+
CXXGRAPH::Edge
Definition: Edge.hpp:40
+
CXXGRAPH::Node
Definition: Node.hpp:35
+
CXXGRAPH::UndirectedEdge
Definition: UndirectedEdge.hpp:39
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d6/d2c/classCXXGRAPH_1_1PARTITIONING_1_1Partition__coll__graph.map b/docs/html/d6/d2c/classCXXGRAPH_1_1PARTITIONING_1_1Partition__coll__graph.map new file mode 100644 index 000000000..3ea66c752 --- /dev/null +++ b/docs/html/d6/d2c/classCXXGRAPH_1_1PARTITIONING_1_1Partition__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/docs/html/d6/d2c/classCXXGRAPH_1_1PARTITIONING_1_1Partition__coll__graph.md5 b/docs/html/d6/d2c/classCXXGRAPH_1_1PARTITIONING_1_1Partition__coll__graph.md5 new file mode 100644 index 000000000..567e0cbbd --- /dev/null +++ b/docs/html/d6/d2c/classCXXGRAPH_1_1PARTITIONING_1_1Partition__coll__graph.md5 @@ -0,0 +1 @@ +aa7e9bcf9adf5f0ec33e547fa0857a92 \ No newline at end of file diff --git a/docs/html/d6/d2c/classCXXGRAPH_1_1PARTITIONING_1_1Partition__coll__graph.png b/docs/html/d6/d2c/classCXXGRAPH_1_1PARTITIONING_1_1Partition__coll__graph.png new file mode 100644 index 0000000000000000000000000000000000000000..87631278a151f53d4e47937428fdd738221c1a8a GIT binary patch literal 6031 zcmch5Wl)sS+xH?3(u$;n2uQkg=PD`PBCW&%(zUR33R2Q7EiOxUgMff^NePmYB7!u} zVg57EJkLAt%=_(~o!$L#@1FbI=en+6MQW%i5E0N2Kp+qzB}JGP_#Opse>@!UnZ2*7 z4!&?KR1{#4o7-1zYjGk3@&Kj;lhyIc+*?E#=)8W2`}?4ygI!;il$2spYvwZyn>RiT zj#t+Zi1O;DJW_HJcF=Ztb%C5MTLLIi`msQlp+#FCFaK7k}ogIOgOo?A>>|&#$f)rWg-n=QAZVK;nc6F6^a}(I!-WHg% zvbKgFAD^7`F0~?v4kR9JS`nX}oq1iKZDPmrTlU_Kxf;J5Yxno(*Ey$(Ps3m=)vGdV&j0?B|99|%jrpVPL{U5%&HE%tnVDJ4?_9v} z<;#h$iELA=R1>Vi!YTIl_UuedfgBthC7(V;B_t&DFD+$z?9CNATEpQgd}*pzEk#9P zlw1ZfSz_)VKYijjb_tb}EiW%$TVH>sU92{h{_@CKhvR;hw10L>YwHssA-#jTbT4mj zO(Uc9&MWKP%poRT-dLaG?bp*#{m%xnmc7x?ozy19LM^+{?yNZhnd9T*wVyxb5GT81 z2IU&;{oUR2eh^(99gP&8S2lym+yxr!Hp?A>0&kZjVx+?6N_053XV45N<3_Er_ajml z(LVq7QONS0+&2FkDU4jpzW1dm^r9{yboBH}97zem!I)DsGw{D-f@;RbbZ6)1b+cjp z4UjZGHrHi{Eqp?|AzvX@u29ST^7N2qkei#^d1sotqxWjy%?WMzR=AWY@sN0qX*Q=&`b#-+m<>k-8?y?d4qHbHG z7=Gt}Wqo{_p3l$D8i%*@P^l9Gt+ogLeYlfAX=?N5%Jl<#ckYHW2hHD$4} zu_tTc`pRl*MJ+87RW&sQBvPjV`%A4V;Uo;K@rp3%o6G8HAy-$|ClV5w=O=sf77k%1 zfyDG;FcTA#8kcqDCclfi&c^K{owhsi_&Ef^0s_nD$2+9&zWA7O8`-%YEJ=!pi^I8S z#oS7IX=e}GZ%kTw7#U?+7nYVD?o6Y)*>ZgE#4BP!PB${%LLi{vIFOLAFlK&!3L+vR znt2lEfi1Kic@_N#v9q(23KWUf z+6I962~9{K2So{XNZ~alCL|;*C@3&nYVmIHJ}OdjkdTzrG&cTRi7GUIb%ely2qvn-0E{bFfcG8 zDyl1vNggW}PV7LF`{U;Np9cHAIORg4ojaJAWE2#b5D~-)*EHHRc0~GyZe?ZV_rHG% zIyxVoBjg==qp5@E=8Ou8itHRzSQA$OUi$2OP-KaSj)vLVJ^@(vd$|+S%F4>@=K6{T zP2+#s%`k+lf2*RJraciz3@Ot`_Xc9(l0JA4&ftGZW{Ny3eE!4K|LT7G)k((r*;JW6 zxE}^&TYov+eP@~oiA0{B@1UK3FU#ua>f)zo@O=65Ma20h)~B*EsNE!cb?lAeke?bJ z1+OI=D{BHcMo`|^{U7b>?U#QDQ3jPkySuwv;R(J2U9Sm>8nR zY-|){)Kg(4hmygqt&$Gkt3s7kR7wFBkB^UUdA48Bf1jV%*3={;`_;y$XK1Jd*#fQa zw%mbHRb8Fm)Fc)oB<``xsGy)=XJa!eKHME*(kt{v&D+}>0CeGgHK-W@0l~+rDn1S# zo}$CmzQoW_Y+XG)EfbT67`grZil0hKasiHO);liRfZ-KGcX|8xjDN4To*F^FYJSdu zJY{mlBcQG3U(7@9pWIQv3NORK-H zFPw!Ozp<%FOGATneRGpSbCuY`({twZGBjdqHCDQ4I7?jH+q+TIA$=Dd)#c@-B6GY3 zAWoaE5PY}wf%{;~c2F7R!UTZgzi$5k7;Bv| z>8qM4LMDBEYWXt7LhsTYr+1Etm~`SPfbHV_sbazZB~q3lP*wrW*`WcEg<%G#IztXJLmjo>x-Hr~}Q|4{F4sESLhA^ss= z6OWTq<=7Q`SiR1IcSog4(dBxubMM_-b16J;G%oMiU)tlwPk%5wW@3l z8!>BZ@z1Zy&a};*Jc+4aR?iYsE#rnW3|)h3QvB9P49Mx_k>^|kc@arY*KN5Xpco=D z(fA!07OD{9|5F?Or=tI#eu5X9*g8a|8Qg@po$sb8Kwv_u=7Ki65ZO{(*t6 zPr79Sy`zF^VA7vj^xzGp3lfq?!WLP1c!)7^?v8GWJO6~i6cjAi`s2Cx#VzX&*=waF zHUS2&l%d1F;Dym(MnH`kD{g;4T-e4|t4aw6w^1UNvDAYDH#CBA6v4 zj4h?HaB(fSM)QpH5tf#ghvO=|OcD}wkeXiMItH@^XXX!vCV}tiM1w*?uv9aIhzt!4 z6;)M3V9c_rs&{E^K&@EIQ0U9rSEb7fT11|0=OzKO8kx!dXa`KO$N*-Cjh zm-akn%uO8f@0bFWl&^@Ewsw4cd|)I6o5gBx3?NS$hgf>?Fn;Ud)E0E~FY5tk=8$E` z*L4@)^IyfO{MN)_M6@`7s@;B#V?&|P1|XP$4#j}@U+tJ`nwY%D#3hyiI_K*Am`WNc z0fboD!$A#NW;w9CBDJij`X5Nzlamvm6Xeaz7~c$MMrMh7ZlkIJ)<#4`$T&D~D=RBc z4gzVylrl(m|9&Wt9r8RWJM{7_B>YPTs)YQ`}a=huKeY>1l*Giv zrCRphd9{~GRP?)9D|5W!YK2KJ6&Gzz`;pLNza&~qc78Vw6*9s1$FPxpBKv9{2&UDFgcXywyg+Bn6Ef_onCgdIg zHfRwtQc_4H?2f6aDV?~7>H!rj1n57j*RRb-b7g6Eu21UQnSjJyb-p-ph!F}Wrtivl z+g5s951oHntLNwH_(IrmA)vUp_}uNnd}(Qkots-%y1u5S2baM&U~SC`7VKKDAay%*B0|Uy7=ra)^At9jJ`f6+^1bWpJ z6-T|vIt{{Zhk85R^<`B>#i-bx@7a0^6hMLfQVTVwez}0p=j8J=pG-U^5t;1l><0H8 z%834D{{r5&(>s)ulm-n>Og~pwp;rB*4Gj%ci@jgIU>6n^(#)U#olwUR!13Olt)#IO zlrC9!5%oA&ig~P(YzAZ}s6yOVtCG^vPTIFEd1D8YrP?(5c5b2F3wIq>HSMMZH>W32 zFNGIcyeSAmy_DUClzUI1jZdrr`hXM+9w-B|uXZXG@5yUU8J>ZiCF;U5{n;=WL_LgvCj2i~8GwI@0v?w^yGV6xex$2QZs#fk`uCW^B{NkH zM)C@K7Wk>I?rw&8V(VQcQZTKc{`eHEHe8#CmH&}cJ)K{iRVUQmj~1HxmLUuUIS!qe zTYrH&sxws_m1a)INS`hh&BAQlj-&@kLr8x9BOtYTY>d^_)mt%aZC}A7A|r1(3Bo8U zO8xBFGlOQ2JjUM4%0B)rN%y^R0^ov-OCbUD0y)^wg_$2SCoPt%Si~W(P~H zctk{Bg0KlEWlw(<=Qtg0ytwta->Y8FHoCF_`Chxt%fZnF^gGmgm`?U$8?;)-hbP)` z2?@+1(dx8Fk^*@Z&*$wxx%3YW>7YG5J^S9aUlk$CwMuUv-oVI6>d(n*K5CGBO#LXN z;eT`Ywr397E{G)&Cn3f>eIV1jwZ{w$3=K_9AAv32-`@uv+yNl3(*FiI`~AB)IDykX z>FdM(T1Y@n4ug=xTnNwwEub}l(vh{XDd|mN%FzW?HEQB-%FDyhD!msP8oGTTC%C!0 z%f&7M`MrZ~w~N_XSqTJQB^S`5lZ(rE1FHDf`&D4W%#XLHs08iqQF0rF08K&oDZdfu z8Z+Q{y*9HvdHX{7%xo*B!F_gru=QevHkgp4|h6c@&s(;8D%N3~V27 zoDKxMdq)`c?ww#V;HNzG94T(c?y0H!eitXtWMwgc&0k(y!$KesoyP+DMn+NZ9`Jsw ztE0rgz<5J{q11!H7Z1E5$aa>&X6NhQT7oErk$G}*a?75VJW@kjJOAii`1v$87S?TR zHa0d=0Wav{;-X<}91W7ItONIS5RW_p;tr&fv+e%UfQ$jGhL4VF#F&clB^mQ5cz6f_ zCwD6sXlSC^FV}f#OxF;4lGP8$Zo8?X;wgyGRI??hK~T~)TWL84@+&T*8b#|1eG_l& zGCkDzncow?9l)fM4{*D>y5h34-#0XffG~(wH$OZa_szHTP|$&SrtQenwM6yk?P7H# zQc5jbB64fXhJ}^Y0`xgu_RUIjB{lz@A2HtyIR764-{zv_-!2(7T=a!(|M zgD#2X-ZY3kYLSMzoHEhS)k6dbsQ-JR9?1Ay6JBq&&JDI;;dLox3->HY*da>K)L`Xu HWquC literal 0 HcmV?d00001 diff --git a/docs/html/d6/d85/DirectedEdge_8hpp_source.html b/docs/html/d6/d85/DirectedEdge_8hpp_source.html new file mode 100644 index 000000000..031a57063 --- /dev/null +++ b/docs/html/d6/d85/DirectedEdge_8hpp_source.html @@ -0,0 +1,189 @@ + + + + + + + +CXXGraph: /github/workspace/include/Edge/DirectedEdge.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
DirectedEdge.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __DIRECTEDEDGE_H__
+
21 #define __DIRECTEDEDGE_H__
+
22 
+
23 #pragma once
+
24 
+
25 #include "Edge.hpp"
+
26 
+
27 namespace CXXGRAPH
+
28 {
+
29  template <typename T>
+
30  class UndirectedEdge;
+
31 
+
32  template <typename T>
+
33  class DirectedEdge;
+
34  // ostream operator
+
35  template <typename T>
+
36  std::ostream &operator<<(std::ostream &o, const DirectedEdge<T> &edge);
+
37  template <typename T>
+
38  class DirectedEdge : public Edge<T>
+
39  {
+
40  public:
+
41  DirectedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2);
+
42  DirectedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair);
+
43  DirectedEdge(const Edge<T> &edge);
+
44  virtual ~DirectedEdge() = default;
+
45  const Node<T> &getFrom() const;
+
46  const Node<T> &getTo() const;
+
47  const std::optional<bool> isDirected() const override;
+
48  const std::optional<bool> isWeighted() const override;
+
49  //operator
+
50  explicit operator UndirectedEdge<T>() const { return UndirectedEdge<T>(Edge<T>::getId(), Edge<T>::getNodePair()); }
+
51 
+
52  friend std::ostream &operator<<<>(std::ostream &os, const DirectedEdge<T> &edge);
+
53  };
+
54 
+
55  template <typename T>
+
56  DirectedEdge<T>::DirectedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2) : Edge<T>(id, node1, node2)
+
57  {
+
58  }
+
59 
+
60  template <typename T>
+
61  DirectedEdge<T>::DirectedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair) : Edge<T>(id, nodepair)
+
62  {
+
63  }
+
64 
+
65  template <typename T>
+
66  DirectedEdge<T>::DirectedEdge(const Edge<T> &edge) : DirectedEdge(edge.getId(), *(edge.getNodePair().first), *(edge.getNodePair().second))
+
67  {
+
68  }
+
69 
+
70  template <typename T>
+
71  const Node<T> &DirectedEdge<T>::getFrom() const
+
72  {
+
73  return *(Edge<T>::getNodePair().first);
+
74  }
+
75 
+
76  template <typename T>
+
77  const Node<T> &DirectedEdge<T>::getTo() const
+
78  {
+
79  return *(Edge<T>::getNodePair().second);
+
80  }
+
81 
+
82  template <typename T>
+
83  const std::optional<bool> DirectedEdge<T>::isDirected() const
+
84  {
+
85  return true;
+
86  }
+
87 
+
88  template <typename T>
+
89  const std::optional<bool> DirectedEdge<T>::isWeighted() const
+
90  {
+
91  return false;
+
92  }
+
93 
+
94 
+
95 
+
96  template <typename T>
+
97  std::ostream &operator<<(std::ostream &os, const DirectedEdge<T> &edge)
+
98  {
+
99  os << "((Node: " << edge.getFrom().getId() << ")) +----- |Edge: #" << edge.getId() << "|-----> ((Node: " << edge.getTo().getId() << "))";
+
100  return os;
+
101  }
+
102 }
+
103 
+
104 #endif // __DIRECTEDEDGE_H__
+
CXXGRAPH::DirectedEdge
Definition: DirectedEdge.hpp:39
+
CXXGRAPH::Edge
Definition: Edge.hpp:40
+
CXXGRAPH::Node
Definition: Node.hpp:35
+
CXXGRAPH::UndirectedEdge
Definition: UndirectedEdge.hpp:39
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d6/d85/PartitionStrategy_8hpp_source.html b/docs/html/d6/d85/PartitionStrategy_8hpp_source.html new file mode 100644 index 000000000..932d1df11 --- /dev/null +++ b/docs/html/d6/d85/PartitionStrategy_8hpp_source.html @@ -0,0 +1,125 @@ + + + + + + + +CXXGraph: /github/workspace/include/Partitioning/PartitionStrategy.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
PartitionStrategy.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __CXXGRAPH_PARTITIONING_PARTITIONSTRATEGY_H__
+
21 #define __CXXGRAPH_PARTITIONING_PARTITIONSTRATEGY_H__
+
22 
+
23 #pragma once
+
24 
+
25 #include "Edge/Edge.hpp"
+
26 #include "PartitionState.hpp"
+
27 
+
28 namespace CXXGRAPH
+
29 {
+
30  namespace PARTITIONING
+
31  {
+
32  template <typename T>
+
33  class PartitionStrategy
+
34  {
+
35  public:
+
36  virtual void performStep(Edge<T> &t, PartitionState<T> &Sstate) = 0;
+
37  };
+
38  }
+
39 }
+
40 
+
41 #endif // __CXXGRAPH_PARTITIONING_PARTITIONSTRATEGY_H__
+
CXXGRAPH::Edge
Definition: Edge.hpp:40
+
CXXGRAPH::PARTITIONING::PartitionState
Definition: PartitionState.hpp:31
+
CXXGRAPH::PARTITIONING::PartitionStrategy
Definition: PartitionStrategy.hpp:34
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d7/d1b/classCXXGRAPH_1_1PARTITIONING_1_1PartitionerThread.html b/docs/html/d7/d1b/classCXXGRAPH_1_1PARTITIONING_1_1PartitionerThread.html new file mode 100644 index 000000000..aaae2c15e --- /dev/null +++ b/docs/html/d7/d1b/classCXXGRAPH_1_1PARTITIONING_1_1PartitionerThread.html @@ -0,0 +1,104 @@ + + + + + + + +CXXGraph: CXXGRAPH::PARTITIONING::PartitionerThread< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Public Member Functions | +Public Attributes | +List of all members
+
+
CXXGRAPH::PARTITIONING::PartitionerThread< T > Class Template Reference
+
+
+ + + + + + +

+Public Member Functions

+ PartitionerThread (std::vector< Edge< T >> &list, PartitionState< T > *state, PartitionStrategy< T > &algorithm, std::list< int > *ids)
 
+void run ()
 
+ + + +

+Public Attributes

+std::list< int > * id_partitions
 
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/d7/d24/classCXXGRAPH_1_1UndirectedWeightedEdge.html b/docs/html/d7/d24/classCXXGRAPH_1_1UndirectedWeightedEdge.html index 5df46171f..3a097a301 100644 --- a/docs/html/d7/d24/classCXXGRAPH_1_1UndirectedWeightedEdge.html +++ b/docs/html/d7/d24/classCXXGRAPH_1_1UndirectedWeightedEdge.html @@ -186,8 +186,9 @@ std::ostream & operator<< (std::ostream &os, const UndirectedWeightedEdge< T > &edge)   -
The documentation for this class was generated from the following file:
    -
  • /github/workspace/include/Graph.hpp
    • +
    The documentation for this class was generated from the following files: diff --git a/docs/html/d7/d2a/classCXXGRAPH_1_1Edge.html b/docs/html/d7/d2a/classCXXGRAPH_1_1Edge.html index 9b4b76082..83f873efa 100644 --- a/docs/html/d7/d2a/classCXXGRAPH_1_1Edge.html +++ b/docs/html/d7/d2a/classCXXGRAPH_1_1Edge.html @@ -123,7 +123,7 @@  
    The documentation for this class was generated from the following file: diff --git a/docs/html/d7/d41/classCXXGRAPH_1_1PARTITIONING_1_1Partition-members.html b/docs/html/d7/d41/classCXXGRAPH_1_1PARTITIONING_1_1Partition-members.html new file mode 100644 index 000000000..c894dcea0 --- /dev/null +++ b/docs/html/d7/d41/classCXXGRAPH_1_1PARTITIONING_1_1Partition-members.html @@ -0,0 +1,111 @@ + + + + + + + +CXXGraph: Member List + + + + + + + + + +
    +
    + + + + + + + +
    +
    CXXGraph +  0.1.6 +
    +
    CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +
    CXXGRAPH::PARTITIONING::Partition< T > Member List
    +
    +
    + +

    This is the complete list of members for CXXGRAPH::PARTITIONING::Partition< T >, including all inherited members.

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    addEdge(const Edge< T > *edge)CXXGRAPH::Graph< T >virtual
    breadth_first_search(const Node< T > &start) constCXXGRAPH::Graph< T >virtual
    depth_first_search(const Node< T > &start) constCXXGRAPH::Graph< T >virtual
    dial(const Node< T > &source, int maxWeight) constCXXGRAPH::Graph< T >virtual
    dijkstra(const Node< T > &source, const Node< T > &target) constCXXGRAPH::Graph< T >virtual
    getAdjMatrix() constCXXGRAPH::Graph< T >virtual
    getEdge(unsigned long edgeId) constCXXGRAPH::Graph< T >virtual
    getEdgeSet() constCXXGRAPH::Graph< T >virtual
    getNodeSet() constCXXGRAPH::Graph< T >virtual
    getPartitionId() constCXXGRAPH::PARTITIONING::Partition< T >
    Graph()=default (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
    Graph(const std::list< const Edge< T > * > &edgeSet) (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
    isCyclicDirectedGraphBFS() constCXXGRAPH::Graph< T >virtual
    isCyclicDirectedGraphDFS() constCXXGRAPH::Graph< T >virtual
    isDirectedGraph() constCXXGRAPH::Graph< T >virtual
    Partition() (defined in CXXGRAPH::PARTITIONING::Partition< T >)CXXGRAPH::PARTITIONING::Partition< T >
    Partition(unsigned int partitionId) (defined in CXXGRAPH::PARTITIONING::Partition< T >)CXXGRAPH::PARTITIONING::Partition< T >
    Partition(const std::list< const Edge< T > * > &edgeSet) (defined in CXXGRAPH::PARTITIONING::Partition< T >)CXXGRAPH::PARTITIONING::Partition< T >
    Partition(unsigned int partitionId, const std::list< const Edge< T > * > &edgeSet) (defined in CXXGRAPH::PARTITIONING::Partition< T >)CXXGRAPH::PARTITIONING::Partition< T >
    partitionGraph(PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) constCXXGRAPH::Graph< T >virtual
    readFromFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false)CXXGRAPH::Graph< T >virtual
    removeEdge(unsigned long edgeId)CXXGRAPH::Graph< T >virtual
    setEdgeSet(std::list< const Edge< T > * > &edgeSet)CXXGRAPH::Graph< T >virtual
    setPartitionId(unsigned int partitionId)CXXGRAPH::PARTITIONING::Partition< T >
    writeToFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) constCXXGRAPH::Graph< T >virtual
    ~Graph()=default (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
    ~Partition()=default (defined in CXXGRAPH::PARTITIONING::Partition< T >)CXXGRAPH::PARTITIONING::Partition< T >
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/docs/html/d7/d59/CoordinatedRecord_8hpp_source.html b/docs/html/d7/d59/CoordinatedRecord_8hpp_source.html new file mode 100644 index 000000000..282fb96de --- /dev/null +++ b/docs/html/d7/d59/CoordinatedRecord_8hpp_source.html @@ -0,0 +1,210 @@ + + + + + + + +CXXGraph: /github/workspace/include/Partitioning/CoordinatedRecord.hpp Source File + + + + + + + + + +
    +
    + + + + + + + +
    +
    CXXGraph +  0.1.6 +
    +
    CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +
    CoordinatedRecord.hpp
    +
    +
    +
    1 /***********************************************************/
    +
    2 /*** ______ ____ ______ _ ***/
    +
    3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
    +
    4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
    +
    5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
    +
    6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
    +
    7 /*** |_| ***/
    +
    8 /***********************************************************/
    +
    9 /*** Header-Only C++ Library for Graph ***/
    +
    10 /*** Representation and Algorithms ***/
    +
    11 /***********************************************************/
    +
    12 /*** Author: ZigRazor ***/
    +
    13 /*** E-Mail: zigrazor@gmail.com ***/
    +
    14 /***********************************************************/
    +
    15 /*** Collaboration: ----------- ***/
    +
    16 /***********************************************************/
    +
    17 /*** License: AGPL v3.0 ***/
    +
    18 /***********************************************************/
    +
    19 
    +
    20 #ifndef __CXXGRAPH_PARTITIONING_COORDINATEDRECORD_H__
    +
    21 #define __CXXGRAPH_PARTITIONING_COORDINATEDRECORD_H__
    +
    22 
    +
    23 #pragma once
    +
    24 
    +
    25 #include "Utility/Typedef.hpp"
    +
    26 
    +
    27 namespace CXXGRAPH
    +
    28 {
    +
    29  namespace PARTITIONING
    +
    30  {
    +
    31 
    +
    32  template <typename T>
    +
    33  class CoordinatedRecord : public Record<T>
    +
    34  {
    +
    35  private:
    +
    36  PartitionMap<T> partitions;
    +
    37  std::mutex lock;
    +
    38  int degree;
    +
    39 
    +
    40  public:
    +
    41  CoordinatedRecord();
    +
    42  ~CoordinatedRecord();
    +
    43 
    +
    44  PartitionMap<T> &getPartitions();
    +
    45  void addPartition(int m);
    +
    46  bool hasReplicaInPartition(int m);
    +
    47  bool getLock();
    +
    48  bool releaseLock();
    +
    49  int getReplicas();
    +
    50  int getDegree();
    +
    51  void incrementDegree();
    +
    52 
    +
    53  void addAll(std::set<int> &set);
    +
    54  static std::set<int> intersection(CoordinatedRecord &x, CoordinatedRecord &y);
    +
    55  };
    +
    56  template <typename T>
    +
    57  CoordinatedRecord<T>::CoordinatedRecord() : partitions(), lock()
    +
    58  {
    +
    59  degree = 0;
    +
    60  }
    +
    61  template <typename T>
    +
    62  CoordinatedRecord<T>::~CoordinatedRecord()
    +
    63  {
    +
    64  }
    +
    65  template <typename T>
    +
    66  PartitionMap<T> &CoordinatedRecord<T>::getPartitions()
    +
    67  {
    +
    68  return partitions;
    +
    69  }
    +
    70  template <typename T>
    +
    71  void CoordinatedRecord<T>::addPartition(int m)
    +
    72  {
    +
    73  if (m == -1)
    +
    74  {
    +
    75  std::cout << "ERROR! record.addPartition(-1)" << std::endl;
    +
    76  exit(-1);
    +
    77  }
    +
    78  partitions.insert(m);
    +
    79  }
    +
    80  template <typename T>
    +
    81  bool CoordinatedRecord<T>::hasReplicaInPartition(int m)
    +
    82  {
    +
    83  return partitions.find(m) != partitions.end();
    +
    84  }
    +
    85  template <typename T>
    +
    86  bool CoordinatedRecord<T>::getLock()
    +
    87  {
    +
    88  return lock.try_lock();
    +
    89  }
    +
    90  template <typename T>
    +
    91  bool CoordinatedRecord<T>::releaseLock()
    +
    92  {
    +
    93  lock.unlock();
    +
    94  return true;
    +
    95  }
    +
    96  template <typename T>
    +
    97  int CoordinatedRecord<T>::getReplicas()
    +
    98  {
    +
    99  return partitions.size();
    +
    100  }
    +
    101  template <typename T>
    +
    102  int CoordinatedRecord<T>::getDegree()
    +
    103  {
    +
    104  return degree;
    +
    105  }
    +
    106  template <typename T>
    +
    107  void CoordinatedRecord<T>::incrementDegree()
    +
    108  {
    +
    109  degree++;
    +
    110  }
    +
    111  template <typename T>
    +
    112  void CoordinatedRecord<T>::addAll(std::set<int> &set)
    +
    113  {
    +
    114  partitions.insert(set.begin(), set.end());
    +
    115  }
    +
    116  template <typename T>
    +
    117  std::set<int> CoordinatedRecord<T>::intersection(CoordinatedRecord &x, CoordinatedRecord &y)
    +
    118  {
    +
    119  std::set<int> result;
    +
    120  set_intersection(x.partitions.begin(), x.partitions.end(), y.partitions.begin(), y.partitions.end(),
    +
    121  std::inserter(result, result.begin()));
    +
    122  return result;
    +
    123  }
    +
    124  }
    +
    125 }
    +
    126 
    +
    127 #endif // __CXXGRAPH_PARTITIONING_COORDINATEDRECORD_H__
    +
    CXXGRAPH::PARTITIONING::CoordinatedRecord
    Definition: CoordinatedRecord.hpp:34
    +
    CXXGRAPH::PARTITIONING::Record
    Definition: Record.hpp:29
    +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/docs/html/d7/d70/classCXXGRAPH_1_1PARTITIONING_1_1PartitioningStats-members.html b/docs/html/d7/d70/classCXXGRAPH_1_1PARTITIONING_1_1PartitioningStats-members.html new file mode 100644 index 000000000..0b7580a04 --- /dev/null +++ b/docs/html/d7/d70/classCXXGRAPH_1_1PARTITIONING_1_1PartitioningStats-members.html @@ -0,0 +1,98 @@ + + + + + + + +CXXGraph: Member List + + + + + + + + + +
    +
    + + + + + + + +
    +
    CXXGraph +  0.1.6 +
    +
    CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +
    CXXGRAPH::PARTITIONING::PartitioningStats Member List
    +
    +
    + +

    This is the complete list of members for CXXGRAPH::PARTITIONING::PartitioningStats, including all inherited members.

    + + + + + + + + + + + + + + + +
    balanceEdgesFactor (defined in CXXGRAPH::PARTITIONING::PartitioningStats)CXXGRAPH::PARTITIONING::PartitioningStats
    balanceNodesFactor (defined in CXXGRAPH::PARTITIONING::PartitioningStats)CXXGRAPH::PARTITIONING::PartitioningStats
    edgesReplicationFactor (defined in CXXGRAPH::PARTITIONING::PartitioningStats)CXXGRAPH::PARTITIONING::PartitioningStats
    maxEdgesLoad (defined in CXXGRAPH::PARTITIONING::PartitioningStats)CXXGRAPH::PARTITIONING::PartitioningStats
    maxNodesLoad (defined in CXXGRAPH::PARTITIONING::PartitioningStats)CXXGRAPH::PARTITIONING::PartitioningStats
    minEdgesLoad (defined in CXXGRAPH::PARTITIONING::PartitioningStats)CXXGRAPH::PARTITIONING::PartitioningStats
    minNodesLoad (defined in CXXGRAPH::PARTITIONING::PartitioningStats)CXXGRAPH::PARTITIONING::PartitioningStats
    nodesReplicationFactor (defined in CXXGRAPH::PARTITIONING::PartitioningStats)CXXGRAPH::PARTITIONING::PartitioningStats
    numberOfEdges (defined in CXXGRAPH::PARTITIONING::PartitioningStats)CXXGRAPH::PARTITIONING::PartitioningStats
    numberOfNodes (defined in CXXGRAPH::PARTITIONING::PartitioningStats)CXXGRAPH::PARTITIONING::PartitioningStats
    numberOfPartitions (defined in CXXGRAPH::PARTITIONING::PartitioningStats)CXXGRAPH::PARTITIONING::PartitioningStats
    operator<< (defined in CXXGRAPH::PARTITIONING::PartitioningStats)CXXGRAPH::PARTITIONING::PartitioningStatsfriend
    replicatedEdgesCount (defined in CXXGRAPH::PARTITIONING::PartitioningStats)CXXGRAPH::PARTITIONING::PartitioningStats
    replicatedNodesCount (defined in CXXGRAPH::PARTITIONING::PartitioningStats)CXXGRAPH::PARTITIONING::PartitioningStats
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/docs/html/d7/dc6/Node_8hpp_source.html b/docs/html/d7/dc6/Node_8hpp_source.html new file mode 100644 index 000000000..68c3f034f --- /dev/null +++ b/docs/html/d7/dc6/Node_8hpp_source.html @@ -0,0 +1,175 @@ + + + + + + + +CXXGraph: /github/workspace/include/Node/Node.hpp Source File + + + + + + + + + +
    +
    + + + + + + + +
    +
    CXXGraph +  0.1.6 +
    +
    CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +
    Node.hpp
    +
    +
    +
    1 /***********************************************************/
    +
    2 /*** ______ ____ ______ _ ***/
    +
    3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
    +
    4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
    +
    5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
    +
    6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
    +
    7 /*** |_| ***/
    +
    8 /***********************************************************/
    +
    9 /*** Header-Only C++ Library for Graph ***/
    +
    10 /*** Representation and Algorithms ***/
    +
    11 /***********************************************************/
    +
    12 /*** Author: ZigRazor ***/
    +
    13 /*** E-Mail: zigrazor@gmail.com ***/
    +
    14 /***********************************************************/
    +
    15 /*** Collaboration: ----------- ***/
    +
    16 /***********************************************************/
    +
    17 /*** License: AGPL v3.0 ***/
    +
    18 /***********************************************************/
    +
    19 
    +
    20 
    +
    21 #ifndef __NODE_H__
    +
    22 #define __NODE_H__
    +
    23 
    +
    24 #pragma once
    +
    25 #include <iostream>
    +
    26 
    +
    27 namespace CXXGRAPH
    +
    28 {
    +
    29  template <typename T>
    +
    30  class Node;
    +
    31  template <typename T>
    +
    32  std::ostream &operator<<(std::ostream &os, const Node<T> &node);
    +
    33  template <typename T>
    +
    34  class Node
    +
    35  {
    +
    36  private:
    +
    37  unsigned long id;
    +
    38  T data;
    +
    39 
    +
    40  public:
    +
    41  Node(const unsigned long id, const T &data);
    +
    42  ~Node() = default;
    +
    43  const unsigned long &getId() const;
    +
    44  const T &getData() const;
    +
    45  //operator
    +
    46  bool operator==(const Node<T> &b) const;
    +
    47  bool operator<(const Node<T> &b) const;
    +
    48  friend std::ostream &operator<<<>(std::ostream &os, const Node<T> &node);
    +
    49  };
    +
    50 
    +
    51  template <typename T>
    +
    52  Node<T>::Node(const unsigned long id, const T &data)
    +
    53  {
    +
    54  this->id = id;
    +
    55  this->data = data;
    +
    56  }
    +
    57 
    +
    58  template <typename T>
    +
    59  const unsigned long &Node<T>::getId() const
    +
    60  {
    +
    61  return id;
    +
    62  }
    +
    63 
    +
    64  template <typename T>
    +
    65  const T &Node<T>::getData() const
    +
    66  {
    +
    67  return data;
    +
    68  }
    +
    69 
    +
    70  template <typename T>
    +
    71  bool Node<T>::operator==(const Node<T> &b) const
    +
    72  {
    +
    73  return (this->id == b.id && this->data == b.data);
    +
    74  }
    +
    75 
    +
    76  template <typename T>
    +
    77  bool Node<T>::operator<(const Node<T> &b) const
    +
    78  {
    +
    79  return (this->id < b.id);
    +
    80  }
    +
    81 
    +
    82 
    +
    83  //ostream overload
    +
    84  template <typename T>
    +
    85  std::ostream &operator<<(std::ostream &os, const Node<T> &node)
    +
    86  {
    +
    87  os << "Node: {\n"
    +
    88  << " Id:\t" << node.id << "\n Data:\t" << node.data << "\n}";
    +
    89  return os;
    +
    90  }
    +
    91 }
    +
    92 
    +
    93 #endif // __NODE_H__
    +
    CXXGRAPH::Node
    Definition: Node.hpp:35
    +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/docs/html/d7/dde/classCXXGRAPH_1_1Writer.html b/docs/html/d7/dde/classCXXGRAPH_1_1Writer.html index 030fe9618..0c5741d22 100644 --- a/docs/html/d7/dde/classCXXGRAPH_1_1Writer.html +++ b/docs/html/d7/dde/classCXXGRAPH_1_1Writer.html @@ -76,7 +76,7 @@
    -

    #include <Graph.hpp>

    +

    #include <Writer.hpp>

    @@ -139,7 +139,7 @@

    Graph.hpp +
  • /github/workspace/include/Utility/Writer.hpp
    • diff --git a/docs/html/d7/de1/ConstString_8hpp_source.html b/docs/html/d7/de1/ConstString_8hpp_source.html new file mode 100644 index 000000000..84c94c1d9 --- /dev/null +++ b/docs/html/d7/de1/ConstString_8hpp_source.html @@ -0,0 +1,115 @@ + + + + + + + +CXXGraph: /github/workspace/include/Utility/ConstString.hpp Source File + + + + + + + + + +
    +
    +

    Public Member Functions

    + + + + + + +
    +
    CXXGraph +  0.1.6 +
    +
    CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + + +
    +
    +
    ConstString.hpp
    +
    +
    +
    1 /***********************************************************/
    +
    2 /*** ______ ____ ______ _ ***/
    +
    3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
    +
    4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
    +
    5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
    +
    6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
    +
    7 /*** |_| ***/
    +
    8 /***********************************************************/
    +
    9 /*** Header-Only C++ Library for Graph ***/
    +
    10 /*** Representation and Algorithms ***/
    +
    11 /***********************************************************/
    +
    12 /*** Author: ZigRazor ***/
    +
    13 /*** E-Mail: zigrazor@gmail.com ***/
    +
    14 /***********************************************************/
    +
    15 /*** Collaboration: ----------- ***/
    +
    16 /***********************************************************/
    +
    17 /*** License: AGPL v3.0 ***/
    +
    18 /***********************************************************/
    +
    19 
    +
    20 #ifndef __CONSTSTRING_H__
    +
    21 #define __CONSTSTRING_H__
    +
    22 
    +
    23 #pragma once
    +
    24 
    +
    25 namespace CXXGRAPH
    +
    26 {
    +
    27  //STRING ERROR CONST EXPRESSION
    +
    28  constexpr char ERR_NO_DIR_OR_UNDIR_EDGE[] = "Edge are neither Directed neither Undirected";
    +
    29  constexpr char ERR_NO_WEIGHTED_EDGE[] = "Edge are not Weighted";
    +
    30  constexpr char ERR_TARGET_NODE_NOT_REACHABLE[] = "Target Node not Reachable";
    +
    31  constexpr char ERR_TARGET_NODE_NOT_IN_GRAPH[] = "Target Node not inside Graph";
    +
    32  constexpr char ERR_SOURCE_NODE_NOT_IN_GRAPH[] = "Source Node not inside Graph";
    +
    34 }
    +
    35 #endif // __CONSTSTRING_H__
    +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/docs/html/d8/d2b/Runnable_8hpp_source.html b/docs/html/d8/d2b/Runnable_8hpp_source.html new file mode 100644 index 000000000..b684a1a65 --- /dev/null +++ b/docs/html/d8/d2b/Runnable_8hpp_source.html @@ -0,0 +1,116 @@ + + + + + + + +CXXGraph: /github/workspace/include/Utility/Runnable.hpp Source File + + + + + + + + + +
    +
    + + + + + + + +
    +
    CXXGraph +  0.1.6 +
    +
    CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +
    Runnable.hpp
    +
    +
    +
    1 /***********************************************************/
    +
    2 /*** ______ ____ ______ _ ***/
    +
    3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
    +
    4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
    +
    5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
    +
    6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
    +
    7 /*** |_| ***/
    +
    8 /***********************************************************/
    +
    9 /*** Header-Only C++ Library for Graph ***/
    +
    10 /*** Representation and Algorithms ***/
    +
    11 /***********************************************************/
    +
    12 /*** Author: ZigRazor ***/
    +
    13 /*** E-Mail: zigrazor@gmail.com ***/
    +
    14 /***********************************************************/
    +
    15 /*** Collaboration: ----------- ***/
    +
    16 /***********************************************************/
    +
    17 /*** License: AGPL v3.0 ***/
    +
    18 /***********************************************************/
    +
    19 
    +
    20 #ifndef __CXXGRAPH_RUNNABLE_H__
    +
    21 #define __CXXGRAPH_RUNNABLE_H__
    +
    22 
    +
    23 #pragma once
    +
    24 
    +
    25 namespace CXXGRAPH
    +
    26 {
    +
    27  class Runnable
    +
    28  {
    +
    29  public:
    +
    30  virtual void run() = 0;
    +
    31  };
    +
    32 }
    +
    33 
    +
    34 #endif // __CXXGRAPH_RUNNABLE_H__
    +
    CXXGRAPH::Runnable
    Definition: Runnable.hpp:28
    +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/docs/html/d8/d4b/classCXXGRAPH_1_1PARTITIONING_1_1Partitioner-members.html b/docs/html/d8/d4b/classCXXGRAPH_1_1PARTITIONING_1_1Partitioner-members.html new file mode 100644 index 000000000..ab879130b --- /dev/null +++ b/docs/html/d8/d4b/classCXXGRAPH_1_1PARTITIONING_1_1Partitioner-members.html @@ -0,0 +1,87 @@ + + + + + + + +CXXGraph: Member List + + + + + + + + + +
    +
    + + + + + + + +
    +
    CXXGraph +  0.1.6 +
    +
    CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +
    CXXGRAPH::PARTITIONING::Partitioner< T > Member List
    +
    +
    + +

    This is the complete list of members for CXXGRAPH::PARTITIONING::Partitioner< T >, including all inherited members.

    + + + + +
    Partitioner(std::vector< Edge< T >> &dataset, Globals &G) (defined in CXXGRAPH::PARTITIONING::Partitioner< T >)CXXGRAPH::PARTITIONING::Partitioner< T >
    performCoordinatedPartition() (defined in CXXGRAPH::PARTITIONING::Partitioner< T >)CXXGRAPH::PARTITIONING::Partitioner< T >
    ~Partitioner() (defined in CXXGRAPH::PARTITIONING::Partitioner< T >)CXXGRAPH::PARTITIONING::Partitioner< T >
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/docs/html/d8/d63/classCXXGRAPH_1_1PARTITIONING_1_1Partition__inherit__graph.map b/docs/html/d8/d63/classCXXGRAPH_1_1PARTITIONING_1_1Partition__inherit__graph.map new file mode 100644 index 000000000..3ea66c752 --- /dev/null +++ b/docs/html/d8/d63/classCXXGRAPH_1_1PARTITIONING_1_1Partition__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/docs/html/d8/d63/classCXXGRAPH_1_1PARTITIONING_1_1Partition__inherit__graph.md5 b/docs/html/d8/d63/classCXXGRAPH_1_1PARTITIONING_1_1Partition__inherit__graph.md5 new file mode 100644 index 000000000..567e0cbbd --- /dev/null +++ b/docs/html/d8/d63/classCXXGRAPH_1_1PARTITIONING_1_1Partition__inherit__graph.md5 @@ -0,0 +1 @@ +aa7e9bcf9adf5f0ec33e547fa0857a92 \ No newline at end of file diff --git a/docs/html/d8/d63/classCXXGRAPH_1_1PARTITIONING_1_1Partition__inherit__graph.png b/docs/html/d8/d63/classCXXGRAPH_1_1PARTITIONING_1_1Partition__inherit__graph.png new file mode 100644 index 0000000000000000000000000000000000000000..87631278a151f53d4e47937428fdd738221c1a8a GIT binary patch literal 6031 zcmch5Wl)sS+xH?3(u$;n2uQkg=PD`PBCW&%(zUR33R2Q7EiOxUgMff^NePmYB7!u} zVg57EJkLAt%=_(~o!$L#@1FbI=en+6MQW%i5E0N2Kp+qzB}JGP_#Opse>@!UnZ2*7 z4!&?KR1{#4o7-1zYjGk3@&Kj;lhyIc+*?E#=)8W2`}?4ygI!;il$2spYvwZyn>RiT zj#t+Zi1O;DJW_HJcF=Ztb%C5MTLLIi`msQlp+#FCFaK7k}ogIOgOo?A>>|&#$f)rWg-n=QAZVK;nc6F6^a}(I!-WHg% zvbKgFAD^7`F0~?v4kR9JS`nX}oq1iKZDPmrTlU_Kxf;J5Yxno(*Ey$(Ps3m=)vGdV&j0?B|99|%jrpVPL{U5%&HE%tnVDJ4?_9v} z<;#h$iELA=R1>Vi!YTIl_UuedfgBthC7(V;B_t&DFD+$z?9CNATEpQgd}*pzEk#9P zlw1ZfSz_)VKYijjb_tb}EiW%$TVH>sU92{h{_@CKhvR;hw10L>YwHssA-#jTbT4mj zO(Uc9&MWKP%poRT-dLaG?bp*#{m%xnmc7x?ozy19LM^+{?yNZhnd9T*wVyxb5GT81 z2IU&;{oUR2eh^(99gP&8S2lym+yxr!Hp?A>0&kZjVx+?6N_053XV45N<3_Er_ajml z(LVq7QONS0+&2FkDU4jpzW1dm^r9{yboBH}97zem!I)DsGw{D-f@;RbbZ6)1b+cjp z4UjZGHrHi{Eqp?|AzvX@u29ST^7N2qkei#^d1sotqxWjy%?WMzR=AWY@sN0qX*Q=&`b#-+m<>k-8?y?d4qHbHG z7=Gt}Wqo{_p3l$D8i%*@P^l9Gt+ogLeYlfAX=?N5%Jl<#ckYHW2hHD$4} zu_tTc`pRl*MJ+87RW&sQBvPjV`%A4V;Uo;K@rp3%o6G8HAy-$|ClV5w=O=sf77k%1 zfyDG;FcTA#8kcqDCclfi&c^K{owhsi_&Ef^0s_nD$2+9&zWA7O8`-%YEJ=!pi^I8S z#oS7IX=e}GZ%kTw7#U?+7nYVD?o6Y)*>ZgE#4BP!PB${%LLi{vIFOLAFlK&!3L+vR znt2lEfi1Kic@_N#v9q(23KWUf z+6I962~9{K2So{XNZ~alCL|;*C@3&nYVmIHJ}OdjkdTzrG&cTRi7GUIb%ely2qvn-0E{bFfcG8 zDyl1vNggW}PV7LF`{U;Np9cHAIORg4ojaJAWE2#b5D~-)*EHHRc0~GyZe?ZV_rHG% zIyxVoBjg==qp5@E=8Ou8itHRzSQA$OUi$2OP-KaSj)vLVJ^@(vd$|+S%F4>@=K6{T zP2+#s%`k+lf2*RJraciz3@Ot`_Xc9(l0JA4&ftGZW{Ny3eE!4K|LT7G)k((r*;JW6 zxE}^&TYov+eP@~oiA0{B@1UK3FU#ua>f)zo@O=65Ma20h)~B*EsNE!cb?lAeke?bJ z1+OI=D{BHcMo`|^{U7b>?U#QDQ3jPkySuwv;R(J2U9Sm>8nR zY-|){)Kg(4hmygqt&$Gkt3s7kR7wFBkB^UUdA48Bf1jV%*3={;`_;y$XK1Jd*#fQa zw%mbHRb8Fm)Fc)oB<``xsGy)=XJa!eKHME*(kt{v&D+}>0CeGgHK-W@0l~+rDn1S# zo}$CmzQoW_Y+XG)EfbT67`grZil0hKasiHO);liRfZ-KGcX|8xjDN4To*F^FYJSdu zJY{mlBcQG3U(7@9pWIQv3NORK-H zFPw!Ozp<%FOGATneRGpSbCuY`({twZGBjdqHCDQ4I7?jH+q+TIA$=Dd)#c@-B6GY3 zAWoaE5PY}wf%{;~c2F7R!UTZgzi$5k7;Bv| z>8qM4LMDBEYWXt7LhsTYr+1Etm~`SPfbHV_sbazZB~q3lP*wrW*`WcEg<%G#IztXJLmjo>x-Hr~}Q|4{F4sESLhA^ss= z6OWTq<=7Q`SiR1IcSog4(dBxubMM_-b16J;G%oMiU)tlwPk%5wW@3l z8!>BZ@z1Zy&a};*Jc+4aR?iYsE#rnW3|)h3QvB9P49Mx_k>^|kc@arY*KN5Xpco=D z(fA!07OD{9|5F?Or=tI#eu5X9*g8a|8Qg@po$sb8Kwv_u=7Ki65ZO{(*t6 zPr79Sy`zF^VA7vj^xzGp3lfq?!WLP1c!)7^?v8GWJO6~i6cjAi`s2Cx#VzX&*=waF zHUS2&l%d1F;Dym(MnH`kD{g;4T-e4|t4aw6w^1UNvDAYDH#CBA6v4 zj4h?HaB(fSM)QpH5tf#ghvO=|OcD}wkeXiMItH@^XXX!vCV}tiM1w*?uv9aIhzt!4 z6;)M3V9c_rs&{E^K&@EIQ0U9rSEb7fT11|0=OzKO8kx!dXa`KO$N*-Cjh zm-akn%uO8f@0bFWl&^@Ewsw4cd|)I6o5gBx3?NS$hgf>?Fn;Ud)E0E~FY5tk=8$E` z*L4@)^IyfO{MN)_M6@`7s@;B#V?&|P1|XP$4#j}@U+tJ`nwY%D#3hyiI_K*Am`WNc z0fboD!$A#NW;w9CBDJij`X5Nzlamvm6Xeaz7~c$MMrMh7ZlkIJ)<#4`$T&D~D=RBc z4gzVylrl(m|9&Wt9r8RWJM{7_B>YPTs)YQ`}a=huKeY>1l*Giv zrCRphd9{~GRP?)9D|5W!YK2KJ6&Gzz`;pLNza&~qc78Vw6*9s1$FPxpBKv9{2&UDFgcXywyg+Bn6Ef_onCgdIg zHfRwtQc_4H?2f6aDV?~7>H!rj1n57j*RRb-b7g6Eu21UQnSjJyb-p-ph!F}Wrtivl z+g5s951oHntLNwH_(IrmA)vUp_}uNnd}(Qkots-%y1u5S2baM&U~SC`7VKKDAay%*B0|Uy7=ra)^At9jJ`f6+^1bWpJ z6-T|vIt{{Zhk85R^<`B>#i-bx@7a0^6hMLfQVTVwez}0p=j8J=pG-U^5t;1l><0H8 z%834D{{r5&(>s)ulm-n>Og~pwp;rB*4Gj%ci@jgIU>6n^(#)U#olwUR!13Olt)#IO zlrC9!5%oA&ig~P(YzAZ}s6yOVtCG^vPTIFEd1D8YrP?(5c5b2F3wIq>HSMMZH>W32 zFNGIcyeSAmy_DUClzUI1jZdrr`hXM+9w-B|uXZXG@5yUU8J>ZiCF;U5{n;=WL_LgvCj2i~8GwI@0v?w^yGV6xex$2QZs#fk`uCW^B{NkH zM)C@K7Wk>I?rw&8V(VQcQZTKc{`eHEHe8#CmH&}cJ)K{iRVUQmj~1HxmLUuUIS!qe zTYrH&sxws_m1a)INS`hh&BAQlj-&@kLr8x9BOtYTY>d^_)mt%aZC}A7A|r1(3Bo8U zO8xBFGlOQ2JjUM4%0B)rN%y^R0^ov-OCbUD0y)^wg_$2SCoPt%Si~W(P~H zctk{Bg0KlEWlw(<=Qtg0ytwta->Y8FHoCF_`Chxt%fZnF^gGmgm`?U$8?;)-hbP)` z2?@+1(dx8Fk^*@Z&*$wxx%3YW>7YG5J^S9aUlk$CwMuUv-oVI6>d(n*K5CGBO#LXN z;eT`Ywr397E{G)&Cn3f>eIV1jwZ{w$3=K_9AAv32-`@uv+yNl3(*FiI`~AB)IDykX z>FdM(T1Y@n4ug=xTnNwwEub}l(vh{XDd|mN%FzW?HEQB-%FDyhD!msP8oGTTC%C!0 z%f&7M`MrZ~w~N_XSqTJQB^S`5lZ(rE1FHDf`&D4W%#XLHs08iqQF0rF08K&oDZdfu z8Z+Q{y*9HvdHX{7%xo*B!F_gru=QevHkgp4|h6c@&s(;8D%N3~V27 zoDKxMdq)`c?ww#V;HNzG94T(c?y0H!eitXtWMwgc&0k(y!$KesoyP+DMn+NZ9`Jsw ztE0rgz<5J{q11!H7Z1E5$aa>&X6NhQT7oErk$G}*a?75VJW@kjJOAii`1v$87S?TR zHa0d=0Wav{;-X<}91W7ItONIS5RW_p;tr&fv+e%UfQ$jGhL4VF#F&clB^mQ5cz6f_ zCwD6sXlSC^FV}f#OxF;4lGP8$Zo8?X;wgyGRI??hK~T~)TWL84@+&T*8b#|1eG_l& zGCkDzncow?9l)fM4{*D>y5h34-#0XffG~(wH$OZa_szHTP|$&SrtQenwM6yk?P7H# zQc5jbB64fXhJ}^Y0`xgu_RUIjB{lz@A2HtyIR764-{zv_-!2(7T=a!(|M zgD#2X-ZY3kYLSMzoHEhS)k6dbsQ-JR9?1Ay6JBq&&JDI;;dLox3->HY*da>K)L`Xu HWquC literal 0 HcmV?d00001 diff --git a/docs/html/d8/d6d/classCXXGRAPH_1_1PARTITIONING_1_1Partitioner.html b/docs/html/d8/d6d/classCXXGRAPH_1_1PARTITIONING_1_1Partitioner.html new file mode 100644 index 000000000..b814138d0 --- /dev/null +++ b/docs/html/d8/d6d/classCXXGRAPH_1_1PARTITIONING_1_1Partitioner.html @@ -0,0 +1,97 @@ + + + + + + + +CXXGraph: CXXGRAPH::PARTITIONING::Partitioner< T > Class Template Reference + + + + + + + + + +
    +
    + + + + + + + +
    +
    CXXGraph +  0.1.6 +
    +
    CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +Public Member Functions | +List of all members
    +
    +
    CXXGRAPH::PARTITIONING::Partitioner< T > Class Template Reference
    +
    +
    + + + + + + +

    +Public Member Functions

    + Partitioner (std::vector< Edge< T >> &dataset, Globals &G)
     
    +CoordinatedPartitionState< T > performCoordinatedPartition ()
     
    +
    The documentation for this class was generated from the following file: +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/docs/html/d8/d91/Partitioner_8hpp_source.html b/docs/html/d8/d91/Partitioner_8hpp_source.html new file mode 100644 index 000000000..6fe473303 --- /dev/null +++ b/docs/html/d8/d91/Partitioner_8hpp_source.html @@ -0,0 +1,190 @@ + + + + + + + +CXXGraph: /github/workspace/include/Partitioning/Partitioner.hpp Source File + + + + + + + + + +
    +
    + + + + + + + +
    +
    CXXGraph +  0.1.6 +
    +
    CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +
    Partitioner.hpp
    +
    +
    +
    1 /***********************************************************/
    +
    2 /*** ______ ____ ______ _ ***/
    +
    3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
    +
    4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
    +
    5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
    +
    6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
    +
    7 /*** |_| ***/
    +
    8 /***********************************************************/
    +
    9 /*** Header-Only C++ Library for Graph ***/
    +
    10 /*** Representation and Algorithms ***/
    +
    11 /***********************************************************/
    +
    12 /*** Author: ZigRazor ***/
    +
    13 /*** E-Mail: zigrazor@gmail.com ***/
    +
    14 /***********************************************************/
    +
    15 /*** Collaboration: ----------- ***/
    +
    16 /***********************************************************/
    +
    17 /*** License: AGPL v3.0 ***/
    +
    18 /***********************************************************/
    +
    19 
    +
    20 #ifndef __CXXGRAPH_PARTITIONING_PARTITIONER_H__
    +
    21 #define __CXXGRAPH_PARTITIONING_PARTITIONER_H__
    +
    22 
    +
    23 #pragma once
    +
    24 #include <vector>
    +
    25 #include "PartitionStrategy.hpp"
    +
    26 #include "Partitioning/Utility/Globals.hpp"
    +
    27 #include "Edge/Edge.hpp"
    +
    28 #include "CoordinatedPartitionState.hpp"
    +
    29 #include "Utility/Runnable.hpp"
    +
    30 #include "PartitionerThread.hpp"
    +
    31 #include "PartitionAlgorithm.hpp"
    +
    32 #include "HDRF.hpp"
    +
    33 
    +
    34 namespace CXXGRAPH
    +
    35 {
    +
    36  namespace PARTITIONING
    +
    37  {
    +
    38  template <typename T>
    +
    39  class Partitioner
    +
    40  {
    +
    41  private:
    +
    42  std::vector<Edge<T>> dataset;
    +
    43  PartitionStrategy<T> algorithm;
    +
    44  Globals GLOBALS;
    +
    45 
    +
    46  CoordinatedPartitionState<T> startCoordinated();
    +
    47 
    +
    48  public:
    +
    49  Partitioner(std::vector<Edge<T>> &dataset, Globals &G);
    +
    50  ~Partitioner();
    +
    51 
    +
    52  CoordinatedPartitionState<T> performCoordinatedPartition();
    +
    53  };
    +
    54  template <typename T>
    +
    55  Partitioner<T>::Partitioner(std::vector<Edge<T>> &dataset, Globals &G)
    +
    56  {
    +
    57  this->GLOBALS = G;
    +
    58  this->dataset = dataset;
    +
    59  if (GLOBALS.partitionStategy == PartitionAlgorithm::HDRF_ALG)
    +
    60  {
    +
    61  algorithm = new HDRF<T>(GLOBALS);
    +
    62  }
    +
    63  }
    +
    64  template <typename T>
    +
    65  CoordinatedPartitionState<T> Partitioner<T>::startCoordinated()
    +
    66  {
    +
    67  CoordinatedPartitionState state(GLOBALS);
    +
    68  int processors = GLOBALS.threads;
    +
    69 
    +
    70  std::thread myThreads[processors];
    +
    71 
    +
    72  int n = dataset.size();
    +
    73  int subSize = n / processors + 1;
    +
    74  for (int t = 0; t < processors; t++)
    +
    75  {
    +
    76  int iStart = t * subSize;
    +
    77  int iEnd = std::min((t + 1) * subSize, n);
    +
    78  if (iEnd >= iStart)
    +
    79  {
    +
    80  std::vector<Edge<T>> list(dataset.begin() + iStart, dataset.begin() + iEnd);
    +
    81  Runnable x = PartitionerThread<T>(list, state, algorithm, new std::list<int>());
    +
    82  myThreads[t] = std::thread(&Runnable::run, &x);
    +
    83  }
    +
    84  }
    +
    85  for (int t = 0; t < processors; t++)
    +
    86  {
    +
    87  myThreads[t].join();
    +
    88  }
    +
    89  return state;
    +
    90  }
    +
    91  template <typename T>
    +
    92  Partitioner<T>::~Partitioner()
    +
    93  {
    +
    94  }
    +
    95  template <typename T>
    +
    96  CoordinatedPartitionState<T> Partitioner<T>::performCoordinatedPartition()
    +
    97  {
    +
    98  return startCoordinated();
    +
    99  }
    +
    100  }
    +
    101 }
    +
    102 
    +
    103 #endif // __CXXGRAPH_PARTITIONING_PARTITIONER_H__
    +
    CXXGRAPH::Edge
    Definition: Edge.hpp:40
    +
    CXXGRAPH::PARTITIONING::CoordinatedPartitionState
    Definition: CoordinatedPartitionState.hpp:39
    +
    CXXGRAPH::PARTITIONING::Globals
    Definition: Globals.hpp:32
    +
    CXXGRAPH::PARTITIONING::HDRF
    Definition: HDRF.hpp:35
    +
    CXXGRAPH::PARTITIONING::PartitionStrategy
    Definition: PartitionStrategy.hpp:34
    +
    CXXGRAPH::PARTITIONING::Partitioner
    Definition: Partitioner.hpp:40
    +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/docs/html/d8/dad/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__coll__graph.map b/docs/html/d8/dad/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__coll__graph.map new file mode 100644 index 000000000..2181d134f --- /dev/null +++ b/docs/html/d8/dad/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/docs/html/d8/dad/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__coll__graph.md5 b/docs/html/d8/dad/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__coll__graph.md5 new file mode 100644 index 000000000..b21f563b8 --- /dev/null +++ b/docs/html/d8/dad/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__coll__graph.md5 @@ -0,0 +1 @@ +df177e03bb17e95d798ac79b4c93d980 \ No newline at end of file diff --git a/docs/html/d8/dad/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__coll__graph.png b/docs/html/d8/dad/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__coll__graph.png new file mode 100644 index 0000000000000000000000000000000000000000..7fb4758cd371d186ef216b6ee3230e8a2780a4fe GIT binary patch literal 6846 zcmb_hcR1Dm-#*C-*(=%O*du!#TgNDSj}($k_Ke6*9IGTGo6Hm<4HO}JudHmcBjb5_ zzQ5}k*Y$h;dyWg2&p6(n_v?P$ulv4FjE)xiG65X{0)e=!uBM^~zkA?29v=&Sst?(m zpTM=&M5`dq&c9xMC`?8m=seX`6b<}dtY`WwPz>*Xb5k>EzC}t#rJ~Ba5lyJdM?j$Z znw8^Kt6WRrZ9_*fGscZjuIlL6u)g<*R^|+5)|a?Bbf)w5Ir%)N_O`rXk18XaKg$2| zo_dCgZdTr0tVs9lMjcE{2&S(KvEWB2As+sW_W9%51l_=4ZcO*zr_wE|p}S zElPno+T^FyzupB42k$c#mn44quD<(~D_1;!b@mPn(8~q=DKRWvSy@3KA|fK#$%{)$ z2)qf2h+fG0dstazKStU<{d~Kwu5Jk~SzR3;A7A|S>s8j+*w~|wy2i%YQl7|6t#8P= z%}s4)QV$Q0%InU86cov!p`lq>j5Wn|b+oI_ckZyvZChOD!lC$7@ZrHpKp1T@r#3Ev z&+@(3!Nw%P5pzmPilmIp>dHz|`+U9UqV>I;va*{wI+fh~R!y?P!sMf0zhc%e*_J=) z!@t&JFG?1tB5)VNaXAcX(&2jj z`n7?+J})n?azML14?q84UterYjDw3y@ZbIQ);Jn(FE2eky+kA7^c#i!7#Hyj21?4j zii)%Sb@P@lb6bz&>{abaHTL{ra`Zf2ZKh8xa(0vZZBysW;ai z3mYq^s0e@k@7}OgZrO-rHR^7~6K4cMly04Y&<9QSd2fH8?#h+?{QMkh#)Ny0jj_*}>Ed z4Dl}f0s=^knxIva3iqunqg|+qV=H6jfKNVR;Dg^@GK)@mGU`gQr8z zP(yXMKZlvVv175KM}(G{*On9)-ywO@m-uTmVGtAF7xouggpZ%!&>+tzPls!Ne;@sX z{_t=yTTD!BLEO;D$jr=aWod~^IN;vB#T?}*yRPSVZEP+getOiKnwnA)sOsx`wkL6r zyO|P3eEF8Z#L3PM_{_bIMx)o3$vlW-iK_s{Ymtw2V%eFq_CtRkAMV_r`&wLF95Yf@ zR;DYKsFnvUQ&}mrhRwm+rC&U#i=B_dnPOboKI4AtLx3tPrsWKuUEJH-`wAW1s|L@- zAFAHJ=i4b-qF0pB=tV%s{rmUZ_}5;&Vnu`|CsQD9x5iRQNlDQY<6Vx})zj6js;$kI z4>`?31@<7fluOps)d>NDvkoMb+KzrP+nfXvAWt}D{O9V{`csp z`pug+)zv+MCHb09XAhZ8wy-N5NCuX)w6q)@9SgNGztCxFXngOlkZbsydXj(_QF!Vc9(jA?V#Ml6;{w(g@uJ~Q;nu${ue!_CI<(-Pma9h zvNvaE!^F!h>V-Ku(Z>m=7jq1-?8h#Oy-!Os3JMBxcmEwj!3mTK>?I;B42`0sr1Uj` zNpSY~wew z{r;KeC^8A4sSkk%r@xy?fWd^HC#q*bNnoGn;8GF0&V`Pr6&Cf|tu$6@^p@J%B=wgS zb9*NyC&ffXdkXG$qyaXmC@FVs^tfUz@>#i35zqJk&LhJL3m4xy4Fl14c6G%+e$2|s zYHec^9v0Suicy&@)-RmT3ent!J)Kwj6se`DnXAJUn}_p|3+ti6%U=6iw{8{T$Z1CW z_hdVtNvR1&?jCW^ap^-s&U$)u>Rp9366A2?%syY}j6WS3GNPfOAt6bCCjP8Nz>Y++ zn%?16JUV!0&$WGxkXY5+Jg_?pwZ6Wdz=)z-vyk(aBmd0pQA=G${66qtywc;`vwNQyuDo<959mQq79;B1*}1W?0S8g24^2%?(1OD0L5JH5Po6y4S?pe2S`w9z z5TPZyd^w)q{GF(n7%Jq{!qO7O%^lNf&B4x&KmZ^rrBc$;^te(0DjJTBO@Z<{}XvvzImgJJv=#?`Rtiw@X@Z|$K&n3d`);D za*-6IWR8xBu`vxLrKrce8WR&!4QU7$t3X}Cd?F87%%CFR#=*g1Y2l8dqN1fGLvlO4 zjL&PegQKGWO-)U&;l94@z13j^0+^jV1{-1T?A#)UM86{>AOJuy$pt-o{#>K5pPMqa zq@<)e9cp^ilcOwntI?#NS3_^EOS6qKgdjX+Pnt9Iuv#o>!GXVSO`}=F7(5&4Z9f2SM{^nT%-5+dN zQpde@pZRhSvm@Wi$s!qAOuW6j+u7FE*4>RJc(J>?%ZLit?UIdk^M1GdS?6sb1Y&4t z$hhLxxeQWPZk}&XJ~=+FJfknhrzhr=k{X?wn(FR$`|(0bJ6rBD2?^7u1nb1lr)4CQ zo|1r={WVj}WoHJd?C#+6$6!Bc}iFoky?8L96291u6)-2;8Cxg1Chaut5fAm}= z(2`1=TVMRw#8ByJ17J*I?nVM$4J)TJ~| zcd7urXSA<_B3X6ZH4;<3vsD5XDfA6FZ0}Ao{c|+-%gpcX9i|<>px2lVs`&-f+WG>q zk&!Ynm!v8;mtS8$o1zIlaYa!P-C0m1myUaEQo4V(TFUPRd~7Thwp{XmjuQ0t_9_?3 zr}`;=UnE@GotBZFZ^ST$A#e&w4-XUSEsAU9>nt8TIJJ@8x$^!~)B!>7&`_)0*+Hb5 zyE_uW%-4DG?b4DxE!~$RvO~3^sPJeTd$q4CF*l4ZBA#W0i2Gf+Z1|If>fhGwU*%%oE&XTHiV~sCk<=2#X|J;_2J53SVA*1C)+S=XAOca3c0k-#m?AX$%4HvF<%@Ljk%P}38JG7hdmZ#d_9Tpor)$gXAdj~NOE?EuS&A-Z$t&i##v`j;U#<|B>@g1G@fmo zqRoQg?sB(;1-#dd8=YW*U_or)5V<9l9TnlyhOKG#Y2v_&{|qQ$}Jnz z*pnV35uZR#)VfW}!47CX6#!q>J~@fv<6HaHm9Z3k?btSZ^mV2R9COYeW>+5=i>vaBPru6Ssun{?i6bJryVHo6@%Ni ze>VE>3=9lJUcP!gU$3E|VRNzp4>8i{?+JPb3gqmt@PLt#@%{VvbaZsY#Kf>gFczHYE#xn(GD0SzYIiEiHAr zb&JtQ*@vqYJoU-x#K(~AZ*yfPRaj0h0C!-7T_@j1tOfY_0j_yGh;a#Wp#D+bfG(8pxzOo z-{w-&(xj!Op&!P_#-^Hr%^TyuT$h!BwtQPvr5Hc{&c(B(XJX>9_`>31Lw)@n3EM|{ z>=(Ac48W+(NKa>3WH;gC<4fdpLm*f&f0{|;**Q4waB`73WNDN=VdV<$Wj+|jtG954 zjl`(g3a9HAYNd`3jE|R=mc|`9kJT)XzPZ=74_ZXnu9Ft=>7C2C4xXXmARw157Of?d zxB!OefwME;(+)#JLsi+{TVV1)G(vx=hPSk|L|cfqWu?^U5FnY8_VH9zRdE7sv!%UD z!o!kWRaLvvMZUGQsre*h zFl5Q?Di^b)y$KM^lms7-R(NaJN=O8r1}^vIL$UxJ6r;f0v+O0F0U&=IU}RwMl17KM zB!DR|;vb8|o{wQe4-F6R_{m}f>p>B8WudM*UBbr)uYE^|*25+?kf&N&BWIVz`&Var zkQ@_AQ{kmv@z&NBB6P7kyWhTMeY}gKy+j{VKy*4qC^k}*>LqdB@ab5YPAJ#|>o}<^*t5?ZmQZh5+#pD8ZmtcqC zaa-sv6A=MKeP>%P5l6Af6x0>!mFD7W5Nd&@n4Xpw7k^h%lhQm>Q(Mc)!C`1@9I`iP z93&^t$_n%}I5tLyAO%|jMKCbH29E>*$l~TE6NEy*=s@nHqyEq`BO@jbiI;g+*gfa#0~TfqIR*y0CL)sDW#=jRA}J~9N#8p92R+DvWEKFs% zBj!5d6JTxB*$3QGVBp`=lfT2SO_Nho#X?Sx0f3lFa6Wr`dl0DL5z|YCoCfLZQ*0X? zfQA8|aBfAiR<5h6#xux>3k&zPw&s_WtruoL*xuj&(bo2Rdz*lm7%XBr1TiR5zgi-7 z>qH5+DWIJS%Z7c}2QUVI4>lLK{5IvkL3Nm9{e*;sbc*x+k9L=zi#a7FCu3%QU)c1N zyfS#xOL}r>i288byxLY>QSr0e$CIJnUKUr#G$`@0GsIn3$zz7gE#JI-tGXhVCSVx= z5e25wLckZ20eCjZ286`L!2nYrZ?v_yE1E@-FipYzeG3pAys_)@aCb)_B&DRNsHuf% z9~TrL9WJW#DJRk9<>y1nX?J>j7~R|6u0Ga6mChE`T<^bQXJnN2?%jU%-Hy|}iV*I% z)Nk%}%RxX00tBYHUFWkZ>sEpq*}u&XYk%4rNPK`hTB6C8%8QE~G&Kn`x~L_9$zj&A zehUMiz4pd&YjFq{7k6n+%T|XtN;$U|tYTt?`4)RdMn+s*T-8~wkjt3pm4B@Y600DU z7>cJd-(q89m7|FHE$ZAMFvvwGP-jQ55&^PKj`pU54=f>Z195~=lZ8m&Ooob1+{A1_xW?f4VIr5D*c=h|+~L1{dbWTJ-F92%ZFZ zc_Blusjd$AyI%&WP;~gihYw3jS3&hueT9x2z4-8BN8*FS1sdu&j%#WVPsPy)ssyON zsGE=i{As_CtZHnWfU))IlL8uzw@ZUeHiaBvbd>wlF7g82W~l+x8RqxG!UE*OC=?0@ z2M4GL<{f$bNGP00O-%*-tZi&G`K;6V+{w#%^~(D8?c0uyV-pkfG&G!)1f$O4h)@OQ z%2DSWo%1*qdat@#IB&PPtE=qYJEPAJdxY6z6q}B>JK!*Gc<=BqkOhi{<|)ARw5#{a z7gkwWSyt9r$jl(pAR{B|&XzZJ7%0a(*=GhkO7frn@(hAr zn4AQ|EyB&s&CdSl1`@(*mcg5d(2ID)KpyncUiKi0XJ%$1BO}SI%#QXYDf<}rH(|<^BlON4ZfRTclS4^<*i$yVQxcm0k6HlCj|us&?wtG zJG?wRv2k$_kv^N%^aSZ!U0n@npL#NqdukPR?t@A2`Lx4`g#V2Z{+C-)tJ~r|%@V=4 zeVNEy2T%Dk8*iTCA@hNY8fhB>t9ypI?!P{mIrm-*XBYOFNwKdHnZZW^@WGU-mP)zO H?Xdp + + + diff --git a/docs/html/d9/d11/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__coll__graph.md5 b/docs/html/d9/d11/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__coll__graph.md5 new file mode 100644 index 000000000..816c1bc7a --- /dev/null +++ b/docs/html/d9/d11/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__coll__graph.md5 @@ -0,0 +1 @@ +e2f76fb6661b9a3c8ee9967d3c5fda19 \ No newline at end of file diff --git a/docs/html/d9/d11/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__coll__graph.png b/docs/html/d9/d11/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__coll__graph.png new file mode 100644 index 0000000000000000000000000000000000000000..e0332e3221edbc37f283c54cc2650323c97e727e GIT binary patch literal 6630 zcmcgxbyQW|wm*b`gn+<7LIF`qLJ$$@PNfl0N;*YJ>5>u&X{1Y}C8fI?q#KcrBOxuk z>AT;(TR|F|3NE6^v;vx_T0$CXe75F^}-yt~Y@Kbio@b3#) z2J+Gph|9lUsdd?r2n0oftc0lA+r;f8S6VXX%Z`SQs!D3^F^>c*`6!iVL)PD= znqTGJTAy5NW^o+fC{bii7?c}l6l9jgrmJuW3jM-l>=fye&lpSE74y?2vFH3E&U7`t zzYm{s=;-%&@6p+b$BLlo+-k3riO?!Fr4KCvJqB)(Mlary2pP%2cJ_ZKHmDp8W6=G7a*gB6tE}uwO zR#p&R#yv6C^Yuyk_;Sk1A0s0p{r#~L`jQ`7B0V@pMn?q&1b#(4%hx2Ppa^1L+Gh&I z#0|Sb<5s^94jvsDxpqt7_(xmt*w|R9>3}V7Vr#2JS!|!l{#yb2s=7MC zJ9i{hRZGju$*hTS{S4bb42_Rp?)7l&-Y!-)C_X-#_k48!{zScdjlCGDyZawFXy>y$ zS~6lZE@OI}5?GdGFmf@#?Q}gmEiLUB*~SUgv9Pe<nL6iqjR_0UxNJLb)>K5qsja9OR#D+-Ys)oun-sSrgeu_H zS8@*BwY4>BAvaAX(&x{gV_muO^5tH2tHEvnjmHfn(tp0Y*s$Zt)2GF;7^twqLUu%B zx#jraXl-q+a)#8KDs2LSkmTfBtWONo-oC9YFE8(9fA@7UQmnaNzwq&b z@7kJ~o6XCYbiPe*57vlT8hd(rMn<9rRx|2w@fkTv1~M{kn74cs%0iNo2Dbf(zNcZp zX3tkwTs+j*M}SDp%5qp6OdI^~>+tY!w#La2*7$0^UPo1R355!qe_vE&qplt;Kmh&u z^eKVPifz@sXZf!k9g#s2&d$!bQFwl0xB0&m7TzK!571Led|!#E-SUo1NtvIXt}*}4 z;FeKW_vZt}gF(V;2(N|);o!FB6zXL}=P!Z@=W`vOh1A zSz)up6lGyyQAp%n{Q2|ULq1;Kg>30HYSQV})8CuBc+k+qv}~?QuudKx9+P6t>)Y^< zwwXr#`=Qj2OPo-;=hwO=bnoP3h+_`>i=VPg{M!1D-7i*KW4e3yEz}RHde-W-F!~PCk6u{4O__h4rPmIWwPwe(B_dNH2|`py2d3 z8@(#qyOb%3iRXLE^2lJxj3MZzsi~=7j1R5UUc8u|EHxb+9qrn&O3A^&4G$M&ii?X= z)6g)CJ-Km&nt$~0VcRzeDJdipd2zl!;Jy+S`p%*2eI&Lu|=au zSI}vP8X+PYTTyWcX(HX0F*jR6{k(g@!IWTm1y+gt7_EG!Hr=cul!K~0u+0508r`~CA% zc=hDu#Qk%0;2l@{(@fz<9*?XhUc-QW{rYt%Ls~J3?{|9$72INCVj_HTyacG`alR|f z-P_oxzuKP!XX;>QR|+`JxU{r1kSu6vWo2b%78em=yFQ%t*lwkB=Jbnl#^5xOHai@z zmZapB&FA%Q&ZefOuU@?pcEt7VRA<3uMvL3>Hj8ZR>)Vdi^XTgB9T^`V9~%n|3=9kk zx_b5M$I#60>(XJjw(Tz19z=``t&>m+IoR5k1O#9cYZ2iPn{iXd_5dSvJYOhP`xgsc zp}Z!>JouVO&Y2N^-1HA2@x^}1rOfi`aO2v!gQ_ko@^5c4GMdiUyBj^YK}F?cZ%<^t6*-!xF+MsDr=c2kgJUg3| zl0rjF%;~&mgbX&evT{4wTP9&tIH2DbG5Vn9-}pLn!?U@i<@dpXnwr|@C-D(6F<1yD zHZ~aNF+$<uYOFvp9&(zP=Mvha#l?u8kz?C_2Cqc)2rKk0|P0%Z_*Ez#$#fTDjdgo8bvrUCdz2_ zWMF0n#ID>k{ENc*bv*dNweHyH2#5UvXJ}x*!RZmJ>fYdG&3V3nK?P}pFT~^&3Ww1 zJbwDL50p(u7>ylo;=zIaND-_8;7Q0~V`QevZfH?RNNBpky2YlhvT~xOrKPv`$x08C zPC-yaQc^)t5e*VKHZwC5mhph7vGJbAJl63r1_&e$j-tau$DlYLA9TK?P+A#SWpLYd z985EQ(H6gefST%RgGp*?YQTAA6_xb-{F&L=5T1?o_2}s6w4U)IJwkl^L>_C(5UJ9N ziuT;aUH_Jz@UbAm&<`K%p`#6uY|o?O;wph-fC$ss42m@s6;TK4-#K(^m7YC=A==sA z9vvR8c0FSEq1DmRdGqGY_iV+>pOK2}+LeRT)A#m`qfB`*MK?A##l^%J6cX2#m;JW! zuES9ch;dXRzkd%_rt#c{Q&9wlu(X0V}_Z3w*flmwh@ZqaEJ$(kF zVzQ>D=Gw-F0ipP=dY0WvuP6;U4>va^78bi+eQi#TZ2AR$B%LCol)JmT?ca-Q%)rKG zeqzGR%q*~Q*o?c3K~Y}5XKqf2p573I6(1j8OiWBwRh6!;ZgO(6tgI}+Oy(h_;c%ub zaOZTnrG}gw@Ht0hSFOY5vr83%aHq|5Q6KlSL!D}SW&wd(P&?-*`APs$L;6uFXVYat*6CIC!VZ;ucI^TusOCkzeYz#x6~ez zmzO7wL4@gie#}|DwXy<>YG1Z(IR1f$Xav5nwz7h~z!qnwrsNzucGc9?XKS5d1g$U5 zPcXV35Y3sl46WM(;fss6oSvQn9o)vb{pbC6v$C7h_8B!bt_lhYpsA##JD^Rw zySqVs(%EIe8Ln?{6X4?J=H-D>&M7RMt8@L9oy~YE%4BD^XK&C1B?czy?eCY$%asbD zbU@7sIyoI}ZEXSEgZ}w*cJzpcCw<51%^PMGmTLR;>lT$cs@Z?p@bTlvAt524hM}*I zZC+gW9#~D`cj||$qr-HiH=gj801hD`WAw}WO%2;$;#-O*w}8auSY<}sGRn%zc=`Bp zb8}&0e*<~I+`z*?9l-W9pNNPcg4_5!F9bZUF_v=j^G`Q7`}CQ-(9!}>q{F%WQBF^f zCaFbTL!;<<`Gzl{5Oiv?fU~W>J}u8c3)fOd_ec<-6w#e~_bjK%%;6zWb*TMXqkJqo zOl!&HR%2r$kca+!-HWgKO<*Om^ul4;o&e%zw&p+k7Kew2>yLi~M?_qY&zNIbn5{MQ zqQyzi&JJ)78tm#~W?(Qe`;Ct~?C+Ybm_wfcAQEkT z{rZD^59v+T5Kf2nZ=Uh?-z5C~n`2`Wd;4A=ij1pJMWf)kWL@Z@q&NmPA~pMHCkCyd zw08GuHmveu11Z7D#5-Ve*hCw#fdS4z4A1L5W4vv7IVuq)1H z8i%&}Ij$&_pT34@?u(u}x0j+Z|@o)2wKjuR&OM-f^%1$N(6>=Kcdj~V&-hm)l| z_9rL%<4!vx1UZR|*xb~Q2ltt)dyR%4a4l#>QxCqrLxkJ5zP^m!{3iOi78e0|+1KyKhQCS@p- zTm60h8Zjo)MXD?4yURTdM+Z3ma-&}{;H9dnqnaAy8^HtQx>YK&b;&Qma4HWE?+mYV zU66ZAW$4tt4R8@`0ploE>oME6BpB{2%5pu(xz@A6$D!>xFEtq(o2KyaqhBvxyc--gSo+gy zQi?#Fp3>kar7z+NWQj5TM-zDePxt%3%KSxVgCzh=|C@ zfajg}^$)iuK?j`A^ZEGpEMH6dx`>%1^j?AH;RuUAwl+ICijzXPs(WeoOY9YjkG#CR zGG&dA|8epE*~h`YC*}M1?;|22z#2|i9RgW^rc2Gsa|OX>)9~l;cz20`fx%1@q#AH@ zS0tn7+4du69egYdgp!t)Gay5Ew;W}NiJ95)$!ZFSI;s%u5+hl~0nf`Q-zNPVl$2n= z-OqPB;^M$9f?lX|Ju(o#BV}%3(GMyY;1uA^Oylj_V|aA2zM`U{u&}VJt7|+zcv(@< z&)Cv zcjZm`K7rX}XKevq$bOozvbczbXark(mGsull7m$eb`B2ILX)rMSUwncK9BRtk`mk3 zukWV}q<{m<$S}0G=RQU8c!GE}FuKWet- zTWTs|`bU#5HpCBM9gsYf6&Fud*_ld9V^7^h2E*mx;DCpRch^2Wqfobwl8np&_^P$F z)uT?rJ#$0V>)qDEf_~YX*=h%f0@n7{zi01a1hpa%P?-9Yl>~4#jCb!E8yUTIacOUD zT|imu)HrVM=!ki)=F)-#76*3aL zmb^hRFBg~Xa(6U<=$eSL4vvq6q@?@Fax4%B^)+c79e3Cm6^~V5SXk^_HGpkwtOmFj zaK=+Ay1MK{IBxFlHZzqlWyh|vP<1%+tu5_m&!ikpgZ}R1$s|U=z^b&Q!T!^FfykJEL=G^Ghs9_Nplq1T9Is0wRqwONr%141COAf_(g*o4yFhYQ*4AwX z#Rl?061T6^-H?xAt#Uiz@(_K)@&o->33flYe?PIb;9$J^-Hb4yPh7^`AkK$?cr+Ly zWq*3q*LHeP-)sx#(FS6Mwm0XdxTJpnV`1UG^;B7AW+v1qXk5cYLtTBe^3Br7$Vi}7 zT}=%?C+C~)DCWwCfP~+#N?);KW2AZD8&A4v;R~3o(Bg3qgX{a&sy+a)=0B_2 z*kZ&L%c`{piV%EFn$p`pr@sYV4}V=W!|LZ`x2;9A5xR%^*0bH+@0;`iTo$Nc){nq- zpX{$LQNgs;y_&6_n9vkTDdNrkw|!StR^I*n8%~&+oqc8hq)4|;PDbWSe!h0KeU8kX z_kn?$B}QE%IjU#~G&D5GH#G{i(GW~)ln*VUii%KxArH8?K={G@7V6X>Nl55z=DZXx zzzjiV#fA*tMXdl4%vQef?UbBM6_GY0- zZ#yBjw2&x6rlq8+N^cu1aXVsbXg%^`Ccw_o5wZtG85sz>V7}@-FFn-MMlxk1`%{E3 zLBti+pW+fw@jF7PETO4D&E}@!&32*c&)6S5a{9e7n&Nrk{PN{XP0cvaCQG$gkz)@{`>96)|4cCB-`2=s%EZ(!!A^gQ?&^95B6Pmi`Fl&tQt5z@yqw$= zn6!=2yexXC=`RwwD>Bj%e0=VE?Rw#ijEshIEdZ$h_WX26SFuV~6;y@_Z=M$3~xtx+xc&qq*b5b>G0(-^)GWwa&n&xK&glz$CAYKlrfl_tHm*h>3|wN=iydwCba} ze<6}p&=4ZBvR$pMKhIDN13f*idq0CDP}5B8E;ba({`4LL&lsenq(J>bg}Ge2kmPkP zzu%9H@$>QFAe9I#rAC+^^7FqiK&#a%8DfMS2$p<31U3h{_V~wbH}J3f&{%G6@Jtt% z(+ugb{=~=PZr?$J2Zn~~f)R!z<9_%sh>%+M15-=aJFC0b{e6Dij<@55+QV*>lOeyU zhnxV_aG4yXKt+`x9&pXr#KhzGs0NMac`;z%GgiTf8z=tslHipu-vgnFCHfYzWB`KP-RofTB=|r6Nar+c zkBg6=g*Y0Tu&&OXmJ8A%mV5VL&zaF55DSdd2!#GONhG^Alg=~-4kcb$Vg~8d!fm=#GyFEfXs%7#4sz$RrYYteaT^q_5L&kQCBr 
    The documentation for this class was generated from the following file: diff --git a/docs/html/d9/d69/Graph_8hpp_source.html b/docs/html/d9/d69/Graph_8hpp_source.html index df4495bfb..9ad502ff2 100644 --- a/docs/html/d9/d69/Graph_8hpp_source.html +++ b/docs/html/d9/d69/Graph_8hpp_source.html @@ -5,7 +5,7 @@ -CXXGraph: /github/workspace/include/Graph.hpp Source File +CXXGraph: /github/workspace/include/Graph/Graph.hpp Source File @@ -64,7 +64,7 @@
@@ -91,8 +91,8 @@
17 /*** License: AGPL v3.0 ***/
18 /***********************************************************/
19 
-
20 #ifndef __CXXGRAPH_H__
-
21 #define __CXXGRAPH_H__
+
20 #ifndef __GRAPH_H__
+
21 #define __GRAPH_H__
22 
23 #pragma once
24 
@@ -110,2379 +110,1380 @@
36 #include <fstream>
37 #include <limits.h>
38 #include <mutex>
-
39 #include "zlib.h"
-
40 
-
41 namespace CXXGRAPH
-
42 {
-
43  //STRING ERROR CONST EXPRESSION
-
44  constexpr char ERR_NO_DIR_OR_UNDIR_EDGE[] = "Edge are neither Directed neither Undirected";
-
45  constexpr char ERR_NO_WEIGHTED_EDGE[] = "Edge are not Weighted";
-
46  constexpr char ERR_TARGET_NODE_NOT_REACHABLE[] = "Target Node not Reachable";
-
47  constexpr char ERR_TARGET_NODE_NOT_IN_GRAPH[] = "Target Node not inside Graph";
-
48  constexpr char ERR_SOURCE_NODE_NOT_IN_GRAPH[] = "Source Node not inside Graph";
-
50  constexpr double INF_DOUBLE = std::numeric_limits<double>::max();
-
51  template <typename T>
-
52  class Node;
-
53  template <typename T>
-
54  class Edge;
-
55  template <typename T>
-
56  class DirectedEdge;
-
57  template <typename T>
-
58  class UndirectedEdge;
-
59  template <typename T>
-
60  class DirectedWeightedEdge;
-
61  template <typename T>
-
62  class UndirectedWeightedEdge;
-
63  template <typename T>
-
64  class Graph;
-
65  template <typename T>
-
66  class Partition;
+
39 #include <set>
+
40 #include <atomic>
+
41 #include <thread>
+
42 #include <cmath>
+
43 #include "zlib.h"
+
44 
+
45 #include "Edge/Weighted.hpp"
+
46 #include "Node/Node.hpp"
+
47 #include "Edge/Edge.hpp"
+
48 #include "Edge/DirectedEdge.hpp"
+
49 #include "Edge/UndirectedEdge.hpp"
+
50 #include "Edge/DirectedWeightedEdge.hpp"
+
51 #include "Edge/UndirectedWeightedEdge.hpp"
+
52 #include "Utility/ThreadSafe.hpp"
+
53 #include "Utility/Writer.hpp"
+
54 #include "Utility/Reader.hpp"
+
55 #include "Utility/ConstString.hpp"
+
56 #include "Utility/ConstValue.hpp"
+
57 #include "Utility/Typedef.hpp"
+
58 #include "Partitioning/Partition.hpp"
+
59 #include "Partitioning/PartitionAlgorithm.hpp"
+
60 
+
61 namespace CXXGRAPH
+
62 {
+
63  namespace PARTITIONING{
+
64  template<typename T>
+
65  class Partition;
+
66  }
67 
-
68  class Weighted;
-
69 
-
70  class ThreadSafe;
-
71 
-
72  template <typename T>
-
73  class Writer;
+
68  template <typename T>
+
69  std::ostream &operator<<(std::ostream &o, const Graph<T> &graph);
+
70  template <typename T>
+
71  std::ostream &operator<<(std::ostream &o, const AdjacencyMatrix<T> &adj);
+
72 
74  template <typename T>
-
75  class Reader;
-
76 
-
78  struct DijkstraResult_struct
-
79  {
-
80  bool success; // TRUE if the function does not return error, FALSE otherwise
-
81  std::string errorMessage; //message of error
-
82  double result; //result (valid only if success is TRUE)
-
83  };
-
84  typedef DijkstraResult_struct DijkstraResult;
-
85 
-
87  struct DialResult_struct
-
88  {
-
89  bool success; // TRUE if the function does not return error, FALSE otherwise
-
90  std::string errorMessage; //message of error
-
91  std::map<unsigned long, long> minDistanceMap; //result a map that contains the node id and the minumum distance from source (valid only if success is TRUE)
-
92  };
-
93  typedef DialResult_struct DialResult;
-
94 
-
96  struct PartitioningStats_struct
-
97  {
-
98  unsigned int numberOfPartitions; // The number of Partitions
-
99  unsigned int numberOfNodes; // The number of Nodes
-
100  unsigned int replicatedNodesCount; // The number of Nodes that are replicated
-
101  unsigned int numberOfEdges; // The number of edges
-
102  unsigned int replicatedEdgesCount; // The number of edges that are replicated
-
103  unsigned int maxEdgesLoad; // Maximum edges load of the partitions
-
104  unsigned int minEdgesLoad; // Minimun edges load of the partitions
-
105  unsigned int maxNodesLoad; // Maximum nodes load of the partitions
-
106  unsigned int minNodesLoad; // Minimun nodes load of the partitions
-
107  double balanceEdgesFactor; // The balance edges factor of the partitions (maxEdgesLoad - minEdgesLoad) / (maxEdgesLoad), 0 is the optimal partitioning
-
108  double balanceNodesFactor; // The balance edges factor of the partitions (maxNodesLoad - minNodesLoad) / (maxNodesLoad), 0 is the optimal partitioning
-
109  double nodesReplicationFactor; // The replication factor of the Nodes (replicatedNodesCount / numberOfNodes), 1 is the optimal partitioning
-
110  double edgesReplicationFactor; // The replication factor of the edges (replicatedEdgesCount / numberOfEdges), 1 is the optimal partitioning
-
111 
-
112  friend std::ostream &operator<<(std::ostream &os, const PartitioningStats_struct &partitionStats)
-
113  {
-
114  os << "Partitioning Stats:\n";
-
115  os << "\tNumber of Partitions: " << partitionStats.numberOfPartitions << "\n";
-
116  os << "\tNumber of Nodes: " << partitionStats.numberOfNodes << "\n";
-
117  os << "\tNumber of Edges: " << partitionStats.numberOfEdges << "\n";
-
118  os << "\tNumber of Nodes Replica: " << partitionStats.replicatedNodesCount << "\n";
-
119  os << "\tNumber of Edges Replica: " << partitionStats.replicatedEdgesCount << "\n";
-
120  os << "\tNodes Replication Factor: " << partitionStats.nodesReplicationFactor << "\n";
-
121  os << "\tEdges Replication Factor: " << partitionStats.edgesReplicationFactor << "\n";
-
122  os << "\tMax Edges Load: " << partitionStats.maxEdgesLoad << "\n";
-
123  os << "\tMin Edges Load: " << partitionStats.minEdgesLoad << "\n";
-
124  os << "\tBalance Edges Factor: " << partitionStats.balanceEdgesFactor << "\n";
-
125  os << "\tMax Nodes Load: " << partitionStats.maxNodesLoad << "\n";
-
126  os << "\tMin Nodes Load: " << partitionStats.minNodesLoad << "\n";
-
127  os << "\tBalance Nodes Factor: " << partitionStats.balanceNodesFactor << "\n";
-
128  return os;
-
129  }
-
130  };
-
131  typedef PartitioningStats_struct PartitioningStats;
-
132 
-
133  template <typename T>
-
134  using AdjacencyMatrix = std::map<const Node<T> *, std::vector<std::pair<const Node<T> *, const Edge<T> *>>>;
-
135 
-
136  template <typename T>
-
137  std::ostream &operator<<(std::ostream &o, const Node<T> &node);
-
138  template <typename T>
-
139  std::ostream &operator<<(std::ostream &o, const Edge<T> &edge);
-
140  template <typename T>
-
141  std::ostream &operator<<(std::ostream &o, const DirectedEdge<T> &edge);
-
142  template <typename T>
-
143  std::ostream &operator<<(std::ostream &o, const UndirectedEdge<T> &edge);
-
144  template <typename T>
-
145  std::ostream &operator<<(std::ostream &o, const DirectedWeightedEdge<T> &edge);
-
146  template <typename T>
-
147  std::ostream &operator<<(std::ostream &o, const UndirectedWeightedEdge<T> &edge);
-
148  template <typename T>
-
149  std::ostream &operator<<(std::ostream &o, const Graph<T> &graph);
-
150  template <typename T>
-
151  std::ostream &operator<<(std::ostream &o, const AdjacencyMatrix<T> &adj);
-
152  template <typename T>
-
153  using PartitionMap = std::map<unsigned int, Partition<T> *>;
-
154 
-
155  template <typename T>
-
156  class Node
-
157  {
-
158  private:
-
159  unsigned long id;
-
160  T data;
-
161 
-
162  public:
-
163  Node(const unsigned long id, const T &data);
-
164  ~Node() = default;
-
165  const unsigned long &getId() const;
-
166  const T &getData() const;
-
167  //operator
-
168  bool operator==(const Node<T> &b) const;
-
169  bool operator<(const Node<T> &b) const;
-
170  friend std::ostream &operator<<<>(std::ostream &os, const Node<T> &node);
-
171  };
-
172 
-
173  template <typename T>
-
174  Node<T>::Node(const unsigned long id, const T &data)
-
175  {
-
176  this->id = id;
-
177  this->data = data;
-
178  }
-
179 
-
180  template <typename T>
-
181  const unsigned long &Node<T>::getId() const
-
182  {
-
183  return id;
-
184  }
-
185 
-
186  template <typename T>
-
187  const T &Node<T>::getData() const
-
188  {
-
189  return data;
-
190  }
-
191 
-
192  template <typename T>
-
193  bool Node<T>::operator==(const Node<T> &b) const
-
194  {
-
195  return (this->id == b.id && this->data == b.data);
-
196  }
-
197 
-
198  template <typename T>
-
199  bool Node<T>::operator<(const Node<T> &b) const
-
200  {
-
201  return (this->id < b.id);
-
202  }
-
203 
-
204  class Weighted
-
205  {
-
206  private:
-
207  double weight;
-
208 
-
209  public:
-
210  Weighted();
-
211  Weighted(const double weight);
-
212  virtual ~Weighted() = default;
-
213  double getWeight() const;
-
214  void setWeight(const double weight);
-
215  };
-
216 
-
217  //inline because the implementation of non-template function in header file
-
218  inline Weighted::Weighted()
-
219  {
-
220  weight = 0.0;
-
221  }
-
222 
-
223  //inline because the implementation of non-template function in header file
-
224  inline Weighted::Weighted(const double weight)
-
225  {
-
226  this->weight = weight;
-
227  }
-
228 
-
229  //inline because the implementation of non-template function in header file
-
230  inline double Weighted::getWeight() const
-
231  {
-
232  return weight;
-
233  }
-
234 
-
235  //inline because the implementation of non-template function in header file
-
236  inline void Weighted::setWeight(const double weight)
-
237  {
-
238  this->weight = weight;
-
239  }
-
240 
-
241  class ThreadSafe
-
242  {
-
243  public:
-
244  void getLock() const;
-
245  void releaseLock() const;
-
246 
-
247  protected:
-
248  mutable std::mutex mutex;
-
249  };
-
250  //inline because the implementation of non-template function in header file
-
251  inline void ThreadSafe::getLock() const
-
252  {
-
253  mutex.lock();
-
254  }
-
255  //inline because the implementation of non-template function in header file
-
256  inline void ThreadSafe::releaseLock() const
-
257  {
-
258  mutex.unlock();
-
259  }
-
260 
-
261  template <typename T>
-
262  class Edge
-
263  {
-
264  private:
-
265  unsigned long id;
-
266  std::pair<const Node<T> *, const Node<T> *> nodePair;
-
267 
-
268  public:
-
269  Edge(const unsigned long id, const Node<T> &node1, const Node<T> &node2);
-
270  Edge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair);
-
271  virtual ~Edge() = default;
-
272  const unsigned long &getId() const;
-
273  const std::pair<const Node<T> *, const Node<T> *> &getNodePair() const;
-
274  virtual const std::optional<bool> isDirected() const;
-
275  virtual const std::optional<bool> isWeighted() const;
-
276  //operator
-
277  virtual bool operator==(const Edge<T> &b) const;
-
278  bool operator<(const Edge<T> &b) const;
-
279  //operator DirectedEdge<T>() const { return DirectedEdge<T>(id, nodePair); }
-
280  //operator UndirectedEdge<T>() const { return UndirectedEdge<T>(id, nodePair); }
-
281 
-
282  friend std::ostream &operator<<<>(std::ostream &os, const Edge<T> &edge);
-
283  };
-
284 
-
285  template <typename T>
-
286  Edge<T>::Edge(const unsigned long id, const Node<T> &node1, const Node<T> &node2) : nodePair(&node1, &node2)
-
287  {
-
288  this->id = id;
-
289  }
-
290 
-
291  template <typename T>
-
292  Edge<T>::Edge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair) : nodePair(nodepair)
-
293  {
-
294  this->id = id;
-
295  }
-
296 
-
297  template <typename T>
-
298  const unsigned long &Edge<T>::getId() const
-
299  {
-
300  return id;
-
301  }
-
302 
-
303  template <typename T>
-
304  const std::pair<const Node<T> *, const Node<T> *> &Edge<T>::getNodePair() const
-
305  {
-
306  return nodePair;
-
307  }
-
308 
-
309  template <typename T>
-
310  const std::optional<bool> Edge<T>::isDirected() const
-
311  {
-
312  return std::nullopt;
-
313  }
-
314 
-
315  template <typename T>
-
316  const std::optional<bool> Edge<T>::isWeighted() const
-
317  {
-
318  return std::nullopt;
-
319  }
-
320 
-
321  template <typename T>
-
322  bool Edge<T>::operator==(const Edge<T> &b) const
-
323  {
-
324  return (this->id == b.id && this->nodePair == b.nodePair);
-
325  }
-
326 
-
327  template <typename T>
-
328  bool Edge<T>::operator<(const Edge<T> &b) const
-
329  {
-
330  return (this->id < b.id);
-
331  }
-
332 
-
333  template <typename T>
-
334  class DirectedEdge : public Edge<T>
-
335  {
-
336  public:
-
337  DirectedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2);
-
338  DirectedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair);
-
339  DirectedEdge(const Edge<T> &edge);
-
340  virtual ~DirectedEdge() = default;
-
341  const Node<T> &getFrom() const;
-
342  const Node<T> &getTo() const;
-
343  const std::optional<bool> isDirected() const override;
-
344  const std::optional<bool> isWeighted() const override;
-
345  //operator
-
346  explicit operator UndirectedEdge<T>() const { return UndirectedEdge<T>(Edge<T>::getId(), Edge<T>::getNodePair()); }
-
347 
-
348  friend std::ostream &operator<<<>(std::ostream &os, const DirectedEdge<T> &edge);
-
349  };
-
350 
-
351  template <typename T>
-
352  DirectedEdge<T>::DirectedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2) : Edge<T>(id, node1, node2)
-
353  {
-
354  }
-
355 
-
356  template <typename T>
-
357  DirectedEdge<T>::DirectedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair) : Edge<T>(id, nodepair)
-
358  {
-
359  }
-
360 
-
361  template <typename T>
-
362  DirectedEdge<T>::DirectedEdge(const Edge<T> &edge) : DirectedEdge(edge.getId(), *(edge.getNodePair().first), *(edge.getNodePair().second))
-
363  {
-
364  }
-
365 
-
366  template <typename T>
-
367  const Node<T> &DirectedEdge<T>::getFrom() const
-
368  {
-
369  return *(Edge<T>::getNodePair().first);
-
370  }
-
371 
-
372  template <typename T>
-
373  const Node<T> &DirectedEdge<T>::getTo() const
-
374  {
-
375  return *(Edge<T>::getNodePair().second);
-
376  }
-
377 
-
378  template <typename T>
-
379  const std::optional<bool> DirectedEdge<T>::isDirected() const
-
380  {
-
381  return true;
-
382  }
-
383 
-
384  template <typename T>
-
385  const std::optional<bool> DirectedEdge<T>::isWeighted() const
-
386  {
-
387  return false;
-
388  }
-
389 
-
390  template <typename T>
-
391  class UndirectedEdge : public Edge<T>
-
392  {
-
393  public:
-
394  UndirectedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2);
-
395  UndirectedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair);
-
396  UndirectedEdge(const Edge<T> &edge);
-
397  virtual ~UndirectedEdge() = default;
-
398  const Node<T> &getNode1() const;
-
399  const Node<T> &getNode2() const;
-
400  const std::optional<bool> isDirected() const override;
-
401  const std::optional<bool> isWeighted() const override;
-
402  //operator
-
403  explicit operator DirectedEdge<T>() const { return DirectedEdge<T>(Edge<T>::getId(), Edge<T>::getNodePair()); }
-
404 
-
405  friend std::ostream &operator<<<>(std::ostream &os, const UndirectedEdge<T> &edge);
-
406  };
+
75  class Graph
+
76  {
+
77  private:
+
78  std::list<const Edge<T> *> edgeSet;
+
79  void addElementToAdjMatrix(AdjacencyMatrix<T> &adjMatrix, const Node<T> *nodeFrom, const Node<T> *nodeTo, const Edge<T> *edge) const;
+
80  int writeToStandardFile_csv(const std::string &workingDir, const std::string &OFileName, bool compress, bool writeNodeFeat, bool writeEdgeWeight) const;
+
81  int readFromStandardFile_csv(const std::string &workingDir, const std::string &OFileName, bool compress, bool readNodeFeat, bool readEdgeWeight);
+
82  int writeToStandardFile_tsv(const std::string &workingDir, const std::string &OFileName, bool compress, bool writeNodeFeat, bool writeEdgeWeight) const;
+
83  int readFromStandardFile_tsv(const std::string &workingDir, const std::string &OFileName, bool compress, bool readNodeFeat, bool readEdgeWeight);
+
84  void recreateGraphFromReadFiles(std::map<unsigned long, std::pair<unsigned long, unsigned long>> &edgeMap, std::map<unsigned long, bool> &edgeDirectedMap, std::map<unsigned long, T> &nodeFeatMap, std::map<unsigned long, double> &edgeWeightMap);
+
85  int compressFile(const std::string &inputFile, const std::string &outputFile) const;
+
86  int decompressFile(const std::string &inputFile, const std::string &outputFile) const;
+
87  void greedyPartition(PartitionMap<T> &partitionMap) const;
+
88  void HDRFPartition(PartitionMap<T> &partitionMap) const;
+
89 
+
90  public:
+
91  Graph() = default;
+
92  Graph(const std::list<const Edge<T> *> &edgeSet);
+
93  ~Graph() = default;
+
102  virtual const std::list<const Edge<T> *> &getEdgeSet() const;
+
111  virtual void setEdgeSet(std::list<const Edge<T> *> &edgeSet);
+
120  virtual void addEdge(const Edge<T> *edge);
+
129  virtual void removeEdge(unsigned long edgeId);
+
138  virtual const std::list<const Node<T> *> getNodeSet() const;
+
148  virtual const std::optional<const Edge<T> *> getEdge(unsigned long edgeId) const;
+
154  virtual const AdjacencyMatrix<T> getAdjMatrix() const;
+
167  virtual const DijkstraResult dijkstra(const Node<T> &source, const Node<T> &target) const;
+
178  virtual const std::vector<Node<T>> breadth_first_search(const Node<T> &start) const;
+
189  virtual const std::vector<Node<T>> depth_first_search(const Node<T> &start) const;
+
190 
+
199  virtual bool isCyclicDirectedGraphDFS() const;
+
200 
+
209  virtual bool isCyclicDirectedGraphBFS() const;
+
210 
+
218  virtual bool isDirectedGraph() const;
+
219 
+
246  virtual const DialResult dial(const Node<T> &source, int maxWeight) const;
+
247 
+
261  virtual int writeToFile(InputOutputFormat format = InputOutputFormat::STANDARD_CSV, const std::string &workingDir = ".", const std::string &OFileName = "graph", bool compress = false, bool writeNodeFeat = false, bool writeEdgeWeight = false) const;
+
262 
+
276  virtual int readFromFile(InputOutputFormat format = InputOutputFormat::STANDARD_CSV, const std::string &workingDir = ".", const std::string &OFileName = "graph", bool compress = false, bool readNodeFeat = false, bool readEdgeWeight = false);
+
277 
+
287  virtual PartitionMap<T> partitionGraph(PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const;
+
288 
+
289  friend std::ostream &operator<<<>(std::ostream &os, const Graph<T> &graph);
+
290  friend std::ostream &operator<<<>(std::ostream &os, const AdjacencyMatrix<T> &adj);
+
291  };
+
292 
+
293  template <typename T>
+
294  Graph<T>::Graph(const std::list<const Edge<T> *> &edgeSet)
+
295  {
+
296  for (auto edgeSetIt = edgeSet.begin(); edgeSetIt != edgeSet.end(); ++edgeSetIt)
+
297  {
+
298  if (std::find_if(this->edgeSet.begin(), this->edgeSet.end(), [edgeSetIt](const Edge<T> *edge)
+
299  { return (*edge == **edgeSetIt); }) == this->edgeSet.end())
+
300  {
+
301  this->edgeSet.push_back(*edgeSetIt);
+
302  }
+
303  }
+
304  }
+
305 
+
306  template <typename T>
+
307  const std::list<const Edge<T> *> &Graph<T>::getEdgeSet() const
+
308  {
+
309  return edgeSet;
+
310  }
+
311 
+
312  template <typename T>
+
313  void Graph<T>::setEdgeSet(std::list<const Edge<T> *> &edgeSet)
+
314  {
+
315  this->edgeSet.clear();
+
316  for (auto edgeSetIt = edgeSet.begin(); edgeSetIt != edgeSet.end(); ++edgeSetIt)
+
317  {
+
318  if (std::find_if(this->edgeSet.begin(), this->edgeSet.end(), [edgeSetIt](const Edge<T> *edge)
+
319  { return (*edge == **edgeSetIt); }) == this->edgeSet.end())
+
320  {
+
321  this->edgeSet.push_back(*edgeSetIt);
+
322  }
+
323  }
+
324  }
+
325 
+
326  template <typename T>
+
327  void Graph<T>::addEdge(const Edge<T> *edge)
+
328  {
+
329  if (std::find_if(edgeSet.begin(), edgeSet.end(), [edge](const Edge<T> *edge_a)
+
330  { return (*edge == *edge_a); }) == edgeSet.end())
+
331  {
+
332  edgeSet.push_back(edge);
+
333  }
+
334  }
+
335 
+
336  template <typename T>
+
337  void Graph<T>::removeEdge(unsigned long edgeId)
+
338  {
+
339  auto edgeOpt = Graph<T>::getEdge(edgeId);
+
340  if (edgeOpt.has_value())
+
341  {
+
342  edgeSet.erase(std::find_if(this->edgeSet.begin(), this->edgeSet.end(), [edgeOpt](const Edge<T> *edge)
+
343  { return (*(edgeOpt.value()) == *edge); }));
+
344  }
+
345  }
+
346 
+
347  template <typename T>
+
348  const std::list<const Node<T> *> Graph<T>::getNodeSet() const
+
349  {
+
350  std::list<const Node<T> *> nodeSet;
+
351  for (auto edge : edgeSet)
+
352  {
+
353  if (std::find_if(nodeSet.begin(), nodeSet.end(), [edge](const Node<T> *node)
+
354  { return (*edge->getNodePair().first == *node); }) == nodeSet.end())
+
355  {
+
356  nodeSet.push_back(edge->getNodePair().first);
+
357  }
+
358  if (std::find_if(nodeSet.begin(), nodeSet.end(), [edge](const Node<T> *node)
+
359  { return (*edge->getNodePair().second == *node); }) == nodeSet.end())
+
360  {
+
361  nodeSet.push_back(edge->getNodePair().second);
+
362  }
+
363  }
+
364  return nodeSet;
+
365  }
+
366 
+
367  template <typename T>
+
368  const std::optional<const Edge<T> *> Graph<T>::getEdge(unsigned long edgeId) const
+
369  {
+
370 
+
371  auto it = edgeSet.begin();
+
372  for (it; it != edgeSet.end(); ++it)
+
373  {
+
374  if ((*it)->getId() == edgeId)
+
375  {
+
376  return *it;
+
377  }
+
378  }
+
379 
+
380  return std::nullopt;
+
381  }
+
382 
+
383  template <typename T>
+
384  void Graph<T>::addElementToAdjMatrix(AdjacencyMatrix<T> &adjMatrix, const Node<T> *nodeFrom, const Node<T> *nodeTo, const Edge<T> *edge) const
+
385  {
+
386  std::pair<const Node<T> *, const Edge<T> *> elem = {nodeTo, edge};
+
387  adjMatrix[nodeFrom].push_back(elem);
+
388 
+
389  //adjMatrix[nodeFrom.getId()].push_back(std::make_pair<const Node<T>,const Edge<T>>(nodeTo, edge));
+
390  }
+
391 
+
392  template <typename T>
+
393  int Graph<T>::writeToStandardFile_csv(const std::string &workingDir, const std::string &OFileName, bool compress, bool writeNodeFeat, bool writeEdgeWeight) const
+
394  {
+
395  std::ofstream ofileGraph;
+
396  std::string completePathToFileGraph = workingDir + "/" + OFileName + ".csv";
+
397  ofileGraph.open(completePathToFileGraph);
+
398  if (!ofileGraph.is_open())
+
399  {
+
400  // ERROR File Not Open
+
401  return -1;
+
402  }
+
403  auto printOutGraph = [&ofileGraph](const Edge<T> *e)
+
404  { ofileGraph << e->getId() << "," << e->getNodePair().first->getId() << "," << e->getNodePair().second->getId() << "," << ((e->isDirected().has_value() && e->isDirected().value()) ? 1 : 0) << std::endl; };
+
405  std::for_each(edgeSet.cbegin(), edgeSet.cend(), printOutGraph);
+
406  ofileGraph.close();
407 
-
408  template <typename T>
-
409  UndirectedEdge<T>::UndirectedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2) : Edge<T>(id, node1, node2)
-
410  {
-
411  }
-
412 
-
413  template <typename T>
-
414  UndirectedEdge<T>::UndirectedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair) : Edge<T>(id, nodepair)
-
415  {
-
416  }
-
417 
-
418  template <typename T>
-
419  UndirectedEdge<T>::UndirectedEdge(const Edge<T> &edge) : UndirectedEdge(edge.getId(), *(edge.getNodePair().first), *(edge.getNodePair().second))
-
420  {
-
421  }
-
422 
-
423  template <typename T>
-
424  const Node<T> &UndirectedEdge<T>::getNode1() const
-
425  {
-
426  return *(Edge<T>::getNodePair().first);
-
427  }
-
428 
-
429  template <typename T>
-
430  const Node<T> &UndirectedEdge<T>::getNode2() const
-
431  {
-
432  return *(Edge<T>::getNodePair().second);
-
433  }
-
434 
-
435  template <typename T>
-
436  const std::optional<bool> UndirectedEdge<T>::isDirected() const
-
437  {
-
438  return false;
-
439  }
-
440 
-
441  template <typename T>
-
442  const std::optional<bool> UndirectedEdge<T>::isWeighted() const
-
443  {
-
444  return false;
-
445  }
-
446 
-
447  template <typename T>
-
448  class DirectedWeightedEdge : public DirectedEdge<T>, public Weighted
-
449  {
-
450  public:
-
451  DirectedWeightedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2, const double weight);
-
452  DirectedWeightedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair, const double weight);
-
453  DirectedWeightedEdge(const DirectedEdge<T> &edge, const double weight);
-
454  DirectedWeightedEdge(const Edge<T> &edge, const double weight);
-
455  DirectedWeightedEdge(const DirectedEdge<T> &edge);
-
456  DirectedWeightedEdge(const Edge<T> &edge);
-
457  DirectedWeightedEdge(const UndirectedWeightedEdge<T> &edge);
-
458  virtual ~DirectedWeightedEdge() = default;
-
459  const std::optional<bool> isWeighted() const override;
-
460  //operator
-
461  explicit operator UndirectedWeightedEdge<T>() const { return UndirectedWeightedEdge<T>(Edge<T>::getId(), Edge<T>::getNodePair(), Weighted::getWeight()); }
-
462 
-
463  friend std::ostream &operator<<<>(std::ostream &os, const DirectedWeightedEdge<T> &edge);
-
464  };
-
465 
-
466  template <typename T>
-
467  DirectedWeightedEdge<T>::DirectedWeightedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2, const double weight) : DirectedEdge<T>(id, node1, node2), Weighted(weight)
-
468  {
-
469  }
-
470 
-
471  template <typename T>
-
472  DirectedWeightedEdge<T>::DirectedWeightedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair, const double weight) : DirectedEdge<T>(id, nodepair), Weighted(weight)
-
473  {
-
474  }
-
475 
-
476  template <typename T>
-
477  DirectedWeightedEdge<T>::DirectedWeightedEdge(const DirectedEdge<T> &edge, const double weight) : DirectedEdge<T>(edge), Weighted(weight)
-
478  {
-
479  }
-
480 
-
481  template <typename T>
-
482  DirectedWeightedEdge<T>::DirectedWeightedEdge(const Edge<T> &edge, const double weight) : DirectedEdge<T>(edge), Weighted(weight)
-
483  {
-
484  }
-
485 
-
486  template <typename T>
-
487  DirectedWeightedEdge<T>::DirectedWeightedEdge(const DirectedEdge<T> &edge) : DirectedEdge<T>(edge), Weighted()
-
488  {
-
489  }
-
490 
-
491  template <typename T>
-
492  DirectedWeightedEdge<T>::DirectedWeightedEdge(const Edge<T> &edge) : DirectedEdge<T>(edge), Weighted()
-
493  {
-
494  }
-
495 
-
496  template <typename T>
-
497  DirectedWeightedEdge<T>::DirectedWeightedEdge(const UndirectedWeightedEdge<T> &edge) : DirectedEdge<T>(edge), Weighted(edge.getWeight())
-
498  {
-
499  }
-
500 
-
501  template <typename T>
-
502  const std::optional<bool> DirectedWeightedEdge<T>::isWeighted() const
-
503  {
-
504  return true;
-
505  }
-
506 
-
507  template <typename T>
-
508  class UndirectedWeightedEdge : public UndirectedEdge<T>, public Weighted
-
509  {
-
510  public:
-
511  UndirectedWeightedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2, const double weight);
-
512  UndirectedWeightedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair, const double weight);
-
513  UndirectedWeightedEdge(const UndirectedEdge<T> &edge, const double weight);
-
514  UndirectedWeightedEdge(const Edge<T> &edge, const double weight);
-
515  UndirectedWeightedEdge(const UndirectedEdge<T> &edge);
-
516  UndirectedWeightedEdge(const Edge<T> &edge);
-
517  UndirectedWeightedEdge(const DirectedWeightedEdge<T> &edge);
-
518  virtual ~UndirectedWeightedEdge() = default;
-
519  const std::optional<bool> isWeighted() const override;
-
520  //operator
-
521  explicit operator DirectedWeightedEdge<T>() const { return DirectedWeightedEdge<T>(Edge<T>::getId(), Edge<T>::getNodePair(), Weighted::getWeight()); }
-
522 
-
523  friend std::ostream &operator<<<>(std::ostream &os, const UndirectedWeightedEdge<T> &edge);
-
524  };
-
525 
-
526  template <typename T>
-
527  UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2, const double weight) : UndirectedEdge<T>(id, node1, node2), Weighted(weight)
-
528  {
-
529  }
-
530 
-
531  template <typename T>
-
532  UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair, const double weight) : UndirectedEdge<T>(id, nodepair), Weighted(weight)
-
533  {
-
534  }
-
535 
-
536  template <typename T>
-
537  UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const UndirectedEdge<T> &edge, const double weight) : UndirectedEdge<T>(edge), Weighted(weight)
-
538  {
-
539  }
-
540 
-
541  template <typename T>
-
542  UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const Edge<T> &edge, const double weight) : UndirectedEdge<T>(edge), Weighted(weight)
-
543  {
-
544  }
-
545 
-
546  template <typename T>
-
547  UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const UndirectedEdge<T> &edge) : UndirectedEdge<T>(edge), Weighted()
-
548  {
-
549  }
-
550 
-
551  template <typename T>
-
552  UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const Edge<T> &edge) : UndirectedEdge<T>(edge), Weighted()
-
553  {
-
554  }
-
555 
-
556  template <typename T>
-
557  UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const DirectedWeightedEdge<T> &edge) : UndirectedEdge<T>(edge), Weighted(edge.getWeight())
-
558  {
-
559  }
-
560 
-
561  template <typename T>
-
562  const std::optional<bool> UndirectedWeightedEdge<T>::isWeighted() const
-
563  {
-
564  return true;
-
565  }
-
566 
-
567  template <typename T>
-
568  class Partition;
-
569 
-
571  template <typename T>
-
572  class Graph
-
573  {
-
574  private:
-
575  std::list<const Edge<T> *> edgeSet;
-
576  void addElementToAdjMatrix(AdjacencyMatrix<T> &adjMatrix, const Node<T> *nodeFrom, const Node<T> *nodeTo, const Edge<T> *edge) const;
-
577  int writeToStandardFile_csv(const std::string &workingDir, const std::string &OFileName, bool compress, bool writeNodeFeat, bool writeEdgeWeight) const;
-
578  int readFromStandardFile_csv(const std::string &workingDir, const std::string &OFileName, bool compress, bool readNodeFeat, bool readEdgeWeight);
-
579  int writeToStandardFile_tsv(const std::string &workingDir, const std::string &OFileName, bool compress, bool writeNodeFeat, bool writeEdgeWeight) const;
-
580  int readFromStandardFile_tsv(const std::string &workingDir, const std::string &OFileName, bool compress, bool readNodeFeat, bool readEdgeWeight);
-
581  void recreateGraphFromReadFiles(std::map<unsigned long, std::pair<unsigned long, unsigned long>> &edgeMap, std::map<unsigned long, bool> &edgeDirectedMap, std::map<unsigned long, T> &nodeFeatMap, std::map<unsigned long, double> &edgeWeightMap);
-
582  int compressFile(const std::string &inputFile, const std::string &outputFile) const;
-
583  int decompressFile(const std::string &inputFile, const std::string &outputFile) const;
-
584  void greedyPartition(PartitionMap<T> &partitionMap) const;
+
408  if (writeNodeFeat)
+
409  {
+
410  std::ofstream ofileNodeFeat;
+
411  std::string completePathToFileNodeFeat = workingDir + "/" + OFileName + "_NodeFeat"
+
412  ".csv";
+
413  ofileNodeFeat.open(completePathToFileNodeFeat);
+
414  if (!ofileNodeFeat.is_open())
+
415  {
+
416  // ERROR File Not Open
+
417  return -1;
+
418  }
+
419  auto printOutNodeFeat = [&ofileNodeFeat](const Node<T> *node)
+
420  { ofileNodeFeat << node->getId() << "," << node->getData() << std::endl; };
+
421  auto nodeSet = getNodeSet();
+
422  std::for_each(nodeSet.cbegin(), nodeSet.cend(), printOutNodeFeat);
+
423  ofileNodeFeat.close();
+
424  }
+
425 
+
426  if (writeEdgeWeight)
+
427  {
+
428  std::ofstream ofileEdgeWeight;
+
429  std::string completePathToFileEdgeWeight = workingDir + "/" + OFileName + "_EdgeWeight"
+
430  ".csv";
+
431  ofileEdgeWeight.open(completePathToFileEdgeWeight);
+
432  if (!ofileEdgeWeight.is_open())
+
433  {
+
434  // ERROR File Not Open
+
435  return -1;
+
436  }
+
437  auto printOutEdgeWeight = [&ofileEdgeWeight](const Edge<T> *e)
+
438  { ofileEdgeWeight << e->getId() << "," << (e->isWeighted().has_value() && e->isWeighted().value() ? (dynamic_cast<const Weighted *>(e))->getWeight() : 0.0) << "," << (e->isWeighted().has_value() && e->isWeighted().value() ? 1 : 0) << std::endl; };
+
439 
+
440  std::for_each(edgeSet.cbegin(), edgeSet.cend(), printOutEdgeWeight);
+
441  ofileEdgeWeight.close();
+
442  }
+
443  return 0;
+
444  }
+
445 
+
446  template <typename T>
+
447  int Graph<T>::readFromStandardFile_csv(const std::string &workingDir, const std::string &OFileName, bool compress, bool readNodeFeat, bool readEdgeWeight)
+
448  {
+
449  std::ifstream ifileGraph;
+
450  std::ifstream ifileNodeFeat;
+
451  std::ifstream ifileEdgeWeight;
+
452  std::map<unsigned long, std::pair<unsigned long, unsigned long>> edgeMap;
+
453  std::map<unsigned long, bool> edgeDirectedMap;
+
454  std::map<unsigned long, T> nodeFeatMap;
+
455  std::map<unsigned long, double> edgeWeightMap;
+
456  std::string completePathToFileGraph = workingDir + "/" + OFileName + ".csv";
+
457  ifileGraph.open(completePathToFileGraph);
+
458  if (!ifileGraph.is_open())
+
459  {
+
460  // ERROR File Not Open
+
461  return -1;
+
462  }
+
463  char comma;
+
464  for (;;)
+
465  { /* loop continually */
+
466  unsigned long edgeId;
+
467  unsigned long nodeId1;
+
468  unsigned long nodeId2;
+
469  bool directed;
+
470  ifileGraph >> edgeId >> comma >> nodeId1 >> comma >> nodeId2 >> comma >> directed;
+
471  edgeMap[edgeId] = std::pair<unsigned long, unsigned long>(nodeId1, nodeId2);
+
472  edgeDirectedMap[edgeId] = directed;
+
473  if (ifileGraph.fail() || ifileGraph.eof())
+
474  break;
+
475  ifileGraph.ignore(128, '\n');
+
476  }
+
477  ifileGraph.close();
+
478 
+
479  if (readNodeFeat)
+
480  {
+
481  std::string completePathToFileNodeFeat = workingDir + "/" + OFileName + "_NodeFeat"
+
482  ".csv";
+
483  ifileNodeFeat.open(completePathToFileNodeFeat);
+
484  if (!ifileNodeFeat.is_open())
+
485  {
+
486  // ERROR File Not Open
+
487  return -1;
+
488  }
+
489  for (;;)
+
490  { /* loop continually */
+
491  unsigned long nodeId;
+
492  T nodeFeat;
+
493  ifileNodeFeat >> nodeId >> comma >> nodeFeat;
+
494  nodeFeatMap[nodeId] = nodeFeat;
+
495  if (ifileNodeFeat.fail() || ifileNodeFeat.eof())
+
496  break;
+
497  ifileNodeFeat.ignore(128, '\n');
+
498  }
+
499  ifileNodeFeat.close();
+
500  }
+
501 
+
502  if (readEdgeWeight)
+
503  {
+
504  std::string completePathToFileEdgeWeight = workingDir + "/" + OFileName + "_EdgeWeight"
+
505  ".csv";
+
506  ifileEdgeWeight.open(completePathToFileEdgeWeight);
+
507  if (!ifileEdgeWeight.is_open())
+
508  {
+
509  // ERROR File Not Open
+
510  return -1;
+
511  }
+
512  for (;;)
+
513  { /* loop continually */
+
514  unsigned long edgeId;
+
515  double weight;
+
516  bool weighted;
+
517  ifileEdgeWeight >> edgeId >> comma >> weight >> comma >> weighted;
+
518  if (weighted)
+
519  {
+
520  edgeWeightMap[edgeId] = weight;
+
521  }
+
522  if (ifileEdgeWeight.fail() || ifileEdgeWeight.eof())
+
523  break;
+
524  ifileEdgeWeight.ignore(128, '\n');
+
525  }
+
526  ifileEdgeWeight.close();
+
527  }
+
528  recreateGraphFromReadFiles(edgeMap, edgeDirectedMap, nodeFeatMap, edgeWeightMap);
+
529  return 0;
+
530  }
+
531 
+
532  template <typename T>
+
533  int Graph<T>::writeToStandardFile_tsv(const std::string &workingDir, const std::string &OFileName, bool compress, bool writeNodeFeat, bool writeEdgeWeight) const
+
534  {
+
535  std::ofstream ofileGraph;
+
536  std::string completePathToFileGraph = workingDir + "/" + OFileName + ".tsv";
+
537  ofileGraph.open(completePathToFileGraph);
+
538  if (!ofileGraph.is_open())
+
539  {
+
540  // ERROR File Not Open
+
541  return -1;
+
542  }
+
543  auto printOutGraph = [&ofileGraph](const Edge<T> *e)
+
544  { ofileGraph << e->getId() << "\t" << e->getNodePair().first->getId() << "\t" << e->getNodePair().second->getId() << "\t" << ((e->isDirected().has_value() && e->isDirected().value()) ? 1 : 0) << std::endl; };
+
545  std::for_each(edgeSet.cbegin(), edgeSet.cend(), printOutGraph);
+
546  ofileGraph.close();
+
547 
+
548  if (writeNodeFeat)
+
549  {
+
550  std::ofstream ofileNodeFeat;
+
551  std::string completePathToFileNodeFeat = workingDir + "/" + OFileName + "_NodeFeat"
+
552  ".tsv";
+
553  ofileNodeFeat.open(completePathToFileNodeFeat);
+
554  if (!ofileNodeFeat.is_open())
+
555  {
+
556  // ERROR File Not Open
+
557  return -1;
+
558  }
+
559  auto printOutNodeFeat = [&ofileNodeFeat](const Node<T> *node)
+
560  { ofileNodeFeat << node->getId() << "\t" << node->getData() << std::endl; };
+
561  auto nodeSet = getNodeSet();
+
562  std::for_each(nodeSet.cbegin(), nodeSet.cend(), printOutNodeFeat);
+
563  ofileNodeFeat.close();
+
564  }
+
565 
+
566  if (writeEdgeWeight)
+
567  {
+
568  std::ofstream ofileEdgeWeight;
+
569  std::string completePathToFileEdgeWeight = workingDir + "/" + OFileName + "_EdgeWeight"
+
570  ".tsv";
+
571  ofileEdgeWeight.open(completePathToFileEdgeWeight);
+
572  if (!ofileEdgeWeight.is_open())
+
573  {
+
574  // ERROR File Not Open
+
575  return -1;
+
576  }
+
577  auto printOutEdgeWeight = [&ofileEdgeWeight](const Edge<T> *e)
+
578  { ofileEdgeWeight << e->getId() << "\t" << (e->isWeighted().has_value() && e->isWeighted().value() ? (dynamic_cast<const Weighted *>(e))->getWeight() : 0.0) << "\t" << (e->isWeighted().has_value() && e->isWeighted().value() ? 1 : 0) << std::endl; };
+
579 
+
580  std::for_each(edgeSet.cbegin(), edgeSet.cend(), printOutEdgeWeight);
+
581  ofileEdgeWeight.close();
+
582  }
+
583  return 0;
+
584  }
585 
-
586  public:
-
588  enum E_InputOutputFormat
-
589  {
-
590  STANDARD_CSV,
-
591  STANDARD_TSV,
-
592  OUT_1,
-
593  OUT_2
-
594  };
-
595 
-
596  typedef E_InputOutputFormat InputOutputFormat;
-
597 
-
599  enum E_PartitionAlgorithm
-
600  {
-
601  GREEDY_VC,
-
602  ALG_1,
-
603  ALG_2
-
604  };
-
605  typedef E_PartitionAlgorithm PartitionAlgorithm;
-
606 
-
607  Graph() = default;
-
608  Graph(const std::list<const Edge<T> *> &edgeSet);
-
609  ~Graph() = default;
-
618  virtual const std::list<const Edge<T> *> &getEdgeSet() const;
-
627  virtual void setEdgeSet(std::list<const Edge<T> *> &edgeSet);
-
636  virtual void addEdge(const Edge<T> *edge);
-
645  virtual void removeEdge(unsigned long edgeId);
-
654  virtual const std::list<const Node<T> *> getNodeSet() const;
-
664  virtual const std::optional<const Edge<T> *> getEdge(unsigned long edgeId) const;
-
670  virtual const AdjacencyMatrix<T> getAdjMatrix() const;
-
683  virtual const DijkstraResult dijkstra(const Node<T> &source, const Node<T> &target) const;
-
694  virtual const std::vector<Node<T>> breadth_first_search(const Node<T> &start) const;
-
705  virtual const std::vector<Node<T>> depth_first_search(const Node<T> &start) const;
-
706 
-
715  virtual bool isCyclicDirectedGraphDFS() const;
-
716 
-
725  virtual bool isCyclicDirectedGraphBFS() const;
-
726 
-
734  virtual bool isDirectedGraph() const;
-
735 
-
762  virtual const DialResult dial(const Node<T> &source, int maxWeight) const;
+
586  template <typename T>
+
587  int Graph<T>::readFromStandardFile_tsv(const std::string &workingDir, const std::string &OFileName, bool compress, bool readNodeFeat, bool readEdgeWeight)
+
588  {
+
589  std::ifstream ifileGraph;
+
590  std::ifstream ifileNodeFeat;
+
591  std::ifstream ifileEdgeWeight;
+
592  std::map<unsigned long, std::pair<unsigned long, unsigned long>> edgeMap;
+
593  std::map<unsigned long, bool> edgeDirectedMap;
+
594  std::map<unsigned long, T> nodeFeatMap;
+
595  std::map<unsigned long, double> edgeWeightMap;
+
596  std::string completePathToFileGraph = workingDir + "/" + OFileName + ".tsv";
+
597  ifileGraph.open(completePathToFileGraph);
+
598  if (!ifileGraph.is_open())
+
599  {
+
600  // ERROR File Not Open
+
601  return -1;
+
602  }
+
603  for (;;)
+
604  { /* loop continually */
+
605  unsigned long edgeId;
+
606  unsigned long nodeId1;
+
607  unsigned long nodeId2;
+
608  bool directed;
+
609  ifileGraph >> edgeId >> std::ws >> nodeId1 >> std::ws >> nodeId2 >> std::ws >> directed;
+
610  edgeMap[edgeId] = std::pair<unsigned long, unsigned long>(nodeId1, nodeId2);
+
611  edgeDirectedMap[edgeId] = directed;
+
612  if (ifileGraph.fail() || ifileGraph.eof())
+
613  break;
+
614  ifileGraph.ignore(128, '\n');
+
615  }
+
616  ifileGraph.close();
+
617 
+
618  if (readNodeFeat)
+
619  {
+
620  std::string completePathToFileNodeFeat = workingDir + "/" + OFileName + "_NodeFeat"
+
621  ".tsv";
+
622  ifileNodeFeat.open(completePathToFileNodeFeat);
+
623  if (!ifileNodeFeat.is_open())
+
624  {
+
625  // ERROR File Not Open
+
626  return -1;
+
627  }
+
628  for (;;)
+
629  { /* loop continually */
+
630  unsigned long nodeId;
+
631  T nodeFeat;
+
632  ifileNodeFeat >> nodeId >> std::ws >> nodeFeat;
+
633  nodeFeatMap[nodeId] = nodeFeat;
+
634  if (ifileNodeFeat.fail() || ifileNodeFeat.eof())
+
635  break;
+
636  ifileNodeFeat.ignore(128, '\n');
+
637  }
+
638  ifileNodeFeat.close();
+
639  }
+
640 
+
641  if (readEdgeWeight)
+
642  {
+
643  std::string completePathToFileEdgeWeight = workingDir + "/" + OFileName + "_EdgeWeight"
+
644  ".tsv";
+
645  ifileEdgeWeight.open(completePathToFileEdgeWeight);
+
646  if (!ifileEdgeWeight.is_open())
+
647  {
+
648  // ERROR File Not Open
+
649  return -1;
+
650  }
+
651  for (;;)
+
652  { /* loop continually */
+
653  unsigned long edgeId;
+
654  double weight;
+
655  bool weighted;
+
656  ifileEdgeWeight >> edgeId >> std::ws >> weight >> std::ws >> weighted;
+
657  if (weighted)
+
658  {
+
659  edgeWeightMap[edgeId] = weight;
+
660  }
+
661  if (ifileEdgeWeight.fail() || ifileEdgeWeight.eof())
+
662  break;
+
663  ifileEdgeWeight.ignore(128, '\n');
+
664  }
+
665  ifileEdgeWeight.close();
+
666  }
+
667  recreateGraphFromReadFiles(edgeMap, edgeDirectedMap, nodeFeatMap, edgeWeightMap);
+
668  return 0;
+
669  }
+
670 
+
671  template <typename T>
+
672  void Graph<T>::recreateGraphFromReadFiles(std::map<unsigned long, std::pair<unsigned long, unsigned long>> &edgeMap, std::map<unsigned long, bool> &edgeDirectedMap, std::map<unsigned long, T> &nodeFeatMap, std::map<unsigned long, double> &edgeWeightMap)
+
673  {
+
674  std::map<unsigned long, Node<T> *> nodeMap;
+
675  for (auto edgeIt = edgeMap.begin(); edgeIt != edgeMap.end(); ++edgeIt)
+
676  {
+
677  Node<T> *node1 = nullptr;
+
678  Node<T> *node2 = nullptr;
+
679  if (nodeMap.find(edgeIt->second.first) == nodeMap.end())
+
680  {
+
681  //Create new Node
+
682  T feat;
+
683  if (nodeFeatMap.find(edgeIt->second.first) != nodeFeatMap.end())
+
684  {
+
685  feat = nodeFeatMap.at(edgeIt->second.first);
+
686  }
+
687  node1 = new Node<T>(edgeIt->second.first, feat);
+
688  nodeMap[edgeIt->second.first] = node1;
+
689  }
+
690  else
+
691  {
+
692  node1 = nodeMap.at(edgeIt->second.first);
+
693  }
+
694  if (nodeMap.find(edgeIt->second.second) == nodeMap.end())
+
695  {
+
696  //Create new Node
+
697  T feat;
+
698  if (nodeFeatMap.find(edgeIt->second.second) != nodeFeatMap.end())
+
699  {
+
700  feat = nodeFeatMap.at(edgeIt->second.second);
+
701  }
+
702  node2 = new Node<T>(edgeIt->second.second, feat);
+
703  nodeMap[edgeIt->second.second] = node2;
+
704  }
+
705  else
+
706  {
+
707  node2 = nodeMap.at(edgeIt->second.second);
+
708  }
+
709 
+
710  if (edgeWeightMap.find(edgeIt->first) != edgeWeightMap.end())
+
711  {
+
712  if (edgeDirectedMap.find(edgeIt->first) != edgeDirectedMap.end() && edgeDirectedMap.at(edgeIt->first))
+
713  {
+
714  auto edge = new DirectedWeightedEdge<T>(edgeIt->first, *node1, *node2, edgeWeightMap.at(edgeIt->first));
+
715  addEdge(edge);
+
716  }
+
717  else
+
718  {
+
719  auto edge = new UndirectedWeightedEdge<T>(edgeIt->first, *node1, *node2, edgeWeightMap.at(edgeIt->first));
+
720  addEdge(edge);
+
721  }
+
722  }
+
723  else
+
724  {
+
725  if (edgeDirectedMap.find(edgeIt->first) != edgeDirectedMap.end() && edgeDirectedMap.at(edgeIt->first))
+
726  {
+
727  auto edge = new DirectedEdge<T>(edgeIt->first, *node1, *node2);
+
728  addEdge(edge);
+
729  }
+
730  else
+
731  {
+
732  auto edge = new UndirectedEdge<T>(edgeIt->first, *node1, *node2);
+
733  addEdge(edge);
+
734  }
+
735  }
+
736  }
+
737  }
+
738 
+
739  template <typename T>
+
740  int Graph<T>::compressFile(const std::string &inputFile, const std::string &outputFile) const
+
741  {
+
742 
+
743  std::ifstream ifs;
+
744  ifs.open(inputFile);
+
745  if (!ifs.is_open())
+
746  {
+
747  // ERROR File Not Open
+
748  return -1;
+
749  }
+
750  std::string content((std::istreambuf_iterator<char>(ifs)),
+
751  (std::istreambuf_iterator<char>()));
+
752 
+
753  const char *content_ptr = content.c_str();
+
754  gzFile outFileZ = gzopen(outputFile.c_str(), "wb");
+
755  if (outFileZ == NULL)
+
756  {
+
757  //printf("Error: Failed to gzopen %s\n", outputFile.c_str());
+
758  return -1;
+
759  }
+
760 
+
761  unsigned int zippedBytes;
+
762  zippedBytes = gzwrite(outFileZ, content_ptr, strlen(content_ptr));
763 
-
777  virtual int writeToFile(InputOutputFormat format = InputOutputFormat::STANDARD_CSV, const std::string &workingDir = ".", const std::string &OFileName = "graph", bool compress = false, bool writeNodeFeat = false, bool writeEdgeWeight = false) const;
-
778 
-
792  virtual int readFromFile(InputOutputFormat format = InputOutputFormat::STANDARD_CSV, const std::string &workingDir = ".", const std::string &OFileName = "graph", bool compress = false, bool readNodeFeat = false, bool readEdgeWeight = false);
-
793 
-
803  virtual PartitionMap<T> partitionGraph(PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const;
-
804 
-
805  friend std::ostream &operator<<<>(std::ostream &os, const Graph<T> &graph);
-
806  friend std::ostream &operator<<<>(std::ostream &os, const AdjacencyMatrix<T> &adj);
-
807  };
-
808 
-
809  template <typename T>
-
810  Graph<T>::Graph(const std::list<const Edge<T> *> &edgeSet)
-
811  {
-
812  for (auto edgeSetIt = edgeSet.begin(); edgeSetIt != edgeSet.end(); ++edgeSetIt)
-
813  {
-
814  if (std::find_if(this->edgeSet.begin(), this->edgeSet.end(), [edgeSetIt](const Edge<T> *edge)
-
815  { return (*edge == **edgeSetIt); }) == this->edgeSet.end())
-
816  {
-
817  this->edgeSet.push_back(*edgeSetIt);
-
818  }
-
819  }
-
820  }
-
821 
-
822  template <typename T>
-
823  const std::list<const Edge<T> *> &Graph<T>::getEdgeSet() const
-
824  {
-
825  return edgeSet;
-
826  }
-
827 
-
828  template <typename T>
-
829  void Graph<T>::setEdgeSet(std::list<const Edge<T> *> &edgeSet)
-
830  {
-
831  this->edgeSet.clear();
-
832  for (auto edgeSetIt = edgeSet.begin(); edgeSetIt != edgeSet.end(); ++edgeSetIt)
-
833  {
-
834  if (std::find_if(this->edgeSet.begin(), this->edgeSet.end(), [edgeSetIt](const Edge<T> *edge)
-
835  { return (*edge == **edgeSetIt); }) == this->edgeSet.end())
-
836  {
-
837  this->edgeSet.push_back(*edgeSetIt);
-
838  }
-
839  }
-
840  }
-
841 
-
842  template <typename T>
-
843  void Graph<T>::addEdge(const Edge<T> *edge)
-
844  {
-
845  if (std::find_if(edgeSet.begin(), edgeSet.end(), [edge](const Edge<T> *edge_a)
-
846  { return (*edge == *edge_a); }) == edgeSet.end())
-
847  {
-
848  edgeSet.push_back(edge);
-
849  }
-
850  }
-
851 
-
852  template <typename T>
-
853  void Graph<T>::removeEdge(unsigned long edgeId)
-
854  {
-
855  auto edgeOpt = Graph<T>::getEdge(edgeId);
-
856  if (edgeOpt.has_value())
-
857  {
-
858  edgeSet.erase(std::find_if(this->edgeSet.begin(), this->edgeSet.end(), [edgeOpt](const Edge<T> *edge)
-
859  { return (*(edgeOpt.value()) == *edge); }));
-
860  }
-
861  }
-
862 
-
863  template <typename T>
-
864  const std::list<const Node<T> *> Graph<T>::getNodeSet() const
-
865  {
-
866  std::list<const Node<T> *> nodeSet;
-
867  for (auto edge : edgeSet)
-
868  {
-
869  if (std::find_if(nodeSet.begin(), nodeSet.end(), [edge](const Node<T> *node)
-
870  { return (*edge->getNodePair().first == *node); }) == nodeSet.end())
-
871  {
-
872  nodeSet.push_back(edge->getNodePair().first);
-
873  }
-
874  if (std::find_if(nodeSet.begin(), nodeSet.end(), [edge](const Node<T> *node)
-
875  { return (*edge->getNodePair().second == *node); }) == nodeSet.end())
-
876  {
-
877  nodeSet.push_back(edge->getNodePair().second);
-
878  }
-
879  }
-
880  return nodeSet;
-
881  }
-
882 
-
883  template <typename T>
-
884  const std::optional<const Edge<T> *> Graph<T>::getEdge(unsigned long edgeId) const
-
885  {
-
886 
-
887  auto it = edgeSet.begin();
-
888  for (it; it != edgeSet.end(); ++it)
-
889  {
-
890  if ((*it)->getId() == edgeId)
-
891  {
-
892  return *it;
-
893  }
-
894  }
-
895 
-
896  return std::nullopt;
-
897  }
-
898 
-
899  template <typename T>
-
900  void Graph<T>::addElementToAdjMatrix(AdjacencyMatrix<T> &adjMatrix, const Node<T> *nodeFrom, const Node<T> *nodeTo, const Edge<T> *edge) const
-
901  {
-
902  std::pair<const Node<T> *, const Edge<T> *> elem = {nodeTo, edge};
-
903  adjMatrix[nodeFrom].push_back(elem);
-
904 
-
905  //adjMatrix[nodeFrom.getId()].push_back(std::make_pair<const Node<T>,const Edge<T>>(nodeTo, edge));
-
906  }
-
907 
-
908  template <typename T>
-
909  int Graph<T>::writeToStandardFile_csv(const std::string &workingDir, const std::string &OFileName, bool compress, bool writeNodeFeat, bool writeEdgeWeight) const
-
910  {
-
911  std::ofstream ofileGraph;
-
912  std::string completePathToFileGraph = workingDir + "/" + OFileName + ".csv";
-
913  ofileGraph.open(completePathToFileGraph);
-
914  if (!ofileGraph.is_open())
-
915  {
-
916  // ERROR File Not Open
-
917  return -1;
-
918  }
-
919  auto printOutGraph = [&ofileGraph](const Edge<T> *e)
-
920  { ofileGraph << e->getId() << "," << e->getNodePair().first->getId() << "," << e->getNodePair().second->getId() << "," << ((e->isDirected().has_value() && e->isDirected().value()) ? 1 : 0) << std::endl; };
-
921  std::for_each(edgeSet.cbegin(), edgeSet.cend(), printOutGraph);
-
922  ofileGraph.close();
-
923 
-
924  if (writeNodeFeat)
-
925  {
-
926  std::ofstream ofileNodeFeat;
-
927  std::string completePathToFileNodeFeat = workingDir + "/" + OFileName + "_NodeFeat"
-
928  ".csv";
-
929  ofileNodeFeat.open(completePathToFileNodeFeat);
-
930  if (!ofileNodeFeat.is_open())
-
931  {
-
932  // ERROR File Not Open
-
933  return -1;
-
934  }
-
935  auto printOutNodeFeat = [&ofileNodeFeat](const Node<T> *node)
-
936  { ofileNodeFeat << node->getId() << "," << node->getData() << std::endl; };
-
937  auto nodeSet = getNodeSet();
-
938  std::for_each(nodeSet.cbegin(), nodeSet.cend(), printOutNodeFeat);
-
939  ofileNodeFeat.close();
-
940  }
-
941 
-
942  if (writeEdgeWeight)
-
943  {
-
944  std::ofstream ofileEdgeWeight;
-
945  std::string completePathToFileEdgeWeight = workingDir + "/" + OFileName + "_EdgeWeight"
-
946  ".csv";
-
947  ofileEdgeWeight.open(completePathToFileEdgeWeight);
-
948  if (!ofileEdgeWeight.is_open())
-
949  {
-
950  // ERROR File Not Open
-
951  return -1;
-
952  }
-
953  auto printOutEdgeWeight = [&ofileEdgeWeight](const Edge<T> *e)
-
954  { ofileEdgeWeight << e->getId() << "," << (e->isWeighted().has_value() && e->isWeighted().value() ? (dynamic_cast<const Weighted *>(e))->getWeight() : 0.0) << "," << (e->isWeighted().has_value() && e->isWeighted().value() ? 1 : 0) << std::endl; };
-
955 
-
956  std::for_each(edgeSet.cbegin(), edgeSet.cend(), printOutEdgeWeight);
-
957  ofileEdgeWeight.close();
-
958  }
-
959  return 0;
-
960  }
-
961 
-
962  template <typename T>
-
963  int Graph<T>::readFromStandardFile_csv(const std::string &workingDir, const std::string &OFileName, bool compress, bool readNodeFeat, bool readEdgeWeight)
-
964  {
-
965  std::ifstream ifileGraph;
-
966  std::ifstream ifileNodeFeat;
-
967  std::ifstream ifileEdgeWeight;
-
968  std::map<unsigned long, std::pair<unsigned long, unsigned long>> edgeMap;
-
969  std::map<unsigned long, bool> edgeDirectedMap;
-
970  std::map<unsigned long, T> nodeFeatMap;
-
971  std::map<unsigned long, double> edgeWeightMap;
-
972  std::string completePathToFileGraph = workingDir + "/" + OFileName + ".csv";
-
973  ifileGraph.open(completePathToFileGraph);
-
974  if (!ifileGraph.is_open())
-
975  {
-
976  // ERROR File Not Open
-
977  return -1;
-
978  }
-
979  char comma;
-
980  for (;;)
-
981  { /* loop continually */
-
982  unsigned long edgeId;
-
983  unsigned long nodeId1;
-
984  unsigned long nodeId2;
-
985  bool directed;
-
986  ifileGraph >> edgeId >> comma >> nodeId1 >> comma >> nodeId2 >> comma >> directed;
-
987  edgeMap[edgeId] = std::pair<unsigned long, unsigned long>(nodeId1, nodeId2);
-
988  edgeDirectedMap[edgeId] = directed;
-
989  if (ifileGraph.fail() || ifileGraph.eof())
-
990  break;
-
991  ifileGraph.ignore(128, '\n');
-
992  }
-
993  ifileGraph.close();
-
994 
-
995  if (readNodeFeat)
-
996  {
-
997  std::string completePathToFileNodeFeat = workingDir + "/" + OFileName + "_NodeFeat"
-
998  ".csv";
-
999  ifileNodeFeat.open(completePathToFileNodeFeat);
-
1000  if (!ifileNodeFeat.is_open())
-
1001  {
-
1002  // ERROR File Not Open
-
1003  return -1;
-
1004  }
-
1005  for (;;)
-
1006  { /* loop continually */
-
1007  unsigned long nodeId;
-
1008  T nodeFeat;
-
1009  ifileNodeFeat >> nodeId >> comma >> nodeFeat;
-
1010  nodeFeatMap[nodeId] = nodeFeat;
-
1011  if (ifileNodeFeat.fail() || ifileNodeFeat.eof())
-
1012  break;
-
1013  ifileNodeFeat.ignore(128, '\n');
-
1014  }
-
1015  ifileNodeFeat.close();
-
1016  }
-
1017 
-
1018  if (readEdgeWeight)
-
1019  {
-
1020  std::string completePathToFileEdgeWeight = workingDir + "/" + OFileName + "_EdgeWeight"
-
1021  ".csv";
-
1022  ifileEdgeWeight.open(completePathToFileEdgeWeight);
-
1023  if (!ifileEdgeWeight.is_open())
-
1024  {
-
1025  // ERROR File Not Open
-
1026  return -1;
-
1027  }
-
1028  for (;;)
-
1029  { /* loop continually */
-
1030  unsigned long edgeId;
-
1031  double weight;
-
1032  bool weighted;
-
1033  ifileEdgeWeight >> edgeId >> comma >> weight >> comma >> weighted;
-
1034  if (weighted)
-
1035  {
-
1036  edgeWeightMap[edgeId] = weight;
-
1037  }
-
1038  if (ifileEdgeWeight.fail() || ifileEdgeWeight.eof())
-
1039  break;
-
1040  ifileEdgeWeight.ignore(128, '\n');
-
1041  }
-
1042  ifileEdgeWeight.close();
-
1043  }
-
1044  recreateGraphFromReadFiles(edgeMap, edgeDirectedMap, nodeFeatMap, edgeWeightMap);
-
1045  return 0;
-
1046  }
-
1047 
-
1048  template <typename T>
-
1049  int Graph<T>::writeToStandardFile_tsv(const std::string &workingDir, const std::string &OFileName, bool compress, bool writeNodeFeat, bool writeEdgeWeight) const
-
1050  {
-
1051  std::ofstream ofileGraph;
-
1052  std::string completePathToFileGraph = workingDir + "/" + OFileName + ".tsv";
-
1053  ofileGraph.open(completePathToFileGraph);
-
1054  if (!ofileGraph.is_open())
-
1055  {
-
1056  // ERROR File Not Open
-
1057  return -1;
-
1058  }
-
1059  auto printOutGraph = [&ofileGraph](const Edge<T> *e)
-
1060  { ofileGraph << e->getId() << "\t" << e->getNodePair().first->getId() << "\t" << e->getNodePair().second->getId() << "\t" << ((e->isDirected().has_value() && e->isDirected().value()) ? 1 : 0) << std::endl; };
-
1061  std::for_each(edgeSet.cbegin(), edgeSet.cend(), printOutGraph);
-
1062  ofileGraph.close();
-
1063 
-
1064  if (writeNodeFeat)
-
1065  {
-
1066  std::ofstream ofileNodeFeat;
-
1067  std::string completePathToFileNodeFeat = workingDir + "/" + OFileName + "_NodeFeat"
-
1068  ".tsv";
-
1069  ofileNodeFeat.open(completePathToFileNodeFeat);
-
1070  if (!ofileNodeFeat.is_open())
-
1071  {
-
1072  // ERROR File Not Open
-
1073  return -1;
-
1074  }
-
1075  auto printOutNodeFeat = [&ofileNodeFeat](const Node<T> *node)
-
1076  { ofileNodeFeat << node->getId() << "\t" << node->getData() << std::endl; };
-
1077  auto nodeSet = getNodeSet();
-
1078  std::for_each(nodeSet.cbegin(), nodeSet.cend(), printOutNodeFeat);
-
1079  ofileNodeFeat.close();
-
1080  }
-
1081 
-
1082  if (writeEdgeWeight)
-
1083  {
-
1084  std::ofstream ofileEdgeWeight;
-
1085  std::string completePathToFileEdgeWeight = workingDir + "/" + OFileName + "_EdgeWeight"
-
1086  ".tsv";
-
1087  ofileEdgeWeight.open(completePathToFileEdgeWeight);
-
1088  if (!ofileEdgeWeight.is_open())
-
1089  {
-
1090  // ERROR File Not Open
-
1091  return -1;
-
1092  }
-
1093  auto printOutEdgeWeight = [&ofileEdgeWeight](const Edge<T> *e)
-
1094  { ofileEdgeWeight << e->getId() << "\t" << (e->isWeighted().has_value() && e->isWeighted().value() ? (dynamic_cast<const Weighted *>(e))->getWeight() : 0.0) << "\t" << (e->isWeighted().has_value() && e->isWeighted().value() ? 1 : 0) << std::endl; };
-
1095 
-
1096  std::for_each(edgeSet.cbegin(), edgeSet.cend(), printOutEdgeWeight);
-
1097  ofileEdgeWeight.close();
-
1098  }
-
1099  return 0;
-
1100  }
-
1101 
-
1102  template <typename T>
-
1103  int Graph<T>::readFromStandardFile_tsv(const std::string &workingDir, const std::string &OFileName, bool compress, bool readNodeFeat, bool readEdgeWeight)
-
1104  {
-
1105  std::ifstream ifileGraph;
-
1106  std::ifstream ifileNodeFeat;
-
1107  std::ifstream ifileEdgeWeight;
-
1108  std::map<unsigned long, std::pair<unsigned long, unsigned long>> edgeMap;
-
1109  std::map<unsigned long, bool> edgeDirectedMap;
-
1110  std::map<unsigned long, T> nodeFeatMap;
-
1111  std::map<unsigned long, double> edgeWeightMap;
-
1112  std::string completePathToFileGraph = workingDir + "/" + OFileName + ".tsv";
-
1113  ifileGraph.open(completePathToFileGraph);
-
1114  if (!ifileGraph.is_open())
-
1115  {
-
1116  // ERROR File Not Open
-
1117  return -1;
-
1118  }
-
1119  for (;;)
-
1120  { /* loop continually */
-
1121  unsigned long edgeId;
-
1122  unsigned long nodeId1;
-
1123  unsigned long nodeId2;
-
1124  bool directed;
-
1125  ifileGraph >> edgeId >> std::ws >> nodeId1 >> std::ws >> nodeId2 >> std::ws >> directed;
-
1126  edgeMap[edgeId] = std::pair<unsigned long, unsigned long>(nodeId1, nodeId2);
-
1127  edgeDirectedMap[edgeId] = directed;
-
1128  if (ifileGraph.fail() || ifileGraph.eof())
-
1129  break;
-
1130  ifileGraph.ignore(128, '\n');
-
1131  }
-
1132  ifileGraph.close();
+
764  ifs.close();
+
765  gzclose(outFileZ);
+
766  return 0;
+
767  }
+
768 
+
769  template <typename T>
+
770  int Graph<T>::decompressFile(const std::string &inputFile, const std::string &outputFile) const
+
771  {
+
772 
+
773  gzFile inFileZ = gzopen(inputFile.c_str(), "rb");
+
774  if (inFileZ == NULL)
+
775  {
+
776  //printf("Error: Failed to gzopen %s\n", inputFile.c_str());
+
777  return -1;
+
778  }
+
779  unsigned char unzipBuffer[8192];
+
780  unsigned int unzippedBytes;
+
781  std::vector<unsigned char> unzippedData;
+
782  std::ofstream ofs;
+
783  ofs.open(outputFile);
+
784  if (!ofs.is_open())
+
785  {
+
786  // ERROR File Not Open
+
787  return -1;
+
788  }
+
789  while (true)
+
790  {
+
791  unzippedBytes = gzread(inFileZ, unzipBuffer, 8192);
+
792  if (unzippedBytes > 0)
+
793  {
+
794  unzippedData.insert(unzippedData.end(), unzipBuffer, unzipBuffer + unzippedBytes);
+
795  }
+
796  else
+
797  {
+
798  break;
+
799  }
+
800  }
+
801  for (auto c : unzippedData)
+
802  {
+
803  ofs << c;
+
804  }
+
805  ofs << std::endl;
+
806  ofs.close();
+
807  gzclose(inFileZ);
+
808  return 0;
+
809  }
+
810 
+
811  template <typename T>
+
812  void Graph<T>::greedyPartition(PartitionMap<T> &partitionMap) const
+
813  {
+
814  unsigned int index = 0;
+
815  unsigned int numberOfPartitions = partitionMap.size();
+
816  if (index == numberOfPartitions)
+
817  {
+
818  //ERROR partition map of zero element
+
819  return;
+
820  }
+
821  auto edgeSet = getEdgeSet();
+
822  for (auto edge : edgeSet)
+
823  {
+
824  partitionMap.at(index)->addEdge(edge);
+
825  index++;
+
826  index = index % numberOfPartitions;
+
827  }
+
828  }
+
829 
+
830  template <typename T>
+
831  void Graph<T>::HDRFPartition(PartitionMap<T> &partitionMap) const
+
832  {
+
833  }
+
834 
+
835  template <typename T>
+
836  const AdjacencyMatrix<T> Graph<T>::getAdjMatrix() const
+
837  {
+
838  AdjacencyMatrix<T> adj;
+
839  auto edgeSetIt = edgeSet.begin();
+
840  for (edgeSetIt; edgeSetIt != edgeSet.end(); ++edgeSetIt)
+
841  {
+
842  if ((*edgeSetIt)->isDirected().has_value() && (*edgeSetIt)->isDirected().value())
+
843  {
+
844  const DirectedEdge<T> *d_edge = dynamic_cast<const DirectedEdge<T> *>(*edgeSetIt);
+
845  addElementToAdjMatrix(adj, &(d_edge->getFrom()), &(d_edge->getTo()), d_edge);
+
846  }
+
847  else if ((*edgeSetIt)->isDirected().has_value() && !(*edgeSetIt)->isDirected().value())
+
848  {
+
849  const UndirectedEdge<T> *ud_edge = dynamic_cast<const UndirectedEdge<T> *>(*edgeSetIt);
+
850  ;
+
851  addElementToAdjMatrix(adj, &(ud_edge->getNode1()), &(ud_edge->getNode2()), ud_edge);
+
852  addElementToAdjMatrix(adj, &(ud_edge->getNode2()), &(ud_edge->getNode1()), ud_edge);
+
853  }
+
854  else
+
855  { //is a simple edge we cannot create adj matrix
+
856  return adj;
+
857  }
+
858  }
+
859  return adj;
+
860  }
+
861 
+
862  template <typename T>
+
863  const DijkstraResult Graph<T>::dijkstra(const Node<T> &source, const Node<T> &target) const
+
864  {
+
865  DijkstraResult result;
+
866  result.success = false;
+
867  result.errorMessage = "";
+
868  result.result = INF_DOUBLE;
+
869  auto nodeSet = getNodeSet();
+
870  if (std::find(nodeSet.begin(), nodeSet.end(), &source) == nodeSet.end())
+
871  {
+
872  // check if source node exist in the graph
+
873  result.errorMessage = ERR_SOURCE_NODE_NOT_IN_GRAPH;
+
874  return result;
+
875  }
+
876  if (std::find(nodeSet.begin(), nodeSet.end(), &target) == nodeSet.end())
+
877  {
+
878  // check if target node exist in the graph
+
879  result.errorMessage = ERR_TARGET_NODE_NOT_IN_GRAPH;
+
880  return result;
+
881  }
+
882  const AdjacencyMatrix<T> adj = getAdjMatrix();
+
883  // n denotes the number of vertices in graph
+
884  int n = adj.size();
+
885 
+
886  // setting all the distances initially to INF_DOUBLE
+
887  std::map<const Node<T> *, double> dist;
+
888 
+
889  for (auto elem : adj)
+
890  {
+
891  dist[elem.first] = INF_DOUBLE;
+
892  }
+
893 
+
894  // creating a min heap using priority queue
+
895  // first element of pair contains the distance
+
896  // second element of pair contains the vertex
+
897  std::priority_queue<std::pair<double, const Node<T> *>, std::vector<std::pair<double, const Node<T> *>>,
+
898  std::greater<std::pair<double, const Node<T> *>>>
+
899  pq;
+
900 
+
901  // pushing the source vertex 's' with 0 distance in min heap
+
902  pq.push(std::make_pair(0.0, &source));
+
903 
+
904  // marking the distance of source as 0
+
905  dist[&source] = 0;
+
906 
+
907  while (!pq.empty())
+
908  {
+
909  // second element of pair denotes the node / vertex
+
910  const Node<T> *currentNode = pq.top().second;
+
911 
+
912  // first element of pair denotes the distance
+
913  double currentDist = pq.top().first;
+
914 
+
915  pq.pop();
+
916 
+
917  // for all the reachable vertex from the currently exploring vertex
+
918  // we will try to minimize the distance
+
919  if (adj.find(currentNode) != adj.end())
+
920  {
+
921  for (std::pair<const Node<T> *, const Edge<T> *> elem : adj.at(currentNode))
+
922  {
+
923  // minimizing distances
+
924  if (elem.second->isWeighted().has_value() && elem.second->isWeighted().value())
+
925  {
+
926  if (elem.second->isDirected().has_value() && elem.second->isDirected().value())
+
927  {
+
928  const DirectedWeightedEdge<T> *dw_edge = dynamic_cast<const DirectedWeightedEdge<T> *>(elem.second);
+
929  if (currentDist + dw_edge->getWeight() < dist[elem.first])
+
930  {
+
931  dist[elem.first] = currentDist + dw_edge->getWeight();
+
932  pq.push(std::make_pair(dist[elem.first], elem.first));
+
933  }
+
934  }
+
935  else if (elem.second->isDirected().has_value() && !elem.second->isDirected().value())
+
936  {
+
937  const UndirectedWeightedEdge<T> *udw_edge = dynamic_cast<const UndirectedWeightedEdge<T> *>(elem.second);
+
938  if (currentDist + udw_edge->getWeight() < dist[elem.first])
+
939  {
+
940  dist[elem.first] = currentDist + udw_edge->getWeight();
+
941  pq.push(std::make_pair(dist[elem.first], elem.first));
+
942  }
+
943  }
+
944  else
+
945  {
+
946  //ERROR it shouldn't never returned ( does not exist a Node Weighted and not Directed/Undirected)
+
947  result.errorMessage = ERR_NO_DIR_OR_UNDIR_EDGE;
+
948  return result;
+
949  }
+
950  }
+
951  else
+
952  {
+
953  // No Weighted Edge
+
954  result.errorMessage = ERR_NO_WEIGHTED_EDGE;
+
955  return result;
+
956  }
+
957  }
+
958  }
+
959  }
+
960  if (dist[&target] != INF_DOUBLE)
+
961  {
+
962  result.success = true;
+
963  result.errorMessage = "";
+
964  result.result = dist[&target];
+
965  return result;
+
966  }
+
967  result.errorMessage = ERR_TARGET_NODE_NOT_REACHABLE;
+
968  result.result = -1;
+
969  return result;
+
970  }
+
971 
+
972  template <typename T>
+
973  const std::vector<Node<T>> Graph<T>::breadth_first_search(const Node<T> &start) const
+
974  {
+
975  // vector to keep track of visited nodes
+
976  std::vector<Node<T>> visited;
+
977  auto nodeSet = getNodeSet();
+
978  //check is exist node in the graph
+
979  if (std::find(nodeSet.begin(), nodeSet.end(), &start) == nodeSet.end())
+
980  {
+
981  return visited;
+
982  }
+
983  const AdjacencyMatrix<T> adj = getAdjMatrix();
+
984  // queue that stores vertices that need to be further explored
+
985  std::queue<const Node<T> *> tracker;
+
986 
+
987  // mark the starting node as visited
+
988  visited.push_back(start);
+
989  tracker.push(&start);
+
990  while (!tracker.empty())
+
991  {
+
992  const Node<T> *node = tracker.front();
+
993  tracker.pop();
+
994  if (adj.find(node) != adj.end())
+
995  {
+
996  for (auto elem : adj.at(node))
+
997  {
+
998  // if the node is not visited then mark it as visited
+
999  // and push it to the queue
+
1000  if (std::find(visited.begin(), visited.end(), *(elem.first)) == visited.end())
+
1001  {
+
1002  visited.push_back(*(elem.first));
+
1003  tracker.push(elem.first);
+
1004  }
+
1005  }
+
1006  }
+
1007  }
+
1008 
+
1009  return visited;
+
1010  }
+
1011 
+
1012  template <typename T>
+
1013  const std::vector<Node<T>> Graph<T>::depth_first_search(const Node<T> &start) const
+
1014  {
+
1015  // vector to keep track of visited nodes
+
1016  std::vector<Node<T>> visited;
+
1017  auto nodeSet = getNodeSet();
+
1018  //check is exist node in the graph
+
1019  if (std::find(nodeSet.begin(), nodeSet.end(), &start) == nodeSet.end())
+
1020  {
+
1021  return visited;
+
1022  }
+
1023  const AdjacencyMatrix<T> adj = getAdjMatrix();
+
1024  std::function<void(const AdjacencyMatrix<T> &, const Node<T> &, std::vector<Node<T>> &)> explore;
+
1025  explore = [&explore](const AdjacencyMatrix<T> &adj, const Node<T> &node, std::vector<Node<T>> &visited) -> void
+
1026  {
+
1027  visited.push_back(node);
+
1028  if (adj.find(&node) != adj.end())
+
1029  {
+
1030  for (auto x : adj.at(&node))
+
1031  {
+
1032  if (std::find(visited.begin(), visited.end(), *(x.first)) == visited.end())
+
1033  {
+
1034  explore(adj, *(x.first), visited);
+
1035  }
+
1036  }
+
1037  }
+
1038  };
+
1039  explore(adj, start, visited);
+
1040 
+
1041  return visited;
+
1042  }
+
1043 
+
1044  template <typename T>
+
1045  bool Graph<T>::isCyclicDirectedGraphDFS() const
+
1046  {
+
1047  if (!isDirectedGraph())
+
1048  {
+
1049  return false;
+
1050  }
+
1051  enum nodeStates : uint8_t
+
1052  {
+
1053  not_visited,
+
1054  in_stack,
+
1055  visited
+
1056  };
+
1057  auto nodeSet = this->getNodeSet();
+
1058  auto adjMatrix = this->getAdjMatrix();
+
1059 
+
1060  /* State of the node.
+
1061  *
+
1062  * It is a vector of "nodeStates" which represents the state node is in.
+
1063  * It can take only 3 values: "not_visited", "in_stack", and "visited".
+
1064  *
+
1065  * Initially, all nodes are in "not_visited" state.
+
1066  */
+
1067  std::map<unsigned long, nodeStates> state;
+
1068  for (auto node : nodeSet)
+
1069  {
+
1070  state[node->getId()] = not_visited;
+
1071  }
+
1072  int stateCounter = 0;
+
1073 
+
1074  // Start visiting each node.
+
1075  for (auto node : nodeSet)
+
1076  {
+
1077  // If a node is not visited, only then check for presence of cycle.
+
1078  // There is no need to check for presence of cycle for a visited
+
1079  // node as it has already been checked for presence of cycle.
+
1080  if (state[node->getId()] == not_visited)
+
1081  {
+
1082  // Check for cycle.
+
1083  std::function<bool(AdjacencyMatrix<T> &, std::map<unsigned long, nodeStates> &, const Node<T> *)> isCyclicDFSHelper;
+
1084  isCyclicDFSHelper = [this, &isCyclicDFSHelper](AdjacencyMatrix<T> &adjMatrix, std::map<unsigned long, nodeStates> &states, const Node<T> *node)
+
1085  {
+
1086  // Add node "in_stack" state.
+
1087  states[node->getId()] = in_stack;
+
1088 
+
1089  // If the node has children, then recursively visit all children of the
+
1090  // node.
+
1091  auto const it = adjMatrix.find(node);
+
1092  if (it != adjMatrix.end())
+
1093  {
+
1094  for (auto child : it->second)
+
1095  {
+
1096  // If state of child node is "not_visited", evaluate that child
+
1097  // for presence of cycle.
+
1098  auto state_of_child = states.at((std::get<0>(child))->getId());
+
1099  if (state_of_child == not_visited)
+
1100  {
+
1101  if (isCyclicDFSHelper(adjMatrix, states, std::get<0>(child)))
+
1102  {
+
1103  return true;
+
1104  }
+
1105  }
+
1106  else if (state_of_child == in_stack)
+
1107  {
+
1108  // If child node was "in_stack", then that means that there
+
1109  // is a cycle in the graph. Return true for presence of the
+
1110  // cycle.
+
1111  return true;
+
1112  }
+
1113  }
+
1114  }
+
1115 
+
1116  // Current node has been evaluated for the presence of cycle and had no
+
1117  // cycle. Mark current node as "visited".
+
1118  states[node->getId()] = visited;
+
1119  // Return that current node didn't result in any cycles.
+
1120  return false;
+
1121  };
+
1122  if (isCyclicDFSHelper(adjMatrix, state, node))
+
1123  {
+
1124  return true;
+
1125  }
+
1126  }
+
1127  }
+
1128 
+
1129  // All nodes have been safely traversed, that means there is no cycle in
+
1130  // the graph. Return false.
+
1131  return false;
+
1132  }
1133 
-
1134  if (readNodeFeat)
-
1135  {
-
1136  std::string completePathToFileNodeFeat = workingDir + "/" + OFileName + "_NodeFeat"
-
1137  ".tsv";
-
1138  ifileNodeFeat.open(completePathToFileNodeFeat);
-
1139  if (!ifileNodeFeat.is_open())
-
1140  {
-
1141  // ERROR File Not Open
-
1142  return -1;
-
1143  }
-
1144  for (;;)
-
1145  { /* loop continually */
-
1146  unsigned long nodeId;
-
1147  T nodeFeat;
-
1148  ifileNodeFeat >> nodeId >> std::ws >> nodeFeat;
-
1149  nodeFeatMap[nodeId] = nodeFeat;
-
1150  if (ifileNodeFeat.fail() || ifileNodeFeat.eof())
-
1151  break;
-
1152  ifileNodeFeat.ignore(128, '\n');
-
1153  }
-
1154  ifileNodeFeat.close();
-
1155  }
-
1156 
-
1157  if (readEdgeWeight)
-
1158  {
-
1159  std::string completePathToFileEdgeWeight = workingDir + "/" + OFileName + "_EdgeWeight"
-
1160  ".tsv";
-
1161  ifileEdgeWeight.open(completePathToFileEdgeWeight);
-
1162  if (!ifileEdgeWeight.is_open())
-
1163  {
-
1164  // ERROR File Not Open
-
1165  return -1;
-
1166  }
-
1167  for (;;)
-
1168  { /* loop continually */
-
1169  unsigned long edgeId;
-
1170  double weight;
-
1171  bool weighted;
-
1172  ifileEdgeWeight >> edgeId >> std::ws >> weight >> std::ws >> weighted;
-
1173  if (weighted)
-
1174  {
-
1175  edgeWeightMap[edgeId] = weight;
-
1176  }
-
1177  if (ifileEdgeWeight.fail() || ifileEdgeWeight.eof())
-
1178  break;
-
1179  ifileEdgeWeight.ignore(128, '\n');
-
1180  }
-
1181  ifileEdgeWeight.close();
-
1182  }
-
1183  recreateGraphFromReadFiles(edgeMap, edgeDirectedMap, nodeFeatMap, edgeWeightMap);
-
1184  return 0;
-
1185  }
-
1186 
-
1187  template <typename T>
-
1188  void Graph<T>::recreateGraphFromReadFiles(std::map<unsigned long, std::pair<unsigned long, unsigned long>> &edgeMap, std::map<unsigned long, bool> &edgeDirectedMap, std::map<unsigned long, T> &nodeFeatMap, std::map<unsigned long, double> &edgeWeightMap)
-
1189  {
-
1190  std::map<unsigned long, Node<T> *> nodeMap;
-
1191  for (auto edgeIt = edgeMap.begin(); edgeIt != edgeMap.end(); ++edgeIt)
-
1192  {
-
1193  Node<T> *node1 = nullptr;
-
1194  Node<T> *node2 = nullptr;
-
1195  if (nodeMap.find(edgeIt->second.first) == nodeMap.end())
-
1196  {
-
1197  //Create new Node
-
1198  T feat;
-
1199  if (nodeFeatMap.find(edgeIt->second.first) != nodeFeatMap.end())
-
1200  {
-
1201  feat = nodeFeatMap.at(edgeIt->second.first);
-
1202  }
-
1203  node1 = new Node<T>(edgeIt->second.first, feat);
-
1204  nodeMap[edgeIt->second.first] = node1;
-
1205  }
-
1206  else
-
1207  {
-
1208  node1 = nodeMap.at(edgeIt->second.first);
-
1209  }
-
1210  if (nodeMap.find(edgeIt->second.second) == nodeMap.end())
-
1211  {
-
1212  //Create new Node
-
1213  T feat;
-
1214  if (nodeFeatMap.find(edgeIt->second.second) != nodeFeatMap.end())
-
1215  {
-
1216  feat = nodeFeatMap.at(edgeIt->second.second);
-
1217  }
-
1218  node2 = new Node<T>(edgeIt->second.second, feat);
-
1219  nodeMap[edgeIt->second.second] = node2;
-
1220  }
-
1221  else
-
1222  {
-
1223  node2 = nodeMap.at(edgeIt->second.second);
-
1224  }
-
1225 
-
1226  if (edgeWeightMap.find(edgeIt->first) != edgeWeightMap.end())
-
1227  {
-
1228  if (edgeDirectedMap.find(edgeIt->first) != edgeDirectedMap.end() && edgeDirectedMap.at(edgeIt->first))
-
1229  {
-
1230  auto edge = new DirectedWeightedEdge<T>(edgeIt->first, *node1, *node2, edgeWeightMap.at(edgeIt->first));
-
1231  addEdge(edge);
-
1232  }
-
1233  else
-
1234  {
-
1235  auto edge = new UndirectedWeightedEdge<T>(edgeIt->first, *node1, *node2, edgeWeightMap.at(edgeIt->first));
-
1236  addEdge(edge);
-
1237  }
-
1238  }
-
1239  else
-
1240  {
-
1241  if (edgeDirectedMap.find(edgeIt->first) != edgeDirectedMap.end() && edgeDirectedMap.at(edgeIt->first))
-
1242  {
-
1243  auto edge = new DirectedEdge<T>(edgeIt->first, *node1, *node2);
-
1244  addEdge(edge);
-
1245  }
-
1246  else
-
1247  {
-
1248  auto edge = new UndirectedEdge<T>(edgeIt->first, *node1, *node2);
-
1249  addEdge(edge);
-
1250  }
-
1251  }
-
1252  }
-
1253  }
+
1134  template <typename T>
+
1135  bool Graph<T>::isCyclicDirectedGraphBFS() const
+
1136  {
+
1137  if (!isDirectedGraph())
+
1138  {
+
1139  return false;
+
1140  }
+
1141  auto adjMatrix = this->getAdjMatrix();
+
1142  auto nodeSet = this->getNodeSet();
+
1143 
+
1144  std::map<unsigned long, unsigned int> indegree;
+
1145  for (auto node : nodeSet)
+
1146  {
+
1147  indegree[node->getId()] = 0;
+
1148  }
+
1149  // Calculate the indegree i.e. the number of incident edges to the node.
+
1150  for (auto const &list : adjMatrix)
+
1151  {
+
1152  auto children = list.second;
+
1153  for (auto const &child : children)
+
1154  {
+
1155  indegree[std::get<0>(child)->getId()]++;
+
1156  }
+
1157  }
+
1158 
+
1159  std::queue<const Node<T> *> can_be_solved;
+
1160  for (auto node : nodeSet)
+
1161  {
+
1162  // If a node doesn't have any input edges, then that node will
+
1163  // definately not result in a cycle and can be visited safely.
+
1164  if (!indegree[node->getId()])
+
1165  {
+
1166  can_be_solved.emplace(&(*node));
+
1167  }
+
1168  }
+
1169 
+
1170  // Vertices that need to be traversed.
+
1171  auto remain = this->getNodeSet().size();
+
1172  // While there are safe nodes that we can visit.
+
1173  while (!can_be_solved.empty())
+
1174  {
+
1175  auto solved = can_be_solved.front();
+
1176  // Visit the node.
+
1177  can_be_solved.pop();
+
1178  // Decrease number of nodes that need to be traversed.
+
1179  remain--;
+
1180 
+
1181  // Visit all the children of the visited node.
+
1182  auto it = adjMatrix.find(solved);
+
1183  if (it != adjMatrix.end())
+
1184  {
+
1185  for (auto child : it->second)
+
1186  {
+
1187  // Check if we can visited the node safely.
+
1188  if (--indegree[std::get<0>(child)->getId()] == 0)
+
1189  {
+
1190  // if node can be visited safely, then add that node to
+
1191  // the visit queue.
+
1192  can_be_solved.emplace(std::get<0>(child));
+
1193  }
+
1194  }
+
1195  }
+
1196  }
+
1197 
+
1198  // If there are still nodes that we can't visit, then it means that
+
1199  // there is a cycle and return true, else return false.
+
1200  return !(remain == 0);
+
1201  }
+
1202 
+
1203  template <typename T>
+
1204  bool Graph<T>::isDirectedGraph() const
+
1205  {
+
1206  auto edgeSet = this->getEdgeSet();
+
1207  for (auto edge : edgeSet)
+
1208  {
+
1209  if (!(edge->isDirected().has_value() && edge->isDirected().value()))
+
1210  {
+
1211  //Found Undirected Edge
+
1212  return false;
+
1213  }
+
1214  }
+
1215  //No Undirected Edge
+
1216  return true;
+
1217  }
+
1218 
+
1219  template <typename T>
+
1220  const DialResult Graph<T>::dial(const Node<T> &source, int maxWeight) const
+
1221  {
+
1222  DialResult result;
+
1223  result.success = false;
+
1224 
+
1225  auto adj = getAdjMatrix();
+
1226  auto nodeSet = getNodeSet();
+
1227 
+
1228  if (std::find(nodeSet.begin(), nodeSet.end(), &source) == nodeSet.end())
+
1229  {
+
1230  // check if source node exist in the graph
+
1231  result.errorMessage = ERR_SOURCE_NODE_NOT_IN_GRAPH;
+
1232  return result;
+
1233  }
+
1234  /* With each distance, iterator to that vertex in
+
1235  its bucket is stored so that vertex can be deleted
+
1236  in O(1) at time of updation. So
+
1237  dist[i].first = distance of ith vertex from src vertex
+
1238  dits[i].second = vertex i in bucket number */
+
1239  unsigned int V = nodeSet.size();
+
1240  std::map<const Node<T> *, std::pair<long, const Node<T> *>> dist;
+
1241 
+
1242  // Initialize all distances as infinite (INF)
+
1243  for (auto node : nodeSet)
+
1244  {
+
1245  dist[&(*node)].first = std::numeric_limits<long>::max();
+
1246  }
+
1247 
+
1248  // Create buckets B[].
+
1249  // B[i] keep vertex of distance label i
+
1250  std::list<const Node<T> *> B[maxWeight * V + 1];
+
1251 
+
1252  B[0].push_back(&source);
+
1253  dist[&source].first = 0;
1254 
-
1255  template <typename T>
-
1256  int Graph<T>::compressFile(const std::string &inputFile, const std::string &outputFile) const
-
1257  {
-
1258 
-
1259  std::ifstream ifs;
-
1260  ifs.open(inputFile);
-
1261  if (!ifs.is_open())
-
1262  {
-
1263  // ERROR File Not Open
-
1264  return -1;
-
1265  }
-
1266  std::string content((std::istreambuf_iterator<char>(ifs)),
-
1267  (std::istreambuf_iterator<char>()));
-
1268 
-
1269  const char *content_ptr = content.c_str();
-
1270  gzFile outFileZ = gzopen(outputFile.c_str(), "wb");
-
1271  if (outFileZ == NULL)
-
1272  {
-
1273  //printf("Error: Failed to gzopen %s\n", outputFile.c_str());
-
1274  return -1;
-
1275  }
-
1276 
-
1277  unsigned int zippedBytes;
-
1278  zippedBytes = gzwrite(outFileZ, content_ptr, strlen(content_ptr));
-
1279 
-
1280  ifs.close();
-
1281  gzclose(outFileZ);
-
1282  return 0;
-
1283  }
-
1284 
-
1285  template <typename T>
-
1286  int Graph<T>::decompressFile(const std::string &inputFile, const std::string &outputFile) const
-
1287  {
-
1288 
-
1289  gzFile inFileZ = gzopen(inputFile.c_str(), "rb");
-
1290  if (inFileZ == NULL)
-
1291  {
-
1292  //printf("Error: Failed to gzopen %s\n", inputFile.c_str());
-
1293  return -1;
-
1294  }
-
1295  unsigned char unzipBuffer[8192];
-
1296  unsigned int unzippedBytes;
-
1297  std::vector<unsigned char> unzippedData;
-
1298  std::ofstream ofs;
-
1299  ofs.open(outputFile);
-
1300  if (!ofs.is_open())
-
1301  {
-
1302  // ERROR File Not Open
-
1303  return -1;
-
1304  }
-
1305  while (true)
-
1306  {
-
1307  unzippedBytes = gzread(inFileZ, unzipBuffer, 8192);
-
1308  if (unzippedBytes > 0)
-
1309  {
-
1310  unzippedData.insert(unzippedData.end(), unzipBuffer, unzipBuffer + unzippedBytes);
-
1311  }
-
1312  else
-
1313  {
-
1314  break;
-
1315  }
-
1316  }
-
1317  for (auto c : unzippedData)
-
1318  {
-
1319  ofs << c;
-
1320  }
-
1321  ofs << std::endl;
-
1322  ofs.close();
-
1323  gzclose(inFileZ);
-
1324  return 0;
-
1325  }
-
1326 
-
1327  template <typename T>
-
1328  void Graph<T>::greedyPartition(PartitionMap<T> &partitionMap) const
-
1329  {
-
1330  unsigned int index = 0;
-
1331  unsigned int numberOfPartitions = partitionMap.size();
-
1332  if (index == numberOfPartitions)
-
1333  {
-
1334  //ERROR partition map of zero element
-
1335  return;
-
1336  }
-
1337  auto edgeSet = getEdgeSet();
-
1338  for (auto edge : edgeSet)
+
1255  int idx = 0;
+
1256  while (1)
+
1257  {
+
1258  // Go sequentially through buckets till one non-empty
+
1259  // bucket is found
+
1260  while (B[idx].size() == 0 && idx < maxWeight * V)
+
1261  {
+
1262  idx++;
+
1263  }
+
1264 
+
1265  // If all buckets are empty, we are done.
+
1266  if (idx == maxWeight * V)
+
1267  {
+
1268  break;
+
1269  }
+
1270 
+
1271  // Take top vertex from bucket and pop it
+
1272  auto u = B[idx].front();
+
1273  B[idx].pop_front();
+
1274 
+
1275  // Process all adjacents of extracted vertex 'u' and
+
1276  // update their distanced if required.
+
1277  for (auto i = adj[u].begin(); i != adj[u].end(); ++i)
+
1278  {
+
1279  auto v = (*i).first;
+
1280  int weight = 0;
+
1281  if ((*i).second->isWeighted().has_value() && (*i).second->isWeighted().value())
+
1282  {
+
1283  if ((*i).second->isDirected().has_value() && (*i).second->isDirected().value())
+
1284  {
+
1285  const DirectedWeightedEdge<T> *dw_edge = dynamic_cast<const DirectedWeightedEdge<T> *>((*i).second);
+
1286  weight = dw_edge->getWeight();
+
1287  }
+
1288  else if ((*i).second->isDirected().has_value() && !(*i).second->isDirected().value())
+
1289  {
+
1290  const UndirectedWeightedEdge<T> *udw_edge = dynamic_cast<const UndirectedWeightedEdge<T> *>((*i).second);
+
1291  weight = udw_edge->getWeight();
+
1292  }
+
1293  else
+
1294  {
+
1295  //ERROR it shouldn't never returned ( does not exist a Node Weighted and not Directed/Undirected)
+
1296  result.errorMessage = ERR_NO_DIR_OR_UNDIR_EDGE;
+
1297  return result;
+
1298  }
+
1299  }
+
1300  else
+
1301  {
+
1302  // No Weighted Edge
+
1303  result.errorMessage = ERR_NO_WEIGHTED_EDGE;
+
1304  return result;
+
1305  }
+
1306  auto u_i = std::find_if(dist.begin(), dist.end(), [u](std::pair<const Node<T> *, std::pair<long, const Node<T> *>> const &it)
+
1307  { return (*u == *(it.first)); });
+
1308 
+
1309  auto v_i = std::find_if(dist.begin(), dist.end(), [v](std::pair<const Node<T> *, std::pair<long, const Node<T> *>> const &it)
+
1310  { return (*v == *(it.first)); });
+
1311  long du = u_i->second.first;
+
1312  long dv = v_i->second.first;
+
1313 
+
1314  // If there is shorted path to v through u.
+
1315  if (dv > du + weight)
+
1316  {
+
1317  // If dv is not INF then it must be in B[dv]
+
1318  // bucket, so erase its entry using iterator
+
1319  // in O(1)
+
1320  if (dv != std::numeric_limits<long>::max())
+
1321  {
+
1322  auto findIter = std::find(B[dv].begin(), B[dv].end(), dist[v].second);
+
1323  B[dv].erase(findIter);
+
1324  }
+
1325 
+
1326  // updating the distance
+
1327  dist[v].first = du + weight;
+
1328  dv = dist[v].first;
+
1329 
+
1330  // pushing vertex v into updated distance's bucket
+
1331  B[dv].push_front(v);
+
1332 
+
1333  // storing updated iterator in dist[v].second
+
1334  dist[v].second = *(B[dv].begin());
+
1335  }
+
1336  }
+
1337  }
+
1338  for (auto dist_i : dist)
1339  {
-
1340  partitionMap.at(index)->addEdge(edge);
-
1341  index++;
-
1342  index = index % numberOfPartitions;
-
1343  }
-
1344  }
-
1345 
-
1346  template <typename T>
-
1347  const AdjacencyMatrix<T> Graph<T>::getAdjMatrix() const
-
1348  {
-
1349  AdjacencyMatrix<T> adj;
-
1350  auto edgeSetIt = edgeSet.begin();
-
1351  for (edgeSetIt; edgeSetIt != edgeSet.end(); ++edgeSetIt)
+
1340  result.minDistanceMap[dist_i.first->getId()] = dist_i.second.first;
+
1341  }
+
1342  result.success = true;
+
1343 
+
1344  return result;
+
1345  }
+
1346 
+
1347  template <typename T>
+
1348  int Graph<T>::writeToFile(InputOutputFormat format, const std::string &workingDir, const std::string &OFileName, bool compress, bool writeNodeFeat, bool writeEdgeWeight) const
+
1349  {
+
1350  int result = 0;
+
1351  if (format == InputOutputFormat::STANDARD_CSV)
1352  {
-
1353  if ((*edgeSetIt)->isDirected().has_value() && (*edgeSetIt)->isDirected().value())
-
1354  {
-
1355  const DirectedEdge<T> *d_edge = dynamic_cast<const DirectedEdge<T> *>(*edgeSetIt);
-
1356  addElementToAdjMatrix(adj, &(d_edge->getFrom()), &(d_edge->getTo()), d_edge);
-
1357  }
-
1358  else if ((*edgeSetIt)->isDirected().has_value() && !(*edgeSetIt)->isDirected().value())
-
1359  {
-
1360  const UndirectedEdge<T> *ud_edge = dynamic_cast<const UndirectedEdge<T> *>(*edgeSetIt);
-
1361  ;
-
1362  addElementToAdjMatrix(adj, &(ud_edge->getNode1()), &(ud_edge->getNode2()), ud_edge);
-
1363  addElementToAdjMatrix(adj, &(ud_edge->getNode2()), &(ud_edge->getNode1()), ud_edge);
-
1364  }
-
1365  else
-
1366  { //is a simple edge we cannot create adj matrix
-
1367  return adj;
-
1368  }
-
1369  }
-
1370  return adj;
-
1371  }
-
1372 
-
1373  template <typename T>
-
1374  const DijkstraResult Graph<T>::dijkstra(const Node<T> &source, const Node<T> &target) const
-
1375  {
-
1376  DijkstraResult result;
-
1377  result.success = false;
-
1378  result.errorMessage = "";
-
1379  result.result = INF_DOUBLE;
-
1380  auto nodeSet = getNodeSet();
-
1381  if (std::find(nodeSet.begin(), nodeSet.end(), &source) == nodeSet.end())
-
1382  {
-
1383  // check if source node exist in the graph
-
1384  result.errorMessage = ERR_SOURCE_NODE_NOT_IN_GRAPH;
-
1385  return result;
-
1386  }
-
1387  if (std::find(nodeSet.begin(), nodeSet.end(), &target) == nodeSet.end())
-
1388  {
-
1389  // check if target node exist in the graph
-
1390  result.errorMessage = ERR_TARGET_NODE_NOT_IN_GRAPH;
-
1391  return result;
-
1392  }
-
1393  const AdjacencyMatrix<T> adj = getAdjMatrix();
-
1394  // n denotes the number of vertices in graph
-
1395  int n = adj.size();
-
1396 
-
1397  // setting all the distances initially to INF_DOUBLE
-
1398  std::map<const Node<T> *, double> dist;
-
1399 
-
1400  for (auto elem : adj)
-
1401  {
-
1402  dist[elem.first] = INF_DOUBLE;
-
1403  }
-
1404 
-
1405  // creating a min heap using priority queue
-
1406  // first element of pair contains the distance
-
1407  // second element of pair contains the vertex
-
1408  std::priority_queue<std::pair<double, const Node<T> *>, std::vector<std::pair<double, const Node<T> *>>,
-
1409  std::greater<std::pair<double, const Node<T> *>>>
-
1410  pq;
-
1411 
-
1412  // pushing the source vertex 's' with 0 distance in min heap
-
1413  pq.push(std::make_pair(0.0, &source));
-
1414 
-
1415  // marking the distance of source as 0
-
1416  dist[&source] = 0;
-
1417 
-
1418  while (!pq.empty())
-
1419  {
-
1420  // second element of pair denotes the node / vertex
-
1421  const Node<T> *currentNode = pq.top().second;
-
1422 
-
1423  // first element of pair denotes the distance
-
1424  double currentDist = pq.top().first;
-
1425 
-
1426  pq.pop();
-
1427 
-
1428  // for all the reachable vertex from the currently exploring vertex
-
1429  // we will try to minimize the distance
-
1430  if (adj.find(currentNode) != adj.end())
-
1431  {
-
1432  for (std::pair<const Node<T> *, const Edge<T> *> elem : adj.at(currentNode))
-
1433  {
-
1434  // minimizing distances
-
1435  if (elem.second->isWeighted().has_value() && elem.second->isWeighted().value())
-
1436  {
-
1437  if (elem.second->isDirected().has_value() && elem.second->isDirected().value())
-
1438  {
-
1439  const DirectedWeightedEdge<T> *dw_edge = dynamic_cast<const DirectedWeightedEdge<T> *>(elem.second);
-
1440  if (currentDist + dw_edge->getWeight() < dist[elem.first])
-
1441  {
-
1442  dist[elem.first] = currentDist + dw_edge->getWeight();
-
1443  pq.push(std::make_pair(dist[elem.first], elem.first));
-
1444  }
-
1445  }
-
1446  else if (elem.second->isDirected().has_value() && !elem.second->isDirected().value())
-
1447  {
-
1448  const UndirectedWeightedEdge<T> *udw_edge = dynamic_cast<const UndirectedWeightedEdge<T> *>(elem.second);
-
1449  if (currentDist + udw_edge->getWeight() < dist[elem.first])
-
1450  {
-
1451  dist[elem.first] = currentDist + udw_edge->getWeight();
-
1452  pq.push(std::make_pair(dist[elem.first], elem.first));
-
1453  }
-
1454  }
-
1455  else
-
1456  {
-
1457  //ERROR it shouldn't never returned ( does not exist a Node Weighted and not Directed/Undirected)
-
1458  result.errorMessage = ERR_NO_DIR_OR_UNDIR_EDGE;
-
1459  return result;
-
1460  }
-
1461  }
-
1462  else
-
1463  {
-
1464  // No Weighted Edge
-
1465  result.errorMessage = ERR_NO_WEIGHTED_EDGE;
-
1466  return result;
-
1467  }
-
1468  }
-
1469  }
-
1470  }
-
1471  if (dist[&target] != INF_DOUBLE)
-
1472  {
-
1473  result.success = true;
-
1474  result.errorMessage = "";
-
1475  result.result = dist[&target];
-
1476  return result;
-
1477  }
-
1478  result.errorMessage = ERR_TARGET_NODE_NOT_REACHABLE;
-
1479  result.result = -1;
-
1480  return result;
-
1481  }
-
1482 
-
1483  template <typename T>
-
1484  const std::vector<Node<T>> Graph<T>::breadth_first_search(const Node<T> &start) const
-
1485  {
-
1486  // vector to keep track of visited nodes
-
1487  std::vector<Node<T>> visited;
-
1488  auto nodeSet = getNodeSet();
-
1489  //check is exist node in the graph
-
1490  if (std::find(nodeSet.begin(), nodeSet.end(), &start) == nodeSet.end())
-
1491  {
-
1492  return visited;
-
1493  }
-
1494  const AdjacencyMatrix<T> adj = getAdjMatrix();
-
1495  // queue that stores vertices that need to be further explored
-
1496  std::queue<const Node<T> *> tracker;
-
1497 
-
1498  // mark the starting node as visited
-
1499  visited.push_back(start);
-
1500  tracker.push(&start);
-
1501  while (!tracker.empty())
-
1502  {
-
1503  const Node<T> *node = tracker.front();
-
1504  tracker.pop();
-
1505  if (adj.find(node) != adj.end())
-
1506  {
-
1507  for (auto elem : adj.at(node))
-
1508  {
-
1509  // if the node is not visited then mark it as visited
-
1510  // and push it to the queue
-
1511  if (std::find(visited.begin(), visited.end(), *(elem.first)) == visited.end())
-
1512  {
-
1513  visited.push_back(*(elem.first));
-
1514  tracker.push(elem.first);
-
1515  }
-
1516  }
-
1517  }
-
1518  }
-
1519 
-
1520  return visited;
-
1521  }
-
1522 
-
1523  template <typename T>
-
1524  const std::vector<Node<T>> Graph<T>::depth_first_search(const Node<T> &start) const
-
1525  {
-
1526  // vector to keep track of visited nodes
-
1527  std::vector<Node<T>> visited;
-
1528  auto nodeSet = getNodeSet();
-
1529  //check is exist node in the graph
-
1530  if (std::find(nodeSet.begin(), nodeSet.end(), &start) == nodeSet.end())
-
1531  {
-
1532  return visited;
-
1533  }
-
1534  const AdjacencyMatrix<T> adj = getAdjMatrix();
-
1535  std::function<void(const AdjacencyMatrix<T> &, const Node<T> &, std::vector<Node<T>> &)> explore;
-
1536  explore = [&explore](const AdjacencyMatrix<T> &adj, const Node<T> &node, std::vector<Node<T>> &visited) -> void
-
1537  {
-
1538  visited.push_back(node);
-
1539  if (adj.find(&node) != adj.end())
-
1540  {
-
1541  for (auto x : adj.at(&node))
-
1542  {
-
1543  if (std::find(visited.begin(), visited.end(), *(x.first)) == visited.end())
-
1544  {
-
1545  explore(adj, *(x.first), visited);
-
1546  }
-
1547  }
-
1548  }
-
1549  };
-
1550  explore(adj, start, visited);
-
1551 
-
1552  return visited;
+
1353  result = writeToStandardFile_csv(workingDir, OFileName, compress, writeNodeFeat, writeEdgeWeight);
+
1354  }
+
1355  else if (format == InputOutputFormat::STANDARD_TSV)
+
1356  {
+
1357  result = writeToStandardFile_tsv(workingDir, OFileName, compress, writeNodeFeat, writeEdgeWeight);
+
1358  }
+
1359  else
+
1360  {
+
1361  //OUTPUT FORMAT NOT RECOGNIZED
+
1362  return -1;
+
1363  }
+
1364  if (result == 0 && compress)
+
1365  {
+
1366  auto compress = [this, &workingDir, &OFileName, &writeNodeFeat, &writeEdgeWeight](const std::string &extension)
+
1367  {
+
1368  std::string completePathToFileGraph = workingDir + "/" + OFileName + extension;
+
1369  std::string completePathToFileGraphCompressed = workingDir + "/" + OFileName + extension + ".gz";
+
1370  int _result = compressFile(completePathToFileGraph, completePathToFileGraphCompressed);
+
1371  if (_result == 0)
+
1372  {
+
1373  _result = remove(completePathToFileGraph.c_str());
+
1374  }
+
1375  if (_result == 0)
+
1376  {
+
1377  if (writeNodeFeat)
+
1378  {
+
1379  std::string completePathToFileNodeFeat = workingDir + "/" + OFileName + "_NodeFeat" + extension;
+
1380  std::string completePathToFileNodeFeatCompressed = workingDir + "/" + OFileName + "_NodeFeat" + extension + ".gz";
+
1381  _result = compressFile(completePathToFileNodeFeat, completePathToFileNodeFeatCompressed);
+
1382  if (_result == 0)
+
1383  {
+
1384  _result = remove(completePathToFileNodeFeat.c_str());
+
1385  }
+
1386  }
+
1387  }
+
1388  if (_result == 0)
+
1389  {
+
1390  if (writeEdgeWeight)
+
1391  {
+
1392  std::string completePathToFileEdgeWeight = workingDir + "/" + OFileName + "_EdgeWeight" + extension;
+
1393  std::string completePathToFileEdgeWeightCompressed = workingDir + "/" + OFileName + "_EdgeWeight" + extension + ".gz";
+
1394  _result = compressFile(completePathToFileEdgeWeight, completePathToFileEdgeWeightCompressed);
+
1395  if (_result == 0)
+
1396  {
+
1397  _result = remove(completePathToFileEdgeWeight.c_str());
+
1398  }
+
1399  }
+
1400  }
+
1401  return _result;
+
1402  };
+
1403  if (format == InputOutputFormat::STANDARD_CSV)
+
1404  {
+
1405  auto result = compress(".csv");
+
1406  }
+
1407  else if (format == InputOutputFormat::STANDARD_TSV)
+
1408  {
+
1409  auto result = compress(".tsv");
+
1410  }
+
1411  else
+
1412  {
+
1413  //OUTPUT FORMAT NOT RECOGNIZED
+
1414  result = -1;
+
1415  }
+
1416  }
+
1417  return result;
+
1418  }
+
1419 
+
1420  template <typename T>
+
1421  int Graph<T>::readFromFile(InputOutputFormat format, const std::string &workingDir, const std::string &OFileName, bool compress, bool readNodeFeat, bool readEdgeWeight)
+
1422  {
+
1423  int result = 0;
+
1424  if (compress)
+
1425  {
+
1426  auto decompress = [this, &workingDir, &OFileName, &readNodeFeat, &readEdgeWeight](const std::string &extension)
+
1427  {
+
1428  std::string completePathToFileGraph = workingDir + "/" + OFileName + extension;
+
1429  std::string completePathToFileGraphCompressed = workingDir + "/" + OFileName + extension + ".gz";
+
1430  int _result = decompressFile(completePathToFileGraphCompressed, completePathToFileGraph);
+
1431  if (_result == 0)
+
1432  {
+
1433  if (readNodeFeat)
+
1434  {
+
1435  std::string completePathToFileNodeFeat = workingDir + "/" + OFileName + "_NodeFeat" + extension;
+
1436  std::string completePathToFileNodeFeatCompressed = workingDir + "/" + OFileName + "_NodeFeat" + extension + ".gz";
+
1437  _result = decompressFile(completePathToFileNodeFeatCompressed, completePathToFileNodeFeat);
+
1438  }
+
1439  }
+
1440  if (_result == 0)
+
1441  {
+
1442  if (readEdgeWeight)
+
1443  {
+
1444  std::string completePathToFileEdgeWeight = workingDir + "/" + OFileName + "_EdgeWeight" + extension;
+
1445  std::string completePathToFileEdgeWeightCompressed = workingDir + "/" + OFileName + "_EdgeWeight" + extension + ".gz";
+
1446  _result = decompressFile(completePathToFileEdgeWeightCompressed, completePathToFileEdgeWeight);
+
1447  }
+
1448  }
+
1449  return _result;
+
1450  };
+
1451  if (format == InputOutputFormat::STANDARD_CSV)
+
1452  {
+
1453  result = decompress(".csv");
+
1454  }
+
1455  else if (format == InputOutputFormat::STANDARD_TSV)
+
1456  {
+
1457  result = decompress(".tsv");
+
1458  }
+
1459  else
+
1460  {
+
1461  //OUTPUT FORMAT NOT RECOGNIZED
+
1462  result = -1;
+
1463  }
+
1464  }
+
1465  if (result == 0)
+
1466  {
+
1467  if (format == InputOutputFormat::STANDARD_CSV)
+
1468  {
+
1469  result = readFromStandardFile_csv(workingDir, OFileName, compress, readNodeFeat, readEdgeWeight);
+
1470  }
+
1471  else if (format == InputOutputFormat::STANDARD_TSV)
+
1472  {
+
1473  result = readFromStandardFile_tsv(workingDir, OFileName, compress, readNodeFeat, readEdgeWeight);
+
1474  }
+
1475  else
+
1476  {
+
1477  //OUTPUT FORMAT NOT RECOGNIZED
+
1478  result = -1;
+
1479  }
+
1480  }
+
1481  return result;
+
1482  }
+
1483 
+
1484  template <typename T>
+
1485  PartitionMap<T> Graph<T>::partitionGraph(PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const
+
1486  {
+
1487  PartitionMap<T> partitionMap;
+
1488  for (unsigned int i = 0; i < numberOfPartitions; ++i)
+
1489  {
+
1490  partitionMap[i] = new PARTITIONING::Partition<T>(i);
+
1491  }
+
1492  if (algorithm == PARTITIONING::PartitionAlgorithm::GREEDY_VC_ALG)
+
1493  {
+
1494  greedyPartition(partitionMap);
+
1495  }
+
1496  else if (algorithm == PARTITIONING::PartitionAlgorithm::HDRF_ALG)
+
1497  {
+
1498  HDRFPartition(partitionMap);
+
1499  }
+
1500  else
+
1501  {
+
1502  //Error not recognized algorithm
+
1503  partitionMap.clear();
+
1504  }
+
1505  return partitionMap;
+
1506  }
+
1507 
+
1508 
+
1509  template <typename T>
+
1510  std::ostream &operator<<(std::ostream &os, const AdjacencyMatrix<T> &adj)
+
1511  {
+
1512  os << "Adjacency Matrix:\n";
+
1513  auto it = adj.begin();
+
1514  unsigned long max_column = 0;
+
1515  for (it; it != adj.end(); ++it)
+
1516  {
+
1517  if (it->second.size() > max_column)
+
1518  {
+
1519  max_column = it->second.size();
+
1520  }
+
1521  }
+
1522  if (max_column == 0)
+
1523  {
+
1524  os << "ERROR in Print\n";
+
1525  return os;
+
1526  }
+
1527  else
+
1528  {
+
1529  it = adj.begin();
+
1530  os << "|--|";
+
1531  for (int i = 0; i < max_column; i++)
+
1532  {
+
1533  os << "-----|";
+
1534  }
+
1535  os << "\n";
+
1536  for (it; it != adj.end(); ++it)
+
1537  {
+
1538  os << "|N" << it->first->getId() << "|";
+
1539  auto it2 = it->second.begin();
+
1540  for (it2; it2 != it->second.end(); ++it2)
+
1541  {
+
1542  os << "N" << it2->first->getId() << ",E" << it2->second->getId() << "|";
+
1543  }
+
1544  os << "\n|--|";
+
1545  for (int i = 0; i < max_column; i++)
+
1546  {
+
1547  os << "-----|";
+
1548  }
+
1549  os << "\n";
+
1550  }
+
1551  }
+
1552  return os;
1553  }
1554 
-
1555  template <typename T>
-
1556  bool Graph<T>::isCyclicDirectedGraphDFS() const
-
1557  {
-
1558  if (!isDirectedGraph())
-
1559  {
-
1560  return false;
-
1561  }
-
1562  enum nodeStates : uint8_t
-
1563  {
-
1564  not_visited,
-
1565  in_stack,
-
1566  visited
-
1567  };
-
1568  auto nodeSet = this->getNodeSet();
-
1569  auto adjMatrix = this->getAdjMatrix();
-
1570 
-
1571  /* State of the node.
-
1572  *
-
1573  * It is a vector of "nodeStates" which represents the state node is in.
-
1574  * It can take only 3 values: "not_visited", "in_stack", and "visited".
-
1575  *
-
1576  * Initially, all nodes are in "not_visited" state.
-
1577  */
-
1578  std::map<unsigned long, nodeStates> state;
-
1579  for (auto node : nodeSet)
-
1580  {
-
1581  state[node->getId()] = not_visited;
-
1582  }
-
1583  int stateCounter = 0;
-
1584 
-
1585  // Start visiting each node.
-
1586  for (auto node : nodeSet)
-
1587  {
-
1588  // If a node is not visited, only then check for presence of cycle.
-
1589  // There is no need to check for presence of cycle for a visited
-
1590  // node as it has already been checked for presence of cycle.
-
1591  if (state[node->getId()] == not_visited)
-
1592  {
-
1593  // Check for cycle.
-
1594  std::function<bool(AdjacencyMatrix<T> &, std::map<unsigned long, nodeStates> &, const Node<T> *)> isCyclicDFSHelper;
-
1595  isCyclicDFSHelper = [this, &isCyclicDFSHelper](AdjacencyMatrix<T> &adjMatrix, std::map<unsigned long, nodeStates> &states, const Node<T> *node)
-
1596  {
-
1597  // Add node "in_stack" state.
-
1598  states[node->getId()] = in_stack;
-
1599 
-
1600  // If the node has children, then recursively visit all children of the
-
1601  // node.
-
1602  auto const it = adjMatrix.find(node);
-
1603  if (it != adjMatrix.end())
-
1604  {
-
1605  for (auto child : it->second)
-
1606  {
-
1607  // If state of child node is "not_visited", evaluate that child
-
1608  // for presence of cycle.
-
1609  auto state_of_child = states.at((std::get<0>(child))->getId());
-
1610  if (state_of_child == not_visited)
-
1611  {
-
1612  if (isCyclicDFSHelper(adjMatrix, states, std::get<0>(child)))
-
1613  {
-
1614  return true;
-
1615  }
-
1616  }
-
1617  else if (state_of_child == in_stack)
-
1618  {
-
1619  // If child node was "in_stack", then that means that there
-
1620  // is a cycle in the graph. Return true for presence of the
-
1621  // cycle.
-
1622  return true;
-
1623  }
-
1624  }
-
1625  }
-
1626 
-
1627  // Current node has been evaluated for the presence of cycle and had no
-
1628  // cycle. Mark current node as "visited".
-
1629  states[node->getId()] = visited;
-
1630  // Return that current node didn't result in any cycles.
-
1631  return false;
-
1632  };
-
1633  if (isCyclicDFSHelper(adjMatrix, state, node))
-
1634  {
-
1635  return true;
-
1636  }
-
1637  }
-
1638  }
-
1639 
-
1640  // All nodes have been safely traversed, that means there is no cycle in
-
1641  // the graph. Return false.
-
1642  return false;
-
1643  }
-
1644 
-
1645  template <typename T>
-
1646  bool Graph<T>::isCyclicDirectedGraphBFS() const
-
1647  {
-
1648  if (!isDirectedGraph())
-
1649  {
-
1650  return false;
-
1651  }
-
1652  auto adjMatrix = this->getAdjMatrix();
-
1653  auto nodeSet = this->getNodeSet();
-
1654 
-
1655  std::map<unsigned long, unsigned int> indegree;
-
1656  for (auto node : nodeSet)
-
1657  {
-
1658  indegree[node->getId()] = 0;
-
1659  }
-
1660  // Calculate the indegree i.e. the number of incident edges to the node.
-
1661  for (auto const &list : adjMatrix)
-
1662  {
-
1663  auto children = list.second;
-
1664  for (auto const &child : children)
-
1665  {
-
1666  indegree[std::get<0>(child)->getId()]++;
-
1667  }
-
1668  }
-
1669 
-
1670  std::queue<const Node<T> *> can_be_solved;
-
1671  for (auto node : nodeSet)
-
1672  {
-
1673  // If a node doesn't have any input edges, then that node will
-
1674  // definately not result in a cycle and can be visited safely.
-
1675  if (!indegree[node->getId()])
-
1676  {
-
1677  can_be_solved.emplace(&(*node));
-
1678  }
-
1679  }
-
1680 
-
1681  // Vertices that need to be traversed.
-
1682  auto remain = this->getNodeSet().size();
-
1683  // While there are safe nodes that we can visit.
-
1684  while (!can_be_solved.empty())
-
1685  {
-
1686  auto solved = can_be_solved.front();
-
1687  // Visit the node.
-
1688  can_be_solved.pop();
-
1689  // Decrease number of nodes that need to be traversed.
-
1690  remain--;
-
1691 
-
1692  // Visit all the children of the visited node.
-
1693  auto it = adjMatrix.find(solved);
-
1694  if (it != adjMatrix.end())
-
1695  {
-
1696  for (auto child : it->second)
-
1697  {
-
1698  // Check if we can visited the node safely.
-
1699  if (--indegree[std::get<0>(child)->getId()] == 0)
-
1700  {
-
1701  // if node can be visited safely, then add that node to
-
1702  // the visit queue.
-
1703  can_be_solved.emplace(std::get<0>(child));
-
1704  }
-
1705  }
-
1706  }
-
1707  }
-
1708 
-
1709  // If there are still nodes that we can't visit, then it means that
-
1710  // there is a cycle and return true, else return false.
-
1711  return !(remain == 0);
-
1712  }
-
1713 
-
1714  template <typename T>
-
1715  bool Graph<T>::isDirectedGraph() const
-
1716  {
-
1717  auto edgeSet = this->getEdgeSet();
-
1718  for (auto edge : edgeSet)
-
1719  {
-
1720  if (!(edge->isDirected().has_value() && edge->isDirected().value()))
-
1721  {
-
1722  //Found Undirected Edge
-
1723  return false;
-
1724  }
-
1725  }
-
1726  //No Undirected Edge
-
1727  return true;
-
1728  }
-
1729 
-
1730  template <typename T>
-
1731  const DialResult Graph<T>::dial(const Node<T> &source, int maxWeight) const
-
1732  {
-
1733  DialResult result;
-
1734  result.success = false;
-
1735 
-
1736  auto adj = getAdjMatrix();
-
1737  auto nodeSet = getNodeSet();
-
1738 
-
1739  if (std::find(nodeSet.begin(), nodeSet.end(), &source) == nodeSet.end())
-
1740  {
-
1741  // check if source node exist in the graph
-
1742  result.errorMessage = ERR_SOURCE_NODE_NOT_IN_GRAPH;
-
1743  return result;
-
1744  }
-
1745  /* With each distance, iterator to that vertex in
-
1746  its bucket is stored so that vertex can be deleted
-
1747  in O(1) at time of updation. So
-
1748  dist[i].first = distance of ith vertex from src vertex
-
1749  dits[i].second = vertex i in bucket number */
-
1750  unsigned int V = nodeSet.size();
-
1751  std::map<const Node<T> *, std::pair<long, const Node<T> *>> dist;
-
1752 
-
1753  // Initialize all distances as infinite (INF)
-
1754  for (auto node : nodeSet)
-
1755  {
-
1756  dist[&(*node)].first = std::numeric_limits<long>::max();
-
1757  }
-
1758 
-
1759  // Create buckets B[].
-
1760  // B[i] keep vertex of distance label i
-
1761  std::list<const Node<T> *> B[maxWeight * V + 1];
-
1762 
-
1763  B[0].push_back(&source);
-
1764  dist[&source].first = 0;
-
1765 
-
1766  int idx = 0;
-
1767  while (1)
-
1768  {
-
1769  // Go sequentially through buckets till one non-empty
-
1770  // bucket is found
-
1771  while (B[idx].size() == 0 && idx < maxWeight * V)
-
1772  {
-
1773  idx++;
-
1774  }
-
1775 
-
1776  // If all buckets are empty, we are done.
-
1777  if (idx == maxWeight * V)
-
1778  {
-
1779  break;
-
1780  }
-
1781 
-
1782  // Take top vertex from bucket and pop it
-
1783  auto u = B[idx].front();
-
1784  B[idx].pop_front();
-
1785 
-
1786  // Process all adjacents of extracted vertex 'u' and
-
1787  // update their distanced if required.
-
1788  for (auto i = adj[u].begin(); i != adj[u].end(); ++i)
-
1789  {
-
1790  auto v = (*i).first;
-
1791  int weight = 0;
-
1792  if ((*i).second->isWeighted().has_value() && (*i).second->isWeighted().value())
-
1793  {
-
1794  if ((*i).second->isDirected().has_value() && (*i).second->isDirected().value())
-
1795  {
-
1796  const DirectedWeightedEdge<T> *dw_edge = dynamic_cast<const DirectedWeightedEdge<T> *>((*i).second);
-
1797  weight = dw_edge->getWeight();
-
1798  }
-
1799  else if ((*i).second->isDirected().has_value() && !(*i).second->isDirected().value())
-
1800  {
-
1801  const UndirectedWeightedEdge<T> *udw_edge = dynamic_cast<const UndirectedWeightedEdge<T> *>((*i).second);
-
1802  weight = udw_edge->getWeight();
-
1803  }
-
1804  else
-
1805  {
-
1806  //ERROR it shouldn't never returned ( does not exist a Node Weighted and not Directed/Undirected)
-
1807  result.errorMessage = ERR_NO_DIR_OR_UNDIR_EDGE;
-
1808  return result;
-
1809  }
-
1810  }
-
1811  else
-
1812  {
-
1813  // No Weighted Edge
-
1814  result.errorMessage = ERR_NO_WEIGHTED_EDGE;
-
1815  return result;
-
1816  }
-
1817  auto u_i = std::find_if(dist.begin(), dist.end(), [u](std::pair<const Node<T> *, std::pair<long, const Node<T> *>> const &it)
-
1818  { return (*u == *(it.first)); });
-
1819 
-
1820  auto v_i = std::find_if(dist.begin(), dist.end(), [v](std::pair<const Node<T> *, std::pair<long, const Node<T> *>> const &it)
-
1821  { return (*v == *(it.first)); });
-
1822  long du = u_i->second.first;
-
1823  long dv = v_i->second.first;
-
1824 
-
1825  // If there is shorted path to v through u.
-
1826  if (dv > du + weight)
-
1827  {
-
1828  // If dv is not INF then it must be in B[dv]
-
1829  // bucket, so erase its entry using iterator
-
1830  // in O(1)
-
1831  if (dv != std::numeric_limits<long>::max())
-
1832  {
-
1833  auto findIter = std::find(B[dv].begin(), B[dv].end(), dist[v].second);
-
1834  B[dv].erase(findIter);
-
1835  }
-
1836 
-
1837  // updating the distance
-
1838  dist[v].first = du + weight;
-
1839  dv = dist[v].first;
-
1840 
-
1841  // pushing vertex v into updated distance's bucket
-
1842  B[dv].push_front(v);
-
1843 
-
1844  // storing updated iterator in dist[v].second
-
1845  dist[v].second = *(B[dv].begin());
-
1846  }
-
1847  }
-
1848  }
-
1849  for (auto dist_i : dist)
-
1850  {
-
1851  result.minDistanceMap[dist_i.first->getId()] = dist_i.second.first;
-
1852  }
-
1853  result.success = true;
-
1854 
-
1855  return result;
-
1856  }
-
1857 
-
1858  template <typename T>
-
1859  int Graph<T>::writeToFile(InputOutputFormat format, const std::string &workingDir, const std::string &OFileName, bool compress, bool writeNodeFeat, bool writeEdgeWeight) const
-
1860  {
-
1861  int result = 0;
-
1862  if (format == InputOutputFormat::STANDARD_CSV)
-
1863  {
-
1864  result = writeToStandardFile_csv(workingDir, OFileName, compress, writeNodeFeat, writeEdgeWeight);
-
1865  }
-
1866  else if (format == InputOutputFormat::STANDARD_TSV)
-
1867  {
-
1868  result = writeToStandardFile_tsv(workingDir, OFileName, compress, writeNodeFeat, writeEdgeWeight);
-
1869  }
-
1870  else
-
1871  {
-
1872  //OUTPUT FORMAT NOT RECOGNIZED
-
1873  return -1;
-
1874  }
-
1875  if (result == 0 && compress)
-
1876  {
-
1877  auto compress = [this, &workingDir, &OFileName, &writeNodeFeat, &writeEdgeWeight](const std::string &extension)
-
1878  {
-
1879  std::string completePathToFileGraph = workingDir + "/" + OFileName + extension;
-
1880  std::string completePathToFileGraphCompressed = workingDir + "/" + OFileName + extension + ".gz";
-
1881  int _result = compressFile(completePathToFileGraph, completePathToFileGraphCompressed);
-
1882  if (_result == 0)
-
1883  {
-
1884  _result = remove(completePathToFileGraph.c_str());
-
1885  }
-
1886  if (_result == 0)
-
1887  {
-
1888  if (writeNodeFeat)
-
1889  {
-
1890  std::string completePathToFileNodeFeat = workingDir + "/" + OFileName + "_NodeFeat" + extension;
-
1891  std::string completePathToFileNodeFeatCompressed = workingDir + "/" + OFileName + "_NodeFeat" + extension + ".gz";
-
1892  _result = compressFile(completePathToFileNodeFeat, completePathToFileNodeFeatCompressed);
-
1893  if (_result == 0)
-
1894  {
-
1895  _result = remove(completePathToFileNodeFeat.c_str());
-
1896  }
-
1897  }
-
1898  }
-
1899  if (_result == 0)
-
1900  {
-
1901  if (writeEdgeWeight)
-
1902  {
-
1903  std::string completePathToFileEdgeWeight = workingDir + "/" + OFileName + "_EdgeWeight" + extension;
-
1904  std::string completePathToFileEdgeWeightCompressed = workingDir + "/" + OFileName + "_EdgeWeight" + extension + ".gz";
-
1905  _result = compressFile(completePathToFileEdgeWeight, completePathToFileEdgeWeightCompressed);
-
1906  if (_result == 0)
-
1907  {
-
1908  _result = remove(completePathToFileEdgeWeight.c_str());
-
1909  }
-
1910  }
-
1911  }
-
1912  return _result;
-
1913  };
-
1914  if (format == InputOutputFormat::STANDARD_CSV)
-
1915  {
-
1916  auto result = compress(".csv");
-
1917  }
-
1918  else if (format == InputOutputFormat::STANDARD_TSV)
-
1919  {
-
1920  auto result = compress(".tsv");
-
1921  }
-
1922  else
-
1923  {
-
1924  //OUTPUT FORMAT NOT RECOGNIZED
-
1925  result = -1;
-
1926  }
-
1927  }
-
1928  return result;
-
1929  }
-
1930 
-
1931  template <typename T>
-
1932  int Graph<T>::readFromFile(InputOutputFormat format, const std::string &workingDir, const std::string &OFileName, bool compress, bool readNodeFeat, bool readEdgeWeight)
-
1933  {
-
1934  int result = 0;
-
1935  if (compress)
-
1936  {
-
1937  auto decompress = [this, &workingDir, &OFileName, &readNodeFeat, &readEdgeWeight](const std::string &extension)
-
1938  {
-
1939  std::string completePathToFileGraph = workingDir + "/" + OFileName + extension;
-
1940  std::string completePathToFileGraphCompressed = workingDir + "/" + OFileName + extension + ".gz";
-
1941  int _result = decompressFile(completePathToFileGraphCompressed, completePathToFileGraph);
-
1942  if (_result == 0)
-
1943  {
-
1944  if (readNodeFeat)
-
1945  {
-
1946  std::string completePathToFileNodeFeat = workingDir + "/" + OFileName + "_NodeFeat" + extension;
-
1947  std::string completePathToFileNodeFeatCompressed = workingDir + "/" + OFileName + "_NodeFeat" + extension + ".gz";
-
1948  _result = decompressFile(completePathToFileNodeFeatCompressed, completePathToFileNodeFeat);
-
1949  }
-
1950  }
-
1951  if (_result == 0)
-
1952  {
-
1953  if (readEdgeWeight)
-
1954  {
-
1955  std::string completePathToFileEdgeWeight = workingDir + "/" + OFileName + "_EdgeWeight" + extension;
-
1956  std::string completePathToFileEdgeWeightCompressed = workingDir + "/" + OFileName + "_EdgeWeight" + extension + ".gz";
-
1957  _result = decompressFile(completePathToFileEdgeWeightCompressed, completePathToFileEdgeWeight);
-
1958  }
-
1959  }
-
1960  return _result;
-
1961  };
-
1962  if (format == InputOutputFormat::STANDARD_CSV)
-
1963  {
-
1964  result = decompress(".csv");
-
1965  }
-
1966  else if (format == InputOutputFormat::STANDARD_TSV)
-
1967  {
-
1968  result = decompress(".tsv");
-
1969  }
-
1970  else
-
1971  {
-
1972  //OUTPUT FORMAT NOT RECOGNIZED
-
1973  result = -1;
-
1974  }
-
1975  }
-
1976  if (result == 0)
-
1977  {
-
1978  if (format == InputOutputFormat::STANDARD_CSV)
-
1979  {
-
1980  result = readFromStandardFile_csv(workingDir, OFileName, compress, readNodeFeat, readEdgeWeight);
-
1981  }
-
1982  else if (format == InputOutputFormat::STANDARD_TSV)
-
1983  {
-
1984  result = readFromStandardFile_tsv(workingDir, OFileName, compress, readNodeFeat, readEdgeWeight);
-
1985  }
-
1986  else
-
1987  {
-
1988  //OUTPUT FORMAT NOT RECOGNIZED
-
1989  result = -1;
-
1990  }
-
1991  }
-
1992  return result;
-
1993  }
-
1994 
-
1995  template <typename T>
-
1996  PartitionMap<T> Graph<T>::partitionGraph(PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const
-
1997  {
-
1998  PartitionMap<T> partitionMap;
-
1999  for (unsigned int i = 0; i < numberOfPartitions; ++i)
-
2000  {
-
2001  partitionMap[i] = new Partition<T>(i);
-
2002  }
-
2003  if (algorithm == PartitionAlgorithm::GREEDY_VC)
-
2004  {
-
2005  greedyPartition(partitionMap);
-
2006  }
-
2007  else
-
2008  {
-
2009  //Error not recognized algorithm
-
2010  partitionMap.clear();
-
2011  }
-
2012  return partitionMap;
-
2013  }
-
2014 
-
2016  template <typename T>
-
2017  class Graph_TS : public Graph<T>, public ThreadSafe
-
2018  {
-
2019  public:
-
2020  Graph_TS() = default;
-
2021  Graph_TS(const std::list<const Edge<T> *> &edgeSet);
-
2022  Graph_TS(const Graph<T> &graph);
-
2023  ~Graph_TS() = default;
-
2032  const std::list<const Edge<T> *> &getEdgeSet() const override;
-
2041  void setEdgeSet(std::list<const Edge<T> *> &edgeSet) override;
-
2050  void addEdge(const Edge<T> *edge) override;
-
2059  void removeEdge(unsigned long edgeId) override;
-
2068  const std::list<const Node<T> *> getNodeSet() const override;
-
2078  const std::optional<const Edge<T> *> getEdge(unsigned long edgeId) const override;
-
2084  const AdjacencyMatrix<T> getAdjMatrix() const override;
-
2097  const DijkstraResult dijkstra(const Node<T> &source, const Node<T> &target) const override;
-
2108  const std::vector<Node<T>> breadth_first_search(const Node<T> &start) const override;
-
2119  const std::vector<Node<T>> depth_first_search(const Node<T> &start) const override;
-
2120 
-
2129  bool isCyclicDirectedGraphDFS() const override;
-
2130 
-
2139  bool isCyclicDirectedGraphBFS() const override;
-
2140 
-
2148  bool isDirectedGraph() const override;
-
2149 
-
2176  const DialResult dial(const Node<T> &source, int maxWeight) const override;
-
2177 
-
2191  int writeToFile(typename Graph<T>::InputOutputFormat format = Graph<T>::InputOutputFormat::STANDARD_CSV, const std::string &workingDir = ".", const std::string &OFileName = "graph", bool compress = false, bool writeNodeFeat = false, bool writeEdgeWeight = false) const override;
-
2192 
-
2206  int readFromFile(typename Graph<T>::InputOutputFormat format = Graph<T>::InputOutputFormat::STANDARD_CSV, const std::string &workingDir = ".", const std::string &OFileName = "graph", bool compress = false, bool readNodeFeat = false, bool readEdgeWeight = false) override;
-
2207 
-
2217  PartitionMap<T> partitionGraph(typename Graph<T>::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const override;
-
2218  };
-
2219 
-
2220  template <typename T>
-
2221  Graph_TS<T>::Graph_TS(const std::list<const Edge<T> *> &edgeSet) : Graph<T>(edgeSet), ThreadSafe() {}
-
2222 
-
2223  template <typename T>
-
2224  Graph_TS<T>::Graph_TS(const Graph<T> &graph) : Graph<T>(graph), ThreadSafe() {}
-
2225 
-
2226  template <typename T>
-
2227  const std::list<const Edge<T> *> &Graph_TS<T>::getEdgeSet() const
-
2228  {
-
2229  std::lock_guard<std::mutex> lock(mutex);
-
2230  return Graph<T>::getEdgeSet();
-
2231  }
-
2232 
-
2233  template <typename T>
-
2234  void Graph_TS<T>::setEdgeSet(std::list<const Edge<T> *> &edgeSet)
-
2235  {
-
2236  getLock();
-
2237  Graph<T>::setEdgeSet(edgeSet);
-
2238  releaseLock();
-
2239  }
-
2240 
-
2241  template <typename T>
-
2242  void Graph_TS<T>::addEdge(const Edge<T> *edge)
-
2243  {
-
2244  getLock();
-
2245  Graph<T>::addEdge(edge);
-
2246  releaseLock();
-
2247  }
-
2248 
-
2249  template <typename T>
-
2250  void Graph_TS<T>::removeEdge(unsigned long edgeId)
-
2251  {
-
2252  getLock();
-
2253  Graph<T>::removeEdge(edgeId);
-
2254  releaseLock();
-
2255  }
-
2256 
-
2257  template <typename T>
-
2258  const std::list<const Node<T> *> Graph_TS<T>::getNodeSet() const
-
2259  {
-
2260  getLock();
-
2261  auto ns = Graph<T>::getNodeSet();
-
2262  releaseLock();
-
2263  return ns;
-
2264  }
-
2265 
-
2266  template <typename T>
-
2267  const std::optional<const Edge<T> *> Graph_TS<T>::getEdge(unsigned long edgeId) const
-
2268  {
-
2269  getLock();
-
2270  auto e = Graph<T>::getEdge(edgeId);
-
2271  releaseLock();
-
2272  return e;
-
2273  }
-
2274 
-
2275  template <typename T>
-
2276  const AdjacencyMatrix<T> Graph_TS<T>::getAdjMatrix() const
-
2277  {
-
2278  getLock();
-
2279  auto adjm = Graph<T>::getAdjMatrix();
-
2280  releaseLock();
-
2281  return adjm;
-
2282  }
-
2283 
-
2284  template <typename T>
-
2285  const DijkstraResult Graph_TS<T>::dijkstra(const Node<T> &source, const Node<T> &target) const
-
2286  {
-
2287  getLock();
-
2288  auto dij = Graph<T>::dijkstra(source, target);
-
2289  releaseLock();
-
2290  return dij;
-
2291  }
-
2292 
-
2293  template <typename T>
-
2294  const std::vector<Node<T>> Graph_TS<T>::breadth_first_search(const Node<T> &start) const
-
2295  {
-
2296  getLock();
-
2297  auto bfs = Graph<T>::breadth_first_search(start);
-
2298  releaseLock();
-
2299  return bfs;
-
2300  }
-
2301 
-
2302  template <typename T>
-
2303  const std::vector<Node<T>> Graph_TS<T>::depth_first_search(const Node<T> &start) const
-
2304  {
-
2305  getLock();
-
2306  auto dfs = Graph<T>::depth_first_search(start);
-
2307  releaseLock();
-
2308  return dfs;
-
2309  }
-
2310 
-
2311  template <typename T>
-
2312  bool Graph_TS<T>::isCyclicDirectedGraphDFS() const
-
2313  {
-
2314  getLock();
-
2315  auto result = Graph<T>::isCyclicDirectedGraphDFS();
-
2316  releaseLock();
-
2317  return result;
-
2318  }
-
2319 
-
2320  template <typename T>
-
2321  bool Graph_TS<T>::isCyclicDirectedGraphBFS() const
-
2322  {
-
2323  getLock();
-
2324  auto result = Graph<T>::isCyclicDirectedGraphBFS();
-
2325  releaseLock();
-
2326  return result;
-
2327  }
-
2328 
-
2329  template <typename T>
-
2330  bool Graph_TS<T>::isDirectedGraph() const
-
2331  {
-
2332  getLock();
-
2333  auto result = Graph<T>::isDirectedGraph();
-
2334  releaseLock();
-
2335  return result;
-
2336  }
-
2337 
-
2338  template <typename T>
-
2339  const DialResult Graph_TS<T>::dial(const Node<T> &source, int maxWeight) const
-
2340  {
-
2341  getLock();
-
2342  auto dial = Graph<T>::dial(source, maxWeight);
-
2343  releaseLock();
-
2344  return dial;
-
2345  }
-
2346 
-
2347  template <typename T>
-
2348  int Graph_TS<T>::writeToFile(typename Graph<T>::InputOutputFormat format, const std::string &workingDir, const std::string &OFileName, bool compress, bool writeNodeFeat, bool writeEdgeWeight) const
-
2349  {
-
2350  getLock();
-
2351  auto result = Graph<T>::writeToFile(format, workingDir, OFileName, compress, writeNodeFeat, writeEdgeWeight);
-
2352  releaseLock();
-
2353  return result;
-
2354  }
-
2355 
-
2356  template <typename T>
-
2357  int Graph_TS<T>::readFromFile(typename Graph<T>::InputOutputFormat format, const std::string &workingDir, const std::string &OFileName, bool compress, bool readNodeFeat, bool readEdgeWeight)
-
2358  {
-
2359  getLock();
-
2360  auto result = Graph<T>::readFromFile(format, workingDir, OFileName, compress, readNodeFeat, readEdgeWeight);
-
2361  releaseLock();
-
2362  return result;
-
2363  }
-
2364 
-
2365  template <typename T>
-
2366  PartitionMap<T> Graph_TS<T>::partitionGraph(typename Graph<T>::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const
-
2367  {
-
2368  getLock();
-
2369  auto partitions = Graph<T>::partitionGraph(algorithm, numberOfPartitions);
-
2370  releaseLock();
-
2371  return partitions;
-
2372  }
-
2373 
-
2374  template <typename T>
-
2375  class Partition : public Graph<T>
-
2376  {
-
2377  public:
-
2378  Partition();
-
2379  Partition(unsigned int partitionId);
-
2380  Partition(const std::list<const Edge<T> *> &edgeSet);
-
2381  Partition(unsigned int partitionId, const std::list<const Edge<T> *> &edgeSet);
-
2382  ~Partition() = default;
-
2388  unsigned int getPartitionId() const;
-
2394  void setPartitionId(unsigned int partitionId);
-
2395 
-
2396  private:
-
2397  unsigned int partitionId;
-
2398  };
-
2399 
-
2407  template <typename T>
-
2408  static PartitioningStats getPartitionStats(const PartitionMap<T> &partitionMap);
-
2409 
-
2417  template <typename T>
-
2418  static unsigned int getMaxEdgesLoad(const PartitionMap<T> &partitionMap);
-
2419 
-
2427  template <typename T>
-
2428  static unsigned int getMinEdgesLoad(const PartitionMap<T> &partitionMap);
-
2429 
-
2437  template <typename T>
-
2438  static unsigned int getMaxNodesLoad(const PartitionMap<T> &partitionMap);
-
2439 
-
2447  template <typename T>
-
2448  static unsigned int getMinNodesLoad(const PartitionMap<T> &partitionMap);
-
2449 
-
2457  template <typename T>
-
2458  static unsigned int getNumberOfEdges(const PartitionMap<T> &partitionMap);
-
2459 
-
2467  template <typename T>
-
2468  static unsigned int getNumberOfNodes(const PartitionMap<T> &partitionMap);
-
2469 
-
2477  template <typename T>
-
2478  static unsigned int getNumberOfReplicatedEdges(const PartitionMap<T> &partitionMap);
-
2479 
-
2487  template <typename T>
-
2488  static unsigned int getNumberOfReplicatedNodes(const PartitionMap<T> &partitionMap);
-
2489 
-
2490  template <typename T>
-
2491  Partition<T>::Partition() : Graph<T>()
-
2492  {
-
2493  partitionId = 0;
-
2494  }
-
2495 
-
2496  template <typename T>
-
2497  Partition<T>::Partition(unsigned int partitionId) : Graph<T>()
-
2498  {
-
2499  this->partitionId = partitionId;
-
2500  }
-
2501 
-
2502  template <typename T>
-
2503  Partition<T>::Partition(const std::list<const Edge<T> *> &edgeSet) : Graph<T>(edgeSet)
-
2504  {
-
2505  partitionId = 0;
-
2506  }
-
2507 
-
2508  template <typename T>
-
2509  Partition<T>::Partition(unsigned int partitionId, const std::list<const Edge<T> *> &edgeSet) : Graph<T>(edgeSet)
-
2510  {
-
2511  this->partitionId = partitionId;
-
2512  }
-
2513 
-
2514  template <typename T>
-
2515  unsigned int Partition<T>::getPartitionId() const
-
2516  {
-
2517  return partitionId;
-
2518  }
-
2519 
-
2520  template <typename T>
-
2521  void Partition<T>::setPartitionId(unsigned int partitionId)
-
2522  {
-
2523  this->partitionId = partitionId;
-
2524  }
-
2525 
-
2526  template <typename T>
-
2527  PartitioningStats getPartitionStats(const PartitionMap<T> &partitionMap)
-
2528  {
-
2529  PartitioningStats result;
-
2530  result.numberOfPartitions = partitionMap.size();
-
2531  result.numberOfNodes = getNumberOfNodes(partitionMap);
-
2532  result.numberOfEdges = getNumberOfEdges(partitionMap);
-
2533  result.replicatedNodesCount = getNumberOfReplicatedNodes(partitionMap);
-
2534  result.replicatedEdgesCount = getNumberOfReplicatedEdges(partitionMap);
-
2535  result.maxEdgesLoad = getMaxEdgesLoad(partitionMap);
-
2536  result.minEdgesLoad = getMinEdgesLoad(partitionMap);
-
2537  result.maxNodesLoad = getMaxNodesLoad(partitionMap);
-
2538  result.minNodesLoad = getMinNodesLoad(partitionMap);
-
2539  result.edgesReplicationFactor = (double)result.replicatedEdgesCount / result.numberOfEdges;
-
2540  result.nodesReplicationFactor = (double)result.replicatedNodesCount / result.numberOfNodes;
-
2541  result.balanceEdgesFactor = (double)(result.maxEdgesLoad - result.minEdgesLoad) / (result.maxEdgesLoad);
-
2542  result.balanceNodesFactor = (double)(result.maxNodesLoad - result.minNodesLoad) / (result.maxNodesLoad);
-
2543  return result;
-
2544  }
-
2545 
-
2546  template <typename T>
-
2547  unsigned int getMaxEdgesLoad(const PartitionMap<T> &partitionMap)
-
2548  {
-
2549  unsigned int maxLoad = 0;
-
2550  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
-
2551  {
-
2552  if (it->second->getEdgeSet().size() > maxLoad)
-
2553  {
-
2554  maxLoad = it->second->getEdgeSet().size();
-
2555  }
-
2556  }
-
2557  return maxLoad;
-
2558  }
-
2559 
-
2560  template <typename T>
-
2561  unsigned int getMinEdgesLoad(const PartitionMap<T> &partitionMap)
-
2562  {
-
2563  unsigned int minLoad = std::numeric_limits<unsigned int>::max();
-
2564  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
-
2565  {
-
2566  if (it->second->getEdgeSet().size() < minLoad)
-
2567  {
-
2568  minLoad = it->second->getEdgeSet().size();
-
2569  }
-
2570  }
-
2571  return minLoad;
-
2572  }
-
2573 
-
2574  template <typename T>
-
2575  unsigned int getMaxNodesLoad(const PartitionMap<T> &partitionMap)
-
2576  {
-
2577  unsigned int maxLoad = 0;
-
2578  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
-
2579  {
-
2580  if (it->second->getNodeSet().size() > maxLoad)
-
2581  {
-
2582  maxLoad = it->second->getNodeSet().size();
-
2583  }
-
2584  }
-
2585  return maxLoad;
-
2586  }
-
2587 
-
2588  template <typename T>
-
2589  unsigned int getMinNodesLoad(const PartitionMap<T> &partitionMap)
-
2590  {
-
2591  unsigned int minLoad = std::numeric_limits<unsigned int>::max();
-
2592  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
-
2593  {
-
2594  if (it->second->getNodeSet().size() < minLoad)
-
2595  {
-
2596  minLoad = it->second->getNodeSet().size();
-
2597  }
-
2598  }
-
2599  return minLoad;
-
2600  }
-
2601 
-
2602  template <typename T>
-
2603  unsigned int getNumberOfEdges(const PartitionMap<T> &partitionMap)
-
2604  {
-
2605  unsigned int numberOfEdges = 0;
-
2606  std::list<const Edge<T> *> edgeSet;
-
2607 
-
2608  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
-
2609  {
-
2610  const std::list<const Edge<T> *> partitionEdgeSet = it->second->getEdgeSet();
-
2611  for (auto it2 = partitionEdgeSet.begin(); it2 != partitionEdgeSet.end(); ++it2)
-
2612  {
-
2613  if (std::find_if(edgeSet.begin(), edgeSet.end(), [it2](const Edge<T> *edge)
-
2614  { return (*(*it2) == *edge); }) == edgeSet.end())
-
2615  {
-
2616  edgeSet.push_back(*it2);
-
2617  }
-
2618  }
-
2619  }
-
2620 
-
2621  return edgeSet.size();
-
2622  }
-
2623 
-
2624  template <typename T>
-
2625  unsigned int getNumberOfNodes(const PartitionMap<T> &partitionMap)
-
2626  {
-
2627  unsigned int numberOfNodes = 0;
-
2628  std::list<const Node<T> *> nodeSet;
-
2629 
-
2630  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
-
2631  {
-
2632  const std::list<const Node<T> *> partitionNodeSet = it->second->getNodeSet();
-
2633  for (auto it2 = partitionNodeSet.begin(); it2 != partitionNodeSet.end(); ++it2)
-
2634  {
-
2635  if (std::find_if(nodeSet.begin(), nodeSet.end(), [it2](const Node<T> *node)
-
2636  { return (*(*it2) == *node); }) == nodeSet.end())
-
2637  {
-
2638  nodeSet.push_back(*it2);
-
2639  }
-
2640  }
-
2641  }
-
2642 
-
2643  return nodeSet.size();
-
2644  }
-
2645 
-
2646  template <typename T>
-
2647  unsigned int getNumberOfReplicatedEdges(const PartitionMap<T> &partitionMap)
-
2648  {
-
2649 
-
2650  unsigned int numberOfEdges = 0;
-
2651  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
-
2652  {
-
2653  numberOfEdges += it->second->getEdgeSet().size();
-
2654  }
-
2655  return numberOfEdges;
-
2656  }
-
2657 
-
2658  template <typename T>
-
2659  unsigned int getNumberOfReplicatedNodes(const PartitionMap<T> &partitionMap)
-
2660  {
-
2661  unsigned int numberOfNodes = 0;
-
2662  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
-
2663  {
-
2664  numberOfNodes += it->second->getNodeSet().size();
-
2665  }
-
2666  return numberOfNodes;
-
2667  }
-
2668 
-
2673  template <typename T>
-
2674  class Writer
-
2675  {
-
2676  public:
-
2686  virtual int writeGraph(const Graph<T> &graph, std::ofstream &file) = 0;
-
2687  };
-
2688 
-
2692  template <typename T>
-
2693  class Reader
-
2694  {
-
2704  virtual int ReadGraph(Graph<T> &graph, std::ifstream &file) = 0;
-
2705  };
-
2706 
-
2707  //ostream overload
-
2708  template <typename T>
-
2709  std::ostream &
-
2710  operator<<(std::ostream &os, const Node<T> &node)
-
2711  {
-
2712  os << "Node: {\n"
-
2713  << " Id:\t" << node.id << "\n Data:\t" << node.data << "\n}";
-
2714  return os;
-
2715  }
-
2716 
-
2717  template <typename T>
-
2718  std::ostream &operator<<(std::ostream &os, const Edge<T> &edge)
-
2719  {
-
2720  os << "((Node: " << edge.nodePair.first->getId() << ")) ?----- |Edge: " << edge.id << "|-----? ((Node: " << edge.nodePair.second->getId() << "))";
-
2721  return os;
-
2722  }
-
2723 
-
2724  template <typename T>
-
2725  std::ostream &operator<<(std::ostream &os, const DirectedEdge<T> &edge)
-
2726  {
-
2727  os << "((Node: " << edge.getFrom().getId() << ")) +----- |Edge: #" << edge.getId() << "|-----> ((Node: " << edge.getTo().getId() << "))";
-
2728  return os;
-
2729  }
-
2730 
-
2731  template <typename T>
-
2732  std::ostream &operator<<(std::ostream &os, const UndirectedEdge<T> &edge)
-
2733  {
-
2734  os << "((Node: " << edge.getNode1().getId() << ")) <----- |Edge: #" << edge.getId() << "|-----> ((Node: " << edge.getNode2().getId() << "))";
-
2735  return os;
-
2736  }
-
2737 
-
2738  template <typename T>
-
2739  std::ostream &operator<<(std::ostream &os, const DirectedWeightedEdge<T> &edge)
-
2740  {
-
2741  os << "((Node: " << edge.getFrom().getId() << ")) +----- |Edge: #" << edge.getId() << " W:" << edge.getWeight() << "|-----> ((Node: " << edge.getTo().getId() << "))";
-
2742  return os;
-
2743  }
-
2744 
-
2745  template <typename T>
-
2746  std::ostream &operator<<(std::ostream &os, const UndirectedWeightedEdge<T> &edge)
-
2747  {
-
2748  os << "((Node: " << edge.getNode1().getId() << ")) <----- |Edge: #" << edge.getId() << " W:" << edge.getWeight() << "|-----> ((Node: " << edge.getNode2().getId() << "))";
-
2749  return os;
-
2750  }
-
2751 
-
2752  template <typename T>
-
2753  std::ostream &operator<<(std::ostream &os, const AdjacencyMatrix<T> &adj)
-
2754  {
-
2755  os << "Adjacency Matrix:\n";
-
2756  auto it = adj.begin();
-
2757  unsigned long max_column = 0;
-
2758  for (it; it != adj.end(); ++it)
-
2759  {
-
2760  if (it->second.size() > max_column)
-
2761  {
-
2762  max_column = it->second.size();
-
2763  }
-
2764  }
-
2765  if (max_column == 0)
-
2766  {
-
2767  os << "ERROR in Print\n";
-
2768  return os;
-
2769  }
-
2770  else
-
2771  {
-
2772  it = adj.begin();
-
2773  os << "|--|";
-
2774  for (int i = 0; i < max_column; i++)
-
2775  {
-
2776  os << "-----|";
-
2777  }
-
2778  os << "\n";
-
2779  for (it; it != adj.end(); ++it)
-
2780  {
-
2781  os << "|N" << it->first->getId() << "|";
-
2782  auto it2 = it->second.begin();
-
2783  for (it2; it2 != it->second.end(); ++it2)
-
2784  {
-
2785  os << "N" << it2->first->getId() << ",E" << it2->second->getId() << "|";
-
2786  }
-
2787  os << "\n|--|";
-
2788  for (int i = 0; i < max_column; i++)
-
2789  {
-
2790  os << "-----|";
-
2791  }
-
2792  os << "\n";
-
2793  }
-
2794  }
-
2795  return os;
-
2796  }
-
2797 
-
2798 } // namespace CXXGRAPH
-
2799 #endif // __CXXGRAPH_H__
-
CXXGRAPH::DirectedEdge
Definition: Graph.hpp:335
-
CXXGRAPH::DirectedWeightedEdge
Definition: Graph.hpp:449
-
CXXGRAPH::Edge
Definition: Graph.hpp:263
-
CXXGRAPH::Graph_TS
Class that implement the Thread Safe Graph.
Definition: Graph.hpp:2018
-
CXXGRAPH::Graph_TS::getEdge
const std::optional< const Edge< T > * > getEdge(unsigned long edgeId) const override
Function that return an Edge with specific ID if Exist in the Graph Note: Thread Safe.
Definition: Graph.hpp:2267
-
CXXGRAPH::Graph_TS::getNodeSet
const std::list< const Node< T > * > getNodeSet() const override
Function that return the Node Set of the Graph Note: Thread Safe.
Definition: Graph.hpp:2258
-
CXXGRAPH::Graph_TS::setEdgeSet
void setEdgeSet(std::list< const Edge< T > * > &edgeSet) override
Function set the Edge Set of the Graph Note: Thread Safe.
Definition: Graph.hpp:2234
-
CXXGRAPH::Graph_TS::isDirectedGraph
bool isDirectedGraph() const override
This function checks if a graph is directed Note: Thread Safe.
Definition: Graph.hpp:2330
-
CXXGRAPH::Graph_TS::dijkstra
const DijkstraResult dijkstra(const Node< T > &source, const Node< T > &target) const override
Function runs the dijkstra algorithm for some source node and target node in the graph and returns th...
Definition: Graph.hpp:2285
-
CXXGRAPH::Graph_TS::writeToFile
int writeToFile(typename Graph< T >::InputOutputFormat format=Graph< T >::InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const override
This function write the graph in an output file Note: Thread Safe.
Definition: Graph.hpp:2348
-
CXXGRAPH::Graph_TS::addEdge
void addEdge(const Edge< T > *edge) override
Function add an Edge to the Graph Edge Set Note: Thread Safe.
Definition: Graph.hpp:2242
-
CXXGRAPH::Graph_TS::partitionGraph
PartitionMap< T > partitionGraph(typename Graph< T >::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const override
This function partition a graph in a set of partitions Note: Thread Safe.
Definition: Graph.hpp:2366
-
CXXGRAPH::Graph_TS::isCyclicDirectedGraphBFS
bool isCyclicDirectedGraphBFS() const override
This function uses BFS to check for cycle in the graph. Pay Attention, this function work only with d...
Definition: Graph.hpp:2321
-
CXXGRAPH::Graph_TS::breadth_first_search
const std::vector< Node< T > > breadth_first_search(const Node< T > &start) const override
Function performs the breadth first search algorithm over the graph Note: Thread Safe.
Definition: Graph.hpp:2294
-
CXXGRAPH::Graph_TS::removeEdge
void removeEdge(unsigned long edgeId) override
Function remove an Edge from the Graph Edge Set Note: Thread Safe.
Definition: Graph.hpp:2250
-
CXXGRAPH::Graph_TS::getEdgeSet
const std::list< const Edge< T > * > & getEdgeSet() const override
Function that return the Edge set of the Graph Note: Thread Safe.
Definition: Graph.hpp:2227
-
CXXGRAPH::Graph_TS::depth_first_search
const std::vector< Node< T > > depth_first_search(const Node< T > &start) const override
Function performs the depth first search algorithm over the graph Note: Thread Safe.
Definition: Graph.hpp:2303
-
CXXGRAPH::Graph_TS::readFromFile
int readFromFile(typename Graph< T >::InputOutputFormat format=Graph< T >::InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false) override
This function read the graph from an input file Note: Thread Safe.
Definition: Graph.hpp:2357
-
CXXGRAPH::Graph_TS::dial
const DialResult dial(const Node< T > &source, int maxWeight) const override
This function write the graph in an output file Note: Thread Safe.
Definition: Graph.hpp:2339
-
CXXGRAPH::Graph_TS::isCyclicDirectedGraphDFS
bool isCyclicDirectedGraphDFS() const override
This function uses DFS to check for cycle in the graph. Pay Attention, this function work only with d...
Definition: Graph.hpp:2312
-
CXXGRAPH::Graph_TS::getAdjMatrix
const AdjacencyMatrix< T > getAdjMatrix() const override
This function generate a list of adjacency matrix with every element of the matrix contain the node w...
Definition: Graph.hpp:2276
-
CXXGRAPH::Graph
Class that implement the Graph. ( This class is not Thread Safe )
Definition: Graph.hpp:573
-
CXXGRAPH::Graph::depth_first_search
virtual const std::vector< Node< T > > depth_first_search(const Node< T > &start) const
Function performs the depth first search algorithm over the graph Note: No Thread Safe.
Definition: Graph.hpp:1524
-
CXXGRAPH::Graph::E_PartitionAlgorithm
E_PartitionAlgorithm
Specify the Partition Algorithm.
Definition: Graph.hpp:600
-
CXXGRAPH::Graph::GREEDY_VC
@ GREEDY_VC
A Greedy Vertex-Cut Algorithm.
Definition: Graph.hpp:601
-
CXXGRAPH::Graph::getEdgeSet
virtual const std::list< const Edge< T > * > & getEdgeSet() const
Function that return the Edge set of the Graph Note: No Thread Safe.
Definition: Graph.hpp:823
-
CXXGRAPH::Graph::getEdge
virtual const std::optional< const Edge< T > * > getEdge(unsigned long edgeId) const
Function that return an Edge with specific ID if Exist in the Graph Note: No Thread Safe.
Definition: Graph.hpp:884
-
CXXGRAPH::Graph::isCyclicDirectedGraphBFS
virtual bool isCyclicDirectedGraphBFS() const
This function uses BFS to check for cycle in the graph. Pay Attention, this function work only with d...
Definition: Graph.hpp:1646
-
CXXGRAPH::Graph::removeEdge
virtual void removeEdge(unsigned long edgeId)
Function remove an Edge from the Graph Edge Set Note: No Thread Safe.
Definition: Graph.hpp:853
-
CXXGRAPH::Graph::writeToFile
virtual int writeToFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const
This function write the graph in an output file Note: No Thread Safe.
Definition: Graph.hpp:1859
-
CXXGRAPH::Graph::isDirectedGraph
virtual bool isDirectedGraph() const
This function checks if a graph is directed Note: No Thread Safe.
Definition: Graph.hpp:1715
-
CXXGRAPH::Graph::dial
virtual const DialResult dial(const Node< T > &source, int maxWeight) const
This function write the graph in an output file Note: No Thread Safe.
Definition: Graph.hpp:1731
-
CXXGRAPH::Graph::dijkstra
virtual const DijkstraResult dijkstra(const Node< T > &source, const Node< T > &target) const
Function runs the dijkstra algorithm for some source node and target node in the graph and returns th...
Definition: Graph.hpp:1374
-
CXXGRAPH::Graph::isCyclicDirectedGraphDFS
virtual bool isCyclicDirectedGraphDFS() const
This function uses DFS to check for cycle in the graph. Pay Attention, this function work only with d...
Definition: Graph.hpp:1556
-
CXXGRAPH::Graph::addEdge
virtual void addEdge(const Edge< T > *edge)
Function add an Edge to the Graph Edge Set Note: No Thread Safe.
Definition: Graph.hpp:843
-
CXXGRAPH::Graph::partitionGraph
virtual PartitionMap< T > partitionGraph(PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const
This function partition a graph in a set of partitions Note: No Thread Safe.
Definition: Graph.hpp:1996
-
CXXGRAPH::Graph::readFromFile
virtual int readFromFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false)
This function read the graph from an input file Note: No Thread Safe.
Definition: Graph.hpp:1932
-
CXXGRAPH::Graph::getAdjMatrix
virtual const AdjacencyMatrix< T > getAdjMatrix() const
This function generate a list of adjacency matrix with every element of the matrix contain the node w...
Definition: Graph.hpp:1347
-
CXXGRAPH::Graph::getNodeSet
virtual const std::list< const Node< T > * > getNodeSet() const
Function that return the Node Set of the Graph Note: No Thread Safe.
Definition: Graph.hpp:864
-
CXXGRAPH::Graph::breadth_first_search
virtual const std::vector< Node< T > > breadth_first_search(const Node< T > &start) const
Function performs the breadth first search algorithm over the graph Note: No Thread Safe.
Definition: Graph.hpp:1484
-
CXXGRAPH::Graph::setEdgeSet
virtual void setEdgeSet(std::list< const Edge< T > * > &edgeSet)
Function set the Edge Set of the Graph Note: No Thread Safe.
Definition: Graph.hpp:829
-
CXXGRAPH::Graph::E_InputOutputFormat
E_InputOutputFormat
Specify the Input/Output format of the Graph for Import/Export functions.
Definition: Graph.hpp:589
-
CXXGRAPH::Graph::STANDARD_CSV
@ STANDARD_CSV
A standard csv format.
Definition: Graph.hpp:590
-
CXXGRAPH::Graph::STANDARD_TSV
@ STANDARD_TSV
A standard tsv format.
Definition: Graph.hpp:591
-
CXXGRAPH::Node
Definition: Graph.hpp:157
-
CXXGRAPH::Partition
Definition: Graph.hpp:2376
-
CXXGRAPH::Partition::setPartitionId
void setPartitionId(unsigned int partitionId)
Set the Partition ID.
Definition: Graph.hpp:2521
-
CXXGRAPH::Partition::getPartitionId
unsigned int getPartitionId() const
Get the Partition ID.
Definition: Graph.hpp:2515
-
CXXGRAPH::Reader
Definition: Graph.hpp:2694
-
CXXGRAPH::ThreadSafe
Definition: Graph.hpp:242
-
CXXGRAPH::UndirectedEdge
Definition: Graph.hpp:392
-
CXXGRAPH::UndirectedWeightedEdge
Definition: Graph.hpp:509
-
CXXGRAPH::Weighted
Definition: Graph.hpp:205
-
CXXGRAPH::Writer
Definition: Graph.hpp:2675
-
CXXGRAPH::Writer::writeGraph
virtual int writeGraph(const Graph< T > &graph, std::ofstream &file)=0
Function performs the writing of the Graph to the file.
-
CXXGRAPH::DialResult_struct
Struct that contains the information about Dijsktra's Algorithm results.
Definition: Graph.hpp:88
-
CXXGRAPH::DijkstraResult_struct
Struct that contains the information about Dijsktra's Algorithm results.
Definition: Graph.hpp:79
-
CXXGRAPH::PartitioningStats_struct
Struct that contains the information about the partitioning statistics.
Definition: Graph.hpp:97
+
1555 } // namespace CXXGRAPH
+
1556 #endif // __GRAPH_H__
+
CXXGRAPH::DirectedEdge
Definition: DirectedEdge.hpp:39
+
CXXGRAPH::DirectedWeightedEdge
Definition: DirectedWeightedEdge.hpp:42
+
CXXGRAPH::Edge
Definition: Edge.hpp:40
+
CXXGRAPH::Graph
Class that implement the Graph. ( This class is not Thread Safe )
Definition: Graph.hpp:76
+
CXXGRAPH::Graph::depth_first_search
virtual const std::vector< Node< T > > depth_first_search(const Node< T > &start) const
Function performs the depth first search algorithm over the graph Note: No Thread Safe.
Definition: Graph.hpp:1013
+
CXXGRAPH::Graph::getEdgeSet
virtual const std::list< const Edge< T > * > & getEdgeSet() const
Function that return the Edge set of the Graph Note: No Thread Safe.
Definition: Graph.hpp:307
+
CXXGRAPH::Graph::getEdge
virtual const std::optional< const Edge< T > * > getEdge(unsigned long edgeId) const
Function that return an Edge with specific ID if Exist in the Graph Note: No Thread Safe.
Definition: Graph.hpp:368
+
CXXGRAPH::Graph::isCyclicDirectedGraphBFS
virtual bool isCyclicDirectedGraphBFS() const
This function uses BFS to check for cycle in the graph. Pay Attention, this function work only with d...
Definition: Graph.hpp:1135
+
CXXGRAPH::Graph::removeEdge
virtual void removeEdge(unsigned long edgeId)
Function remove an Edge from the Graph Edge Set Note: No Thread Safe.
Definition: Graph.hpp:337
+
CXXGRAPH::Graph::writeToFile
virtual int writeToFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const
This function write the graph in an output file Note: No Thread Safe.
Definition: Graph.hpp:1348
+
CXXGRAPH::Graph::isDirectedGraph
virtual bool isDirectedGraph() const
This function checks if a graph is directed Note: No Thread Safe.
Definition: Graph.hpp:1204
+
CXXGRAPH::Graph::dial
virtual const DialResult dial(const Node< T > &source, int maxWeight) const
This function write the graph in an output file Note: No Thread Safe.
Definition: Graph.hpp:1220
+
CXXGRAPH::Graph::dijkstra
virtual const DijkstraResult dijkstra(const Node< T > &source, const Node< T > &target) const
Function runs the dijkstra algorithm for some source node and target node in the graph and returns th...
Definition: Graph.hpp:863
+
CXXGRAPH::Graph::isCyclicDirectedGraphDFS
virtual bool isCyclicDirectedGraphDFS() const
This function uses DFS to check for cycle in the graph. Pay Attention, this function work only with d...
Definition: Graph.hpp:1045
+
CXXGRAPH::Graph::addEdge
virtual void addEdge(const Edge< T > *edge)
Function add an Edge to the Graph Edge Set Note: No Thread Safe.
Definition: Graph.hpp:327
+
CXXGRAPH::Graph::partitionGraph
virtual PartitionMap< T > partitionGraph(PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const
This function partition a graph in a set of partitions Note: No Thread Safe.
Definition: Graph.hpp:1485
+
CXXGRAPH::Graph::readFromFile
virtual int readFromFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false)
This function read the graph from an input file Note: No Thread Safe.
Definition: Graph.hpp:1421
+
CXXGRAPH::Graph::getAdjMatrix
virtual const AdjacencyMatrix< T > getAdjMatrix() const
This function generate a list of adjacency matrix with every element of the matrix contain the node w...
Definition: Graph.hpp:836
+
CXXGRAPH::Graph::getNodeSet
virtual const std::list< const Node< T > * > getNodeSet() const
Function that return the Node Set of the Graph Note: No Thread Safe.
Definition: Graph.hpp:348
+
CXXGRAPH::Graph::breadth_first_search
virtual const std::vector< Node< T > > breadth_first_search(const Node< T > &start) const
Function performs the breadth first search algorithm over the graph Note: No Thread Safe.
Definition: Graph.hpp:973
+
CXXGRAPH::Graph::setEdgeSet
virtual void setEdgeSet(std::list< const Edge< T > * > &edgeSet)
Function set the Edge Set of the Graph Note: No Thread Safe.
Definition: Graph.hpp:313
+
CXXGRAPH::Node
Definition: Node.hpp:35
+
CXXGRAPH::PARTITIONING::Partition
Definition: Partition.hpp:38
+
CXXGRAPH::UndirectedEdge
Definition: UndirectedEdge.hpp:39
+
CXXGRAPH::UndirectedWeightedEdge
Definition: UndirectedWeightedEdge.hpp:43
+
CXXGRAPH::DialResult_struct
Struct that contains the information about Dijsktra's Algorithm results.
Definition: Typedef.hpp:71
+
CXXGRAPH::DijkstraResult_struct
Struct that contains the information about Dijsktra's Algorithm results.
Definition: Typedef.hpp:62
diff --git a/docs/html/d9/da1/classCXXGRAPH_1_1PARTITIONING_1_1PartitionerThread-members.html b/docs/html/d9/da1/classCXXGRAPH_1_1PARTITIONING_1_1PartitionerThread-members.html new file mode 100644 index 000000000..0b739dc6e --- /dev/null +++ b/docs/html/d9/da1/classCXXGRAPH_1_1PARTITIONING_1_1PartitionerThread-members.html @@ -0,0 +1,88 @@ + + + + + + + +CXXGraph: Member List + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
CXXGRAPH::PARTITIONING::PartitionerThread< T > Member List
+
+
+ +

This is the complete list of members for CXXGRAPH::PARTITIONING::PartitionerThread< T >, including all inherited members.

+ + + + + +
id_partitions (defined in CXXGRAPH::PARTITIONING::PartitionerThread< T >)CXXGRAPH::PARTITIONING::PartitionerThread< T >
PartitionerThread(std::vector< Edge< T >> &list, PartitionState< T > *state, PartitionStrategy< T > &algorithm, std::list< int > *ids) (defined in CXXGRAPH::PARTITIONING::PartitionerThread< T >)CXXGRAPH::PARTITIONING::PartitionerThread< T >
run() (defined in CXXGRAPH::PARTITIONING::PartitionerThread< T >)CXXGRAPH::PARTITIONING::PartitionerThread< T >
~PartitionerThread() (defined in CXXGRAPH::PARTITIONING::PartitionerThread< T >)CXXGRAPH::PARTITIONING::PartitionerThread< T >
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/da/d0e/PartitionerThread_8hpp_source.html b/docs/html/da/d0e/PartitionerThread_8hpp_source.html new file mode 100644 index 000000000..a86e7f70d --- /dev/null +++ b/docs/html/da/d0e/PartitionerThread_8hpp_source.html @@ -0,0 +1,160 @@ + + + + + + + +CXXGraph: /github/workspace/include/Partitioning/PartitionerThread.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
PartitionerThread.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __CXXGRAPH_PARTITIONING_PARTITIONERTHREAD_H__
+
21 #define __CXXGRAPH_PARTITIONING_PARTITIONERTHREAD_H__
+
22 
+
23 #pragma once
+
24 
+
25 #include <vector>
+
26 #include <list>
+
27 #include "Edge/Edge.hpp"
+
28 #include "PartitionState.hpp"
+
29 #include "PartitionStrategy.hpp"
+
30 
+
31 namespace CXXGRAPH
+
32 {
+
33  namespace PARTITIONING
+
34  {
+
35  template <typename T>
+
36  class PartitionerThread
+
37  {
+
38  private:
+
39  std::vector<Edge<T>> list;
+
40  PartitionState<T> *state;
+
41  PartitionStrategy<T> algorithm;
+
42 
+
43  public:
+
44  PartitionerThread(std::vector<Edge<T>> &list, PartitionState<T> *state, PartitionStrategy<T> &algorithm, std::list<int> *ids);
+
45  ~PartitionerThread();
+
46 
+
47  void run();
+
48 
+
49  std::list<int> *id_partitions;
+
50  };
+
51  template <typename T>
+
52  PartitionerThread<T>::PartitionerThread(std::vector<Edge<T>> &list, PartitionState<T> *state, PartitionStrategy<T> &algorithm, std::list<int> *ids)
+
53  {
+
54  this->list = list;
+
55  this->state = state;
+
56  this->algorithm = algorithm;
+
57  this->id_partitions = ids;
+
58  }
+
59  template <typename T>
+
60  PartitionerThread<T>::~PartitionerThread()
+
61  {
+
62  }
+
63  template <typename T>
+
64  void PartitionerThread<T>::run()
+
65  {
+
66  auto edge_it = list.begin();
+
67  for (edge_it; edge_it != list.end(); ++edge_it)
+
68  {
+
69  algorithm.performStep(*edge_it, *state);
+
70  }
+
71  }
+
72  }
+
73 }
+
74 
+
75 #endif // __CXXGRAPH_PARTITIONING_PARTITIONERTHREAD_H__
+
CXXGRAPH::Edge
Definition: Edge.hpp:40
+
CXXGRAPH::PARTITIONING::PartitionState
Definition: PartitionState.hpp:31
+
CXXGRAPH::PARTITIONING::PartitionStrategy
Definition: PartitionStrategy.hpp:34
+
CXXGRAPH::PARTITIONING::PartitionerThread
Definition: PartitionerThread.hpp:37
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/da/d21/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState__inherit__graph.map b/docs/html/da/d21/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState__inherit__graph.map new file mode 100644 index 000000000..2d46c65a7 --- /dev/null +++ b/docs/html/da/d21/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/docs/html/da/d21/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState__inherit__graph.md5 b/docs/html/da/d21/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState__inherit__graph.md5 new file mode 100644 index 000000000..2f230d048 --- /dev/null +++ b/docs/html/da/d21/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState__inherit__graph.md5 @@ -0,0 +1 @@ +f3f811bb34b42b5a3b1762577c5fe63c \ No newline at end of file diff --git a/docs/html/da/d21/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState__inherit__graph.png b/docs/html/da/d21/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState__inherit__graph.png new file mode 100644 index 0000000000000000000000000000000000000000..eec70cc2f32240c6046daca4d90c1c97be3fd644 GIT binary patch literal 7351 zcmc(Ehdcx?~Kfpk&%(T zMYj9Z=l8q6kNf`Jf53ful=tJv+jXw%`FgH*kd}rb1sO9L0)e1VRzmB**Ae&|h9rc4 zOPiG%;0v+2sv;V3`uESf+N>x9g4IqLEvx6AxSHh2srQ)Ub8p=B7qX8Z(xCV;SWWpi z-y-#L(-%^`lq<1?mrFlk)1r;_bw+>Z8AqyK{vOc&DPHSo?A82IJj2Bc@lH%G;_Dpq zUcJd~Ppkr#hX3pzxz2fb&;NOzGXK0=+@;5Xm>|FmiD)1YPI-VpY;gE65V#Y#Q~NOd zz3}Bu6_SvMS4i^`;rBTuDJm*@=^C_!3R4ge5)!?2>jV*rICaCixk-EOs-b=Ogzi#V z+Sxt-z0hB%N3@5_$jx0DF0?=qHte7fLI@$k4Z@B8zGy|B- zbbILYXGJ-=nf^3IlJl%eN=k9pEr@C885j(Vj64?yGE8vC_wF+Uq5U`)7Qbd0IQG53|8Iax!el*`H(n+u zPee$cxNrQFJ#*&8C!_LU+7}|t@;xDx_5cck*0D#;3AU{H>b4fdM5M88aiJ``*Sy zBH7z+Ybz@&HLlC_v0Y)Ip~lruKjHDzMQH_B83WQ%Q*Sv;tSl{kNKa4C&aQaA@65rG zlAg|e(*Nt%uRD^GjN}Tsy0im2Mn+xch0ndb)+g(G%?tP3E>a;64i3V@!*AZanU+}H zpvOf<#pn6^+S@PL+1YSDRTUL{0s>tf9fpR6Y~s$d0~xApY-~!QNlD{>CUL!1#fo2e z1a(r=xcJj{%P%l5&Uabu0|Pp$s;Vw7E>~j(M(tV8D<+akh>6Y4&s&J1vuI2Z z`nwArM|;;3x-rF86lG35iQ)kP0dDIP@)%fVduONlB)|VfL7m_Zql3-YDm64T2a`x<|U~NNQKmf72y879(XPp!{SXtFnRd0xhB#OK65XsuzsxB%T zXlo0&`#$dN+nCtc?RCOtM_pZAK)v7DbA4?M4Kgg`4Q z`t+&zQ7?O;t+ln1p&?V)=AS>flOyq>;|Sc5#c0W6Dx$N*#Hj>87LR(9#baZrrSFV)Xjrj2d1qDs*ub`gkH0cEK`zY>`$OG0qbFO*r z+6f4JgiS9fxYmE0ER=43L8;riHajC@XX%>&V}Spa1WD_sdTBZ9c??N@hqpWaI7-u^y3HdbTZkFpC%Nl6I|3>3R3bcCN~Wy@h& z6@PYew9k5;q!uNMBqLK%Qu5)5?_NB83cR}&MCgzh@Gb&R#O^&;-Ns3^nJH%C;jgb)Irxe6u)rUXIgDvxcR zvckN)wf*h+t~XbjZ+*zlcK7gTZEd~&R;^!rpX-u@M5OQoq0Wwu{ey$Hwlz4lTO)}^A;vyn?4@3&w=_!ict4I}fJ&CMMQaSG^8*SE*SP)ARG! zfo~`|q@JIi)CLC!`}?<++5eF0;}T{^(?xo{?3X5*`4ZBHOTjc;8yg#AWo4B#Ya#*; z4idJ0{CLw-!*u4=OMm~yYtMIA3|(D!^78Uv0M0R7T^X-77?9MVg1MoiBa+opQBm>o z@qL8dczSM6j$at&<5A<;-kkX?B_*Yssdf>s1p1Jrk#sjq%zUn& z{5Y0q2os%+5x8>2{`g?0D^}>w#zuB-?n};vk>W=uCnw6v$^!bi8#_B*o71gzUWa64 zWD>V;v$3*rB1fy;gm7F$vOv9nFad+S-#a^>K7N$b{WUwAYgpXY(ZMe+&g2Iqfkxp+ zfBe|LXLjSohm??qi{>3SH~CzEw-O!$i zy}gqaPFx4r!`2W6tONky&c%yn2fr8bcs#61CJOMfDGFrFD)oH0xtZ(sZO`ubn5}M^F)ckkth4jMTJ<{jgKYT_`lLIaw?swV0D{|d-9{iZ5!Y(2pVYu& zLpm(2EG-AWe@B(pS|6q>M{x_Ih-4imY8tKj1_xKx*1iu78E9+ErrfkRSF5J3j?XI0 zH>nSgh&Y9t=fM>PRVGEo$B!R#bIA{n2fuv-=e9C4(`;T?aDk?&-ZQ zFdtSwl}DqGRvmEF&c8Z=5V$)x@QtMmt@%UFPEJ#fVl1Lh$Vo{JE1fe63!RjdkeXjW z+BFiz8g+NOCbPjHKbLTFa_Z>lAf=>C5qTWhAPXKTEiKKY-g|Xsruf;;(ixKT);2b& z4i45Y(^aJw4_AD!eVA`&m90h)f@=N;O*^A zN=mxBySre(=6Eif>CAI(86dwgL=CdxTtf(==6_yTG(_=^r#xsf@uf~Ckn-FmA2VUa zzoF++@3s>5c$s3hC!JO8`Lh1LHbz8LltcGAPMw%oNi9<{Fzr)jn~~3%hSbbVo&((3 zpl54@RDoZ!aN%LKX&D(hx-NUVwoH>g%dOf3&5loZxsZONKRlO~9!QraZc=PaXYc)r z#g&%-k)h%iPz75Vt9j+o^D{MKm!C}J#>8B@OVwiTBz(hGjCCzbUnHCW6U}~=p{FC~ zpTd*v9vsHWMqwqWuaJWYp+yYdOZT(*3#1IH7Bi( zQIbh+L2#dS*Jg$f;?LRGyIE=c#KS|*Vcn+zw7?%*}A5b+sdSdue z*kg-`?3d710xJha0cPOcr%z2^VO!Hb9**!*Z^sfOru`o|?mvO<|KG*Qe7Vez(NT6u z_l=zNP+Mz}(Z0U*ln1S1a*B%cxD!S3(2HDLGhazrKDT#%=xW!JDh=KYgt`6hP3Xrn!g5en%89q`C5v5*aE;JRn0hwx>t92?7Fw z%*@Q@=4MpY>sS$H`_|wKF!!{)8YLwqU%I;FxPVGXPyO${|B@nIUs6IR&^9y_E5kWE zH)qaL==s>%dT)Q9;{5s4hyVQZ&#)<^)|C}Iv#1Mr6*YqUBfx${Qb3;I0?Yx%@ zYzdVG$|@)>*45X~)X7nOBiPt;S6jQkyPHCw113^fm}aDHj+%`$NK(Rr^z;s!J9lJM z)VFWnwzsy3Nk~q2@^Qz<>o`#n5mrVBg{U7wk_C0X ze*L<`WZmlGqOyjDzK)KHs;b=*;&>$g`-UoA`|M1~47(KgNp5UcH!Q`4>x;j-F14DtqTj684 zY7DZ$Q`BvdE!p8!q)AFdbx3_EQ>$5X6-)(l^C8MMiy>Wwf_-x3k{E6Q5 zxu1B7h|!SaQSiq}6?#lWa!66+UK)U=PFYk$s&1kKs z=u(dRpMoNx#&|l^kpZajV^XtkS+>x@^(vM z&FY{aQX4v&AUX~X+;j`+|Bi$=RJeChk^{O-JW(TKV`?b;-YJ&o>CT@&n(-o}UX_*| zG=nJ3WJy_O?PWfG{vA$ldDnt^QR?>yODT&VM)o+ z(RQ!g-Mf8PPh3hClu1=Dg(JL2Ec_enV2qphw^MSB3=JzQDu{@PLgUm;)5R1Y<-Q&c z`I@EaU}H1w?0?Mbu&}o|1BN~)CkL=(>)^mq2#Wsk{d)rSy^SfkSz&*bjMUqy-a2Y*jLlK}VbbgYSYhgGr12fjB#ChULhdY@4J z5e*ZQ$L6&BEOupiIiwA_TvT5E=o;hV;^OejjEoF`>QS059~~GZ07JRMBp8p$8jtO^ zFqVZMKOi0XCtZ>znm*Ui$^Nn5-rl~$atjh+VHnUBDEQji+OPrzMcB;e2vGWjd3`$R zBRmaTk~XT40hj=M3G{0&&d$IsK#t8#O+dfjKN*eKmBq%!W@TkTb|R7mqf!k$k&Vq| zB3V?G-o1OhiQ+T!^9&puldz;8KN6CXYF*|v%!c^de}Uu0$;uK0HX9b2pB*iQUTSR2 z_@q3T^5x&iWpT60&+jh0pc6AT9;cRDK7k4dx`hCL|D5b>2$o~@xcZ8U;r8~0!5m%4lYdi8)9>HE&vQr}b&F17 zU0wecWY(X<*&wulJ%V2YnXap|6C&Jq2x4c$r669-va2X41b|&iOk^E}q%t@;X>$KQ zUu(Kn%RXz^ziHOGWb^0J(!qAGG*oZk2|s-Jpa8qp)&_d@S~^mRJ6Rg%-D2zI`*&CS zWg5bP#};9h~ z*MnPHWZ#)CT5Uq=w*OJ~`0-;{Jn-_`SY?z(mTEj&0g3n1#Y(Y*NOnil=8qP#kwh?siQa7ho0k(L!f5!oCrCd`-SeQt@z?F}3m^h3NAdUv1fax0yIrx^+1Xig3JQQSC$gxt^mw&= z5||de7$@@C#?MArKumNrz2JSH%TpXmoYr{8Q@;DZKspy*Wt--bmuR=3Hq_Li%Fx#@ zD=fsDT<9grFd|?_3;M}C^Ym;LY-3@vs|=2F9hYorX%RH8&@wfE4l+iiyR-Az>4}$) z4*Vt^1B2KG1?DgwUfy!sp}d}+9^eErfB4P-a7PWn%YXn#W4bwdi~)~D;^E!Aht+U% zRTUMes-UK|wY9ycr?<4c92gLA)ub*rGcy1gcjM7{oxHLB{_CLB;4CDP;IJj&x~@*j z_e|rdQTsy!1DMlt+^IKXz}axWd*N)<7X%Bmhfy1v6aiDOUsKTpl{^`*f=FIcUT$H) z*ey6tW~zHnU%#rd5;7*KWc1O!S|soaRM!B;<)tN>$F!KXcXdaC*!Wo*HzKe>|Ra7J?^VY7qz$Ym9dt<}V%}rBNQ&dhdQ z<2%q~!SeuUtDwIIKadU%-mo1&s=VIb*H(ohd0&E8;)j1J*ZgUlIB zjeFw_6pmsMhT37g>H<6a$=0u~j|TZ$A%lH=8(UjVCl^q-&QuZ_7dq;DYfV&T$Rk|= zK|zsg*JMnfq$MIDsrNo+HYyRg%Mx60;eLs=wydly#5_&Si1gxy0l3G{#uqSp|8%`k zjx{5%;Y$s+gTsS%SzKJ4oOq@)MgS@vfHomZA?f(o7`T``Osz`RS0R%+wX}YPK^blu zaI0DB3Eu|>pyp*~48X@+qC!GjV|;b!+qa#Aon^q9LU1>aTAY@F0q>$rlR~3kIA4`h zi@c0s6?PGv54b;=bm$ldhlkyd_MF_@+-6s4{{k17|LFHuO;}DordIgo&G9N%fnCq$ z=>|(-==`9tE(fT)Z%#wM>>n7Y8a<_1fa5dA2mzm{#$GiOHDv^FCW$(*``^{p)inZ% z(m{|nZ$SGEKcSwX!ytGc+}Oojyh0j~ZmJyg^$Brt?HypvN1(gjG8QuDf@dYRHa5@$ z0^lHQtE;JPZEwS2LHljScpi!5jOsAR$M~CxfxG&iYY5MCpltv(ZzA?P>!nR4`;$-d zSs!)bPzWK5qA`)B%{6j(V3uc8zE<2Tm8Qi9po6{%ozLI@MJFGj0vt~%edM#!8d0#^ z3Pc>nB069#;_DgYbNY;WFqA-w;+++_kIDb_aPB`k^X~ 
The documentation for this class was generated from the following file: diff --git a/docs/html/da/d5d/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord-members.html b/docs/html/da/d5d/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord-members.html new file mode 100644 index 000000000..442539b58 --- /dev/null +++ b/docs/html/da/d5d/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord-members.html @@ -0,0 +1,96 @@ + + + + + + + +CXXGraph: Member List + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
CXXGRAPH::PARTITIONING::CoordinatedRecord< T > Member List
+
+
+ +

This is the complete list of members for CXXGRAPH::PARTITIONING::CoordinatedRecord< T >, including all inherited members.

+ + + + + + + + + + + + + +
addAll(std::set< int > &set) (defined in CXXGRAPH::PARTITIONING::CoordinatedRecord< T >)CXXGRAPH::PARTITIONING::CoordinatedRecord< T >
addPartition(int m) (defined in CXXGRAPH::PARTITIONING::CoordinatedRecord< T >)CXXGRAPH::PARTITIONING::CoordinatedRecord< T >virtual
CoordinatedRecord() (defined in CXXGRAPH::PARTITIONING::CoordinatedRecord< T >)CXXGRAPH::PARTITIONING::CoordinatedRecord< T >
getDegree() (defined in CXXGRAPH::PARTITIONING::CoordinatedRecord< T >)CXXGRAPH::PARTITIONING::CoordinatedRecord< T >virtual
getLock() (defined in CXXGRAPH::PARTITIONING::CoordinatedRecord< T >)CXXGRAPH::PARTITIONING::CoordinatedRecord< T >virtual
getPartitions() (defined in CXXGRAPH::PARTITIONING::CoordinatedRecord< T >)CXXGRAPH::PARTITIONING::CoordinatedRecord< T >virtual
getReplicas() (defined in CXXGRAPH::PARTITIONING::CoordinatedRecord< T >)CXXGRAPH::PARTITIONING::CoordinatedRecord< T >virtual
hasReplicaInPartition(int m) (defined in CXXGRAPH::PARTITIONING::CoordinatedRecord< T >)CXXGRAPH::PARTITIONING::CoordinatedRecord< T >virtual
incrementDegree() (defined in CXXGRAPH::PARTITIONING::CoordinatedRecord< T >)CXXGRAPH::PARTITIONING::CoordinatedRecord< T >virtual
intersection(CoordinatedRecord &x, CoordinatedRecord &y) (defined in CXXGRAPH::PARTITIONING::CoordinatedRecord< T >)CXXGRAPH::PARTITIONING::CoordinatedRecord< T >static
releaseLock() (defined in CXXGRAPH::PARTITIONING::CoordinatedRecord< T >)CXXGRAPH::PARTITIONING::CoordinatedRecord< T >virtual
~CoordinatedRecord() (defined in CXXGRAPH::PARTITIONING::CoordinatedRecord< T >)CXXGRAPH::PARTITIONING::CoordinatedRecord< T >
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/da/d71/classCXXGRAPH_1_1PARTITIONING_1_1PartitioningStats.html b/docs/html/da/d71/classCXXGRAPH_1_1PARTITIONING_1_1PartitioningStats.html new file mode 100644 index 000000000..35b60ce1a --- /dev/null +++ b/docs/html/da/d71/classCXXGRAPH_1_1PARTITIONING_1_1PartitioningStats.html @@ -0,0 +1,137 @@ + + + + + + + +CXXGraph: CXXGRAPH::PARTITIONING::PartitioningStats Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Public Attributes | +Friends | +List of all members
+
+
CXXGRAPH::PARTITIONING::PartitioningStats Class Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Attributes

+unsigned int numberOfPartitions
 
+unsigned int numberOfNodes
 
+unsigned int replicatedNodesCount
 
+unsigned int numberOfEdges
 
+unsigned int replicatedEdgesCount
 
+unsigned int maxEdgesLoad
 
+unsigned int minEdgesLoad
 
+unsigned int maxNodesLoad
 
+unsigned int minNodesLoad
 
+double balanceEdgesFactor
 
+double balanceNodesFactor
 
+double nodesReplicationFactor
 
+double edgesReplicationFactor
 
+ + + +

+Friends

+std::ostream & operator<< (std::ostream &os, const PartitioningStats &partitionStats)
 
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/da/da5/classCXXGRAPH_1_1Graph__TS.html b/docs/html/da/da5/classCXXGRAPH_1_1Graph__TS.html index 7c1483123..a30740609 100644 --- a/docs/html/da/da5/classCXXGRAPH_1_1Graph__TS.html +++ b/docs/html/da/da5/classCXXGRAPH_1_1Graph__TS.html @@ -79,7 +79,7 @@

Class that implement the Thread Safe Graph. More...

-

#include <Graph.hpp>

+

#include <Graph_TS.hpp>

Inheritance diagram for CXXGRAPH::Graph_TS< T >:
@@ -152,28 +152,19 @@ const DialResult dial (const Node< T > &source, int maxWeight) const override  This function write the graph in an output file Note: Thread Safe. More...
  -int writeToFile (typename Graph< T >::InputOutputFormat format=Graph< T >::InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const override - This function write the graph in an output file Note: Thread Safe. More...
-  -int readFromFile (typename Graph< T >::InputOutputFormat format=Graph< T >::InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false) override - This function read the graph from an input file Note: Thread Safe. More...
-  -PartitionMap< T > partitionGraph (typename Graph< T >::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const override - This function partition a graph in a set of partitions Note: Thread Safe. More...
-  +int writeToFile (InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const override + This function write the graph in an output file Note: Thread Safe. More...
+  +int readFromFile (InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false) override + This function read the graph from an input file Note: Thread Safe. More...
+  +PartitionMap< T > partitionGraph (PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const override + This function partition a graph in a set of partitions Note: Thread Safe. More...
+  - Public Member Functions inherited from CXXGRAPH::Graph< T >  Graph (const std::list< const Edge< T > * > &edgeSet)   -virtual int writeToFile (InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const - This function write the graph in an output file Note: No Thread Safe. More...
-  -virtual int readFromFile (InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false) - This function read the graph from an input file Note: No Thread Safe. More...
-  -virtual PartitionMap< T > partitionGraph (PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const - This function partition a graph in a set of partitions Note: No Thread Safe. More...
-  - Public Member Functions inherited from CXXGRAPH::ThreadSafe void getLock () const @@ -184,26 +175,6 @@ - - - - - - - - - - - @@ -628,8 +599,8 @@

-

◆ partitionGraph()

+ +

◆ partitionGraph()

@@ -642,7 +613,7 @@

PartitionMap< T > CXXGRAPH::Graph_TS< T >::partitionGraph

- + @@ -659,7 +630,7 @@

-override +overridevirtual

Additional Inherited Members

- Public Types inherited from CXXGRAPH::Graph< T >
enum  E_InputOutputFormat { STANDARD_CSV -, STANDARD_TSV -, OUT_1 -, OUT_2 - }
 Specify the Input/Output format of the Graph for Import/Export functions. More...
 
enum  E_PartitionAlgorithm { GREEDY_VC -, ALG_1 -, ALG_2 - }
 Specify the Partition Algorithm. More...
 
-typedef E_InputOutputFormat InputOutputFormat
 
-typedef E_PartitionAlgorithm PartitionAlgorithm
 
- Protected Attributes inherited from CXXGRAPH::ThreadSafe
std::mutex mutex
(typename Graph< T >::PartitionAlgorithm PARTITIONING::PartitionAlgorithm  algorithm,
@@ -674,10 +645,12 @@

Returns
The partiton Map of the partitioned graph
+

Reimplemented from CXXGRAPH::Graph< T >.

+

- -

◆ readFromFile()

+ +

◆ readFromFile()

@@ -690,8 +663,8 @@

int CXXGRAPH::Graph_TS< T >::readFromFile ( - typename Graph< T >::InputOutputFormat  - format = Graph<T>::InputOutputFormat::STANDARD_CSV, + InputOutputFormat  + format = InputOutputFormat::STANDARD_CSV, @@ -731,7 +704,7 @@

-override +overridevirtual

@@ -750,6 +723,8 @@

Returns
0 if all OK, else return a negative value
+

Reimplemented from CXXGRAPH::Graph< T >.

+

@@ -828,8 +803,8 @@

-

◆ writeToFile()

+ +

◆ writeToFile()

@@ -842,8 +817,8 @@

int CXXGRAPH::Graph_TS< T >::writeToFile ( - typename Graph< T >::InputOutputFormat  - format = Graph<T>::InputOutputFormat::STANDARD_CSV, + InputOutputFormat  + format = InputOutputFormat::STANDARD_CSV, @@ -883,7 +858,7 @@

-override +overridevirtual

@@ -902,10 +877,12 @@

Returns
0 if all OK, else return a negative value
+

Reimplemented from CXXGRAPH::Graph< T >.

+

The documentation for this class was generated from the following file: diff --git a/docs/html/da/de0/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__coll__graph.map b/docs/html/da/de0/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__coll__graph.map new file mode 100644 index 000000000..6be14b3bc --- /dev/null +++ b/docs/html/da/de0/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/docs/html/da/de0/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__coll__graph.md5 b/docs/html/da/de0/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__coll__graph.md5 new file mode 100644 index 000000000..519875feb --- /dev/null +++ b/docs/html/da/de0/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__coll__graph.md5 @@ -0,0 +1 @@ +7b2859755e79dd0c86a1a9919e3e96cc \ No newline at end of file diff --git a/docs/html/da/de0/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__coll__graph.png b/docs/html/da/de0/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState__coll__graph.png new file mode 100644 index 0000000000000000000000000000000000000000..3d8e9a055d931673ec906c25652c497d1c852db0 GIT binary patch literal 7372 zcmc&(g;y2-wm&LLiiDJa#F0`;KtNKuLzM3Bl({AR!IXNF#6i zyLa97)_s4#8<#K)XM*qE`%@F9tSEI8>kbwIfw(CnEv^FJC*gl2##Q)Q)hgWt-)~tTKq_? zD9_Z}?`pNuOj!x>)u;3^Ig1k z#`VpG`d7Tu`}YOxS56;_iQu6*DSiQl5$g1DV9*uva)?CJZwBXBpDHji6kMSGIDaQ zeIlf9+Ay}k1C@^E67mMBq0#WxFM&0}NS_wJ$n=;)+5L<=t9WXAi$%lCI9;LU7n zYs<^a`;eOpx4BpmzC2kkC^dMd0H}6kxC&*N0jJhk>a(J=V%~q!7 zO<|<;bCiafh9*G6zID{d&kq$Ft72qCYi3xcvA({(s#RTGou8Md^Ti>c-KaN($Nuuq zMG`rRo;yX*=k%bd>4`U6BCBpPx9y$UUYfL-89hW(9D~w86x0<93kwqy6BhX50#51F z6A=-Sl#~=m!3(JRN-4X8#ycb#TGXDNp3c^IOv}uSGn<^4D3v`pQ|}Q(KexWlXZxM& zMo>UCfkjNlN_2r(Q?wSv)?+>fhL^o&{Jgvd#P<_U|6F)UNl77^j&~Pe&9_(nZsVh) zM0j}qHM`dLnV3F(`ZQT#eyfp$jjbd<|Gw{IWyafNWMt0#G&E4?v5pQi2M6{C55lQm z5Qo!!MJz2Y7V9;|yoZCj^g-hO&m&pfe&PB0eZH zBK)PI?p{GKv#?x2xVpMpT3X`VxP~3FMMqC>W@J?Eyr$yk=T{hZMxh|U=$nNmz_mvOVqeoSrKOgPxl5yNoQW8;U%wvcz70KNBPGuV?E)j}>frF?f{>7K>ihS5_wF&?eqB&t zZEnu+hdFF>baIl6kPr#$yq9+pLco6IO{G-ur)Rlp>gvX~Xxa4|y&psG)YHLvY;4<| zRDKj3^q+I73y>VGqd&_{yET}JT_pm`joPvF_4N@={lb?N1O!eed!`4@zm}FlPIjyT z64tl2-b6)pqWARnZmzA(Z|SP24E6RF!K_wQxfmEwKYH{VDmO823y6|^!lAo^wqqIf zeEaR&w@?)lHoZ3T{r&y$@bI*>v|UM6)lq+ce?hN92Z7f=L#LkQjpDzZw|c6k#?8y? zK3=TL#KZ)E3Xl~L5CE{N{n^g6Ok-*ECccHVatPFt&gz5iSVcrj@ zBPA(0Ha_m=?0k=bVf%Yk`0OJr&y(5V;kcNXhrGOBoR(w@yPBJ6SXd&@ly@0uo?q4Y zjvTFvh>(B&JU$~sUtC-qTGrlvJB{CMtVG}MXImJoq7(1-bj>q8Jt2O6udk&P=`F=? zlp~rd?39%H_gDJSZ``&jr3^bOD?Xo7uJxRcA6*u|#+0D` z)YjCz%fv*KzF6s7U0qE|BGuLX!SpQW9v$6}Iyd{SSULeOb!Fuz8Cg)IiHQkm85u(b z>+xb(>aLz1ioR8}nkY&9`&XDZ=NCHyva=V0&~L$rK!YX3#|H)lwYIk2qU3Aal=-N_ zrdQ9qSS6&Sl%*!c$cTnnr2QEek62igIxuJ~0)O>pV^nDL^*jj-O@FQ6f9)LiRPvfM zyrn)ro4s829q1kAy+zgfM~ z$zL!YrY0t-d@iyR81M1KV`iAtx&Tf6>&)ZI6!JLmt`zGV|u!ttSlBHGcV6#@V!Lm8_KwZghw14 zr@zPb6WR3dQc_+VZfYMm+gMt5*`gs#%*^`UalTZ{B_|^zx_#Rqi5 zyETZW|4dg;uNZ1R*K`F<s5)c#?7E(}Bt~sB+Wzk;l&&Wtl#zKHl!NA2;Q&ui5EgcvbI6mG* zBB)_wW3z`jqM@N7WKh&8H4u@J!IXO9TVn`4QlwGV(%dYfsMy!uZaUu*Vqqz-uRmL5 zJ-*zRwz0i!Z*H!xr^h-XUZhjQAuNo_&Fvf*aM)k&oeqnMq-o>{3|?Gb{O` z>eK|ZY=hSkba!=G8NR;kS2msqx9u4~ci4=Gf#Q04gw*6)6uE_@?WI(#(iqR~wmjl^0l9C-4 zXGc?0Qz4Ys)Bhz}TwGnXG&FD+`Z9X;#lxT9SCx=3{T9!(J=1WuoMMlMHm@g)6*4q4 z)AzLTo2?GY*9T;VtgNh?+Yx9gSvfgdTU!s;T9d9=Kv%dn%IB;ag+kTV@=;Sa0hI`P z8^xR~g+2zEH&gRs1yq*BQc7T;sE5Z%1R2ofZf8V9#L@OFIVq{lk6NNjw)(&(19l^0 zV+DEnYP%n`4)ZPQC3@GdU&kaetfcw!mSW$FL{oF}fqJonjl;Px0-hlJiP3^D z`|MdoW#w&=Xjnd%jWM6yc9PiGSWu*1M_Zd48w;;`IC<)?1yX}X2GJ1@LUDXNDk^G) zR2Lxomhid%R{KqqS0aE0EC&c{f}R}QJ-Lb9L;f>JY_y-7qB1`W1yI9~aG?;xLu zG;bTHwde=X%#0Ef5oIZn(V(55SG;cYO{qLESIvC1J~BQ|$d6|^I5FWa9(Q6rG$psO znP6cV^G@JoSYt)hie54Gl`kQ!@T-}+Cus9M@6hMxqqw+k%gIGWxUgpM?07nAP-DcV zo>L%TiuCmKc*fSeXP&U&hG+QwQ4$m5M?BF<_1vE6H%{wYxjFK)R9b|jKm#GuD%Wo^->-=zu*t73zf z`WGj4jJt4HM&@JzEwaS~7upEbdQV&$~?MKReqk{@E!u!Wt=_ z)!0aR`MQ0Acc%^0ORjq@NkTzEL}hRP%r~j*dS4==d}`iT!>4LF)>gg`>ATKN{Z}mh z7rp(5=ltO<`F9+qt)VwTVo3@X6&0PGon1;NN~Um_z6KRLUGt*Mq@|^0Xn0sDT_9|;rEL6* zjmiPmw#`J2L%N|r-JyOU@R;uB4N>TK3ILq+yVe(-j}+zxQK>m z`nL%UeC4Fm^X(fSSm@>6l;Ppw?Dy|MN&!HV;dFqP0D5k1X&IOuI=wiW9UdCOy(=J{ zJ&2KvKoAiToq-Z4HE0HbVn5qxYi#^tZ?OxkbYUkD-_r8m4P+aOM(Nzw803#1e&?Bj zDZQ+WjLNF2z1`glUkQI~fb`7D%A%vAb98j1RT#v}3YGUq+Jblu zQAqiRl52tYUlTn5IhCEAUE`Jb_N}Xn%jVWr@uyEBEa0Q%>4&?!H$bb()5m#{V1>Ld zDuN|=rlocNm%(++MsZs5@IKkw zMqQ@28{H&}%*a(P;FJ#@Gt$%~OX=;%=z~-sHZJZdcADZW$nwzwAcKbQhqzWIt#)DF~+ zNk|X=))yB_3QQ0Y6$LrPQj%x70;m8W4-O8Fz=N6baS{@e+}vCq@JI+mcst}1>^wX` z4_q7^o_mX!N30luBO@b_a**G-W7Gk1A$h^V&aNZ*u8{W^NEps<{1ZGVdWq+il#CAy zJYjR%v9PoRN18SD{QmEa5>%tdKE1EM!2Al+$T|*T*0yfwxvnaG+$6~Sk18AM>tVchvhg3Pl_US|Dq^C}jcu8lmDTspxyM1&m4-Hvgfi!~p`9HE z`Zy+5);FF;UR__mCM6}=%+!-%J8exre&a>*Q)CyL&fqGA<>e<3jPqO4>ouNle8YG-SE0XP9dmpJ_Qu##{Z zuOsadij%V@rV_EQ^ry`rrvYcMbv$5|`xISOCa&1NOcB{U}QQWe76 zaL20SYZZxK3FqeK_B#Akx z^I#D}3@55c+P|i`wJY)(Xk(Zu0k6ZJuCBFiHWWxB0#5;lqa(Jz!vgQcJ*MjgD4jW+D)!z;-H8;>4-WK?`7x(jVO(lV=i`N^F0TgNXhI$i%Kw< zTZOzg7{B879XUQQY8{0(lj<+h(Su}=<3GB#clrjg-gjdGC0^g zjDc|9UseDID6DpGL0?Uy z{QSVy!Vd!j%8-~vM@J_-P_M44@;Tf5OwMid1-Kf7#KrkJ#6Ez_ulRp55-dz&3+?CS zF&0WOV+h^+`ELF(1aY;7t)XCYA@?;mHLa?y-iu)Vjx&d@{q!k59v;jtGM-eg!E@>7 zPXcoC2ZgU{$O1Mb0`HekPwOC&$OD9>scFKycP9WTV9CR#z)1F*Re<6V`KUrA;BEk1 zPmF^2;>JZvN2>{kpr9ZSH`v#L!oumv$xpetK)|8Z`JX=hJ=-`DXbTh>SpTbkBgKmH za!`Ws)3Hlig|yB3$R`1>W)2eXA@{zB>T2$z0iYd_e&DtM2EcYh&lKh6t}HAB5%py6 zbVs`10RP=#!0zPa1WWpWf#I|3=J)N!GsT^!2m~>+hQpup6L`A-_3cmNAMfjXgM8Rb zc7=uDd5q8bv13ax=7f}s%Wp{Nii=t8va75ADZ-MCt!+E%$BOT8NnYNohU=32rtGAU zTZ4936-nmr0xkubI!ArzNf%7XM5ap^oqNJVQ>1fd!`cXP-M)71+5yoHB$l*DB_@#?XPIDLWTr&n zYdCD0G&nx44vDsm47|?3;smT)Ut5!rm31P&Vz-`Gg18Ykh z?y@!n9F_y-9l}O{T5N3W=dUzO2F;$x$vt3XWaQ;NhHi(bw7Iz%ZY0*neV0D&WOXnb zA|!Nl^veaROAziI)wWZ?ul*lhJsR})BYFq!-}9!Oy?sV(EWz#DTo8(n6es~2fK@;P;e5FF72$OLsgfk~E$qlfJ8VyE>M z5D?_>pcID3#)zwtz72EDp7*$MA7he2JHY!hDk1Nkg9Dukv)<+)ba>dZR&rv^O0uTd z$ueUp9i8cewP9GLm#MY_5)u;a?d>x&GoT9K&A`N^`YXg=$9@x7MO5!U@74bAj(h#J z#XomNFihGYy@yjfwB0Rs;UTjVZY|pP!VPw*n8bYTNzpj?nl}D-Ec(|jhFo4_EM3{& U7Yo9L*OLet2}SW@QG>w$0Y71QjsO4v literal 0 HcmV?d00001 diff --git a/docs/html/da/dea/DirectedWeightedEdge_8hpp_source.html b/docs/html/da/dea/DirectedWeightedEdge_8hpp_source.html new file mode 100644 index 000000000..d53eaff78 --- /dev/null +++ b/docs/html/da/dea/DirectedWeightedEdge_8hpp_source.html @@ -0,0 +1,196 @@ + + + + + + + +CXXGraph: /github/workspace/include/Edge/DirectedWeightedEdge.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
DirectedWeightedEdge.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 #ifndef __DIRECTEDWEIGHTEDEDGE_H__
+
20 #define __DIRECTEDWEIGHTEDEDGE_H__
+
21 
+
22 #pragma once
+
23 
+
24 #include "DirectedEdge.hpp"
+
25 #include "Weighted.hpp"
+
26 
+
27 namespace CXXGRAPH
+
28 {
+
29  //Foward Declaration
+
30  template <typename T>
+
31  class UndirectedWeightedEdge;
+
32 
+
33  template <typename T>
+
34  class DirectedWeightedEdge;
+
35 
+
36  //ostream operator
+
37  template <typename T>
+
38  std::ostream &operator<<(std::ostream &o, const DirectedWeightedEdge<T> &edge);
+
39 
+
40  template <typename T>
+
41  class DirectedWeightedEdge : public DirectedEdge<T>, public Weighted
+
42  {
+
43  public:
+
44  DirectedWeightedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2, const double weight);
+
45  DirectedWeightedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair, const double weight);
+
46  DirectedWeightedEdge(const DirectedEdge<T> &edge, const double weight);
+
47  DirectedWeightedEdge(const Edge<T> &edge, const double weight);
+
48  DirectedWeightedEdge(const DirectedEdge<T> &edge);
+
49  DirectedWeightedEdge(const Edge<T> &edge);
+
50  DirectedWeightedEdge(const UndirectedWeightedEdge<T> &edge);
+
51  virtual ~DirectedWeightedEdge() = default;
+
52  const std::optional<bool> isWeighted() const override;
+
53  //operator
+
54  explicit operator UndirectedWeightedEdge<T>() const { return UndirectedWeightedEdge<T>(Edge<T>::getId(), Edge<T>::getNodePair(), Weighted::getWeight()); }
+
55 
+
56  friend std::ostream &operator<<<>(std::ostream &os, const DirectedWeightedEdge<T> &edge);
+
57  };
+
58 
+
59  template <typename T>
+
60  DirectedWeightedEdge<T>::DirectedWeightedEdge(const unsigned long id, const Node<T> &node1, const Node<T> &node2, const double weight) : DirectedEdge<T>(id, node1, node2), Weighted(weight)
+
61  {
+
62  }
+
63 
+
64  template <typename T>
+
65  DirectedWeightedEdge<T>::DirectedWeightedEdge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair, const double weight) : DirectedEdge<T>(id, nodepair), Weighted(weight)
+
66  {
+
67  }
+
68 
+
69  template <typename T>
+
70  DirectedWeightedEdge<T>::DirectedWeightedEdge(const DirectedEdge<T> &edge, const double weight) : DirectedEdge<T>(edge), Weighted(weight)
+
71  {
+
72  }
+
73 
+
74  template <typename T>
+
75  DirectedWeightedEdge<T>::DirectedWeightedEdge(const Edge<T> &edge, const double weight) : DirectedEdge<T>(edge), Weighted(weight)
+
76  {
+
77  }
+
78 
+
79  template <typename T>
+
80  DirectedWeightedEdge<T>::DirectedWeightedEdge(const DirectedEdge<T> &edge) : DirectedEdge<T>(edge), Weighted()
+
81  {
+
82  }
+
83 
+
84  template <typename T>
+
85  DirectedWeightedEdge<T>::DirectedWeightedEdge(const Edge<T> &edge) : DirectedEdge<T>(edge), Weighted()
+
86  {
+
87  }
+
88 
+
89  template <typename T>
+
90  DirectedWeightedEdge<T>::DirectedWeightedEdge(const UndirectedWeightedEdge<T> &edge) : DirectedEdge<T>(edge), Weighted(edge.getWeight())
+
91  {
+
92  }
+
93 
+
94  template <typename T>
+
95  const std::optional<bool> DirectedWeightedEdge<T>::isWeighted() const
+
96  {
+
97  return true;
+
98  }
+
99 
+
100  template <typename T>
+
101  std::ostream &operator<<(std::ostream &os, const DirectedWeightedEdge<T> &edge)
+
102  {
+
103  os << "((Node: " << edge.getFrom().getId() << ")) +----- |Edge: #" << edge.getId() << " W:" << edge.getWeight() << "|-----> ((Node: " << edge.getTo().getId() << "))";
+
104  return os;
+
105  }
+
106 
+
107 }
+
108 
+
109 #endif // __DIRECTEDWEIGHTEDEDGE_H__
+
CXXGRAPH::DirectedEdge
Definition: DirectedEdge.hpp:39
+
CXXGRAPH::DirectedWeightedEdge
Definition: DirectedWeightedEdge.hpp:42
+
CXXGRAPH::Edge
Definition: Edge.hpp:40
+
CXXGRAPH::Node
Definition: Node.hpp:35
+
CXXGRAPH::UndirectedWeightedEdge
Definition: UndirectedWeightedEdge.hpp:43
+
CXXGRAPH::Weighted
Definition: Weighted.hpp:28
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/db/d24/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy-members.html b/docs/html/db/d24/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy-members.html new file mode 100644 index 000000000..e733fcb36 --- /dev/null +++ b/docs/html/db/d24/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy-members.html @@ -0,0 +1,85 @@ + + + + + + + +CXXGraph: Member List + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
CXXGRAPH::PARTITIONING::PartitionStrategy< T > Member List
+
+
+ +

This is the complete list of members for CXXGRAPH::PARTITIONING::PartitionStrategy< T >, including all inherited members.

+ + +
performStep(Edge< T > &t, PartitionState< T > &Sstate)=0 (defined in CXXGRAPH::PARTITIONING::PartitionStrategy< T >)CXXGRAPH::PARTITIONING::PartitionStrategy< T >pure virtual
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/db/d3e/classCXXGRAPH_1_1PARTITIONING_1_1Record__inherit__graph.map b/docs/html/db/d3e/classCXXGRAPH_1_1PARTITIONING_1_1Record__inherit__graph.map new file mode 100644 index 000000000..8a3491440 --- /dev/null +++ b/docs/html/db/d3e/classCXXGRAPH_1_1PARTITIONING_1_1Record__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/docs/html/db/d3e/classCXXGRAPH_1_1PARTITIONING_1_1Record__inherit__graph.md5 b/docs/html/db/d3e/classCXXGRAPH_1_1PARTITIONING_1_1Record__inherit__graph.md5 new file mode 100644 index 000000000..c95cbe9dc --- /dev/null +++ b/docs/html/db/d3e/classCXXGRAPH_1_1PARTITIONING_1_1Record__inherit__graph.md5 @@ -0,0 +1 @@ +a0580315b1b8ceb654d089cd05b31579 \ No newline at end of file diff --git a/docs/html/db/d3e/classCXXGRAPH_1_1PARTITIONING_1_1Record__inherit__graph.png b/docs/html/db/d3e/classCXXGRAPH_1_1PARTITIONING_1_1Record__inherit__graph.png new file mode 100644 index 0000000000000000000000000000000000000000..3fc8b94c89a19242efd1d509068101c4a11dc7e4 GIT binary patch literal 6808 zcmcIpcRbZ$+y4<+5kmH!M@IGxWzVu_vaN@8x;k z^}O%<@B8z?`J8h;zjNQ$eO=#mqVB3I;Nw!_A_#)7q$sNi|G&U*EH*m)RT{Clc;T|S zih?Y1e)03Nr7#&mDAkl?Wwd>suV?#8U(=)QF~znfCg2EV$JV@xqGf*)9r-IXI6Bor z?uR+2A!dnYZJFo2x54I#7DQEdf0K#MC#Vn-k#yd}Pb-VI;lQmeD#8wZEZuwaq{pMs zf}6PO)t5g<_B&I~ftx1}TP-W-D2PMp5p)LJh9NTK$Q}(Ji-E*O1pAeArwq0n?RiMY z16g_bxMw82^_J7E0V>aKblhsSs;{f7D=RBo7)ZNTfy;M`gNNt*Wcr+Y#D!fUo|Z+O z$kN!t-k$Rd`rs`6WAuNyW0zc*fVQ@FUVeV<+qZX%wY9W{v&FqvmY2VM|4t*~LeI_Z z^x-LmjlQa?YCyo>u^MaV=~k`^mHYQ;kuRg8J{vz9K75cTjuLPjf2)=yWME+MDp6fs z{nDjNZ3C%kIYN$^@$rM9n0UN56B83LF)@4MXgYO?^i}TM>HP5F!;c?&N=i8ExcK;j zf`Z+l!cISz=jNC;c8qVMI520dawL3rb`}QE?~qeco*mA`V_l_vek(WSx(RYTv;nOjzICj2C+3>uaE||8hX;?2su? z&ej}3NJ&Z0PnV?1%gVlf{kpTWBjogxoQ5VlF);))B`s~b(NiT8M>&$(ZL|0B$A~!> z5$n&-w|94qsx6~lzkUs!(AFju(_K*RCGzE?wujKfil4J3H&-Z&Mp+`D&w zVyT2hsN=R!%*1`Yy}e^&4Rv+8BYn!rc8X|>R&C-ALgI{!<`Z>}6%`eBc6P9HAt50+ z3Q@lU2R}b?N(*P_^Ua|1tbqlB3^n6CRX+tvOCjTc0Lh%e9=d?}`S~{!7pwL=SW{BG zxRy6JVXvHItQD(EIYCa&&fcD$-SO2FlMn+%?W_OR0xVq=I z^D(%497T9 zX25U#83S=?_}SmDY-D7_!oq@w7qheDHmgI3VQXv4!OqUh&)-S;XJgVnX0AKty1w4M zdqbIm_FH(wno3O4`UjC)^L@!2S_Lncn0>C`<4=r_f3f1rI9*6HWo2WVV`C?FP2^jr zu}wI7ZPpvAM(|{KYD%3o8Q!+|DNES$M|*p4W+o-s-0JEHjDg3I)cMiiTiam-@%yvU zjZQ*BqMj`lE=DW4F716@Z8h*ZHx~{vG!&gOs$A~X-LmrXcMfBrEK$+X#Pv1_5*)6@ zc_j4oCoPO@Y)_=B2eX6+KYU2qIS zA0`HdtgP$}!?%hmDk^Si&z|WT8Bsmk`k29wAQ&>bmG@)IBagy5XY&dR=|tU_B_*?E z8HaxFO-$y@{SXH3c2RGCmUC(o(3Av}x6YrcY{*Y|3v$KncinjP4RTmaM8CW>m8`kLP=-4~2vFsyu#j5=ivWLD^ ztzhTD&(H7cd(_-4;XgOo{C-y zLqkKUsi_V^O-)VWqM{8|Rj&Ih-z8{yZru0?W$Nm}KxUSf^h`~I_E&U};K$sao}SLm zn?*%MaLc$j0@h>$z*QO=u8n3i$s;Oq@}lBm=Wyp$iq8Qe z*49gseh18KY~teL&XbM%Q!Rc(L_}JJ>XJcc{(5>p;%LObyirPK4LJT?2;~p_dtCdN z+at*|=&z@%>-I&XH!?^I3nUPRt#)5kRFzPm$JCS8Hl(cQroaHi@QmB~N~z zu!tg+V?|3}^B!Vt2Lx~XdoYnD?EJ{b$NzM@2PUJ*dvmJUx5g#!`E%;C$C~IDbmjllSF$_V$Im)PBNG#v zaeX7Brht=!@1=Us!?}rnHmCpW@2jb*dU$xOt*$ot?k-yA1T4{YCnmluMFWjmRfg^)cH6A>Y~e*GKC4?;o|DrQBu%@ zHaF(NSQ>V}+2@|FZp8U{7yvY&Jb267Qu6_%SkaaZZIffrike6ckFV$!#YaO|$vOH8<4>ijz9@ zu+-9dJNo*f;w*L-KV@cSz89=AG&CHQ!a|Voi3zF0nM(+w`$fq0R~NLuIojY0$vafB zv9b1ccEC%I{QRcnya47cESQq}jO$%yo92(Sw$pg2+jX$GOk10Qd>b1nxmNXS9;&IR z3`CQ1mXwxKT=_6F^FT)@H8+!5UL@+vFo2no0T{+X^cZM!8T((uRUjhOG{f^^9y8QGIch_r3-xdI)|NV+uhrNLQC zR-VfHG9hIzr9Xcvr*q`8xN0LZCQZo9SsK?l>nhUx@uQ)Se*!5ySyb*AaCZ79=jWrN z9W|55%3PH78X7(u)$%rpiSAwcrG<{%5(nwdJ|t~m@KgDcOJJMGf{Tx+=(~F3v*i*> zBX~(#PEJc>(5Q`lbeR9H!O?)tZ;F_Ur=2#qe2?DMrH7((2LB~{o0&$UV5?jq*SK`tWDjF%br zpPI~c`W3^muCD)`i%^u7CO~FJtEBGx7L=5f6)VwTT3N(ypH46`MHaA!;l zwmOzMC`;S#pf1kof7pfp>nQ*K-_ma+rFaNJ2`D7)S;|dWP!|Y2Kfn9i@TX|tdiM7A z&JLf>fFvcCG_%0rGssrerE?^;2z&bUN^_6w={)N6yJ@eY3?ojf4f5iDHe^39ep+^R zi_H)tDQPN@pX1N^?d`c9BseLF7zDuavDE#fwWTFt5ZN6aGB_s73YWuXmzRqQ3JPAm zGIMk^xqCNQ4*2Ek`8`cd!+IBnZ1tX)?Sli>M8%_{qeJ;qLoqQi7>~by|LW@*7*O0A z{qlvElT+oVB}-nCCUXDaV0}XAHfSX*FM z87sfLwbia-*cKSz<0I1ebdX7uSn;PgACtck21RsU93`uzd-G9~x{CTwDA>b04fU{kA4nSwxPhh%*>!5_kBiisTq!>O|JLm3nl zmf&R55#lHh5Je7?@lt2xtKCb9)EvH>ikGn`$r8t0fb{^TGcq#t@zMqWY~;N4t*r~| z>JEMn7d9Agybs4~J6_?up=x|RXD~<7&r4AeJ1}Ll^~7oMW5(!W`$<^0IU3SGFfbGk z3Vmf|g@S?t{0ZDuKfT@X)vH%f9>ylZVtlse%8$^{s}sG2j7?3avFQ8>DJY^gxi~qK z)6#ut)-1qOhJi$o3efxH8tOiRe`rSKkEv;k`d}iXP+pk^@z`|C4RC;@P zEpGe3Qi)UC8;osP6?2D(iHW!HlC+d~5T29C256I+nVIXR{vpoBt^N%S4WeF`f`F{R zwH=1#{+FHkyEDK8sPE=xuD7?f^`@@w>|nw<=x`PbI-Q{j3IVjLt)r7qk=XN*a(F*`f^_3K|5{MK8skT1X#fuZOU zhM)%n6LWp6Mq$P&j`u(9j5bQ}#tjD$hoYjQ09-UQG+;EYT($snZ_NE;V89*(iLS0L z5&{g!`QL(&y}pDZ|0Z;57@4it2-uqQa!IzZlkb1)9Wh_7mjEpT21tuwE`YPCsT8;{FnZzP;TW7mAHIFl&NRv;emP_VpR=*C(F(zWVlkz4vv()X zPlZ(DNo`|ehkvMJJ2SI;1_n`=v4wSYbhz#}A1)8&YNKik3kzSqd~mQfhC-nr7lcMa zg27LcO6I*zym|BH`1m-0B=~Qe&tJaWg(_QFEf~~1T$rCnkhQfnkhTyS<)o)$BlX~@ zUdzP*Tz&fZk(cHDr6>%}JH#1zWn~T>p_nANR^TT`!+w~3yho0cB>Q!8lFO=ZL@|^n zGokv|ACt)FXg-*VvF~5M-p<$LF|OYNH`~=E3)&UvHPXS7mmC~CxYEG0Q(t%YnxrI6 zH#ax%(fSLCL}ztvuiZ(js^t=+9;7q_xUU#hVSX&Ht2@^y*&v@$*SmcBH2+F*_=+L zBBw{kd&P-~LZTB2xub+IFaCk1FzE>yV<1?cw%%;{jF0hM9<@!~( z_4I^!dGG4?&Gp1XCR4@P^y}BJo_IPHaz#suq+ZZHj!^Sg0@vu=;$TJrqrEqNDygVI zG6>NxE^w}U;>T~rTJdyJXIrzK0It4%emsy>ja;d|{dSgFTUafFFTb{y)ZW3-FtTHXca+VPqerEBQYf&?I}KxokexS=L2@!6cE_^VHyO9N%I>;Xy*$Cn`Su{r1z!Y z^14_LI3$QWvf2$hvvMIR&d*-}SB#5?2QbNXL;ex8yVF$j*zjz*X?!& zQkjJMdJ#3XPit!qWHI{?nSg1ej6Im?2m@1pulO4b1H@%}+665wCYDTL9lX4}(lxbp zbtOebc?AWnzPqdp3?Ztlc+{FziWo8gb$0glAaG!TkQ!uVW&*VXS;E=~F>VS9!U)Z8 z`$(Oi)-*OA!&VO6S{=(IATP?;h_lX#e3dkI z5@le!t;I+$$wzxO@clzFo5sP;PNV1QvtE4ejRY}X-h}7Rn>~JOy1Vbfe4Pd%u_VEV z?joqvM+a*Lr|6;dFa_ZM?`mphinu}`$z-SyO|J;CXtVEbk#3bvS0e|U!44l6N-*Bz4@e)F1T4rmRx 
The documentation for this class was generated from the following file: diff --git a/docs/html/db/d5b/classCXXGRAPH_1_1PARTITIONING_1_1Globals.html b/docs/html/db/d5b/classCXXGRAPH_1_1PARTITIONING_1_1Globals.html new file mode 100644 index 000000000..8fef92d22 --- /dev/null +++ b/docs/html/db/d5b/classCXXGRAPH_1_1PARTITIONING_1_1Globals.html @@ -0,0 +1,119 @@ + + + + + + + +CXXGraph: CXXGRAPH::PARTITIONING::Globals Class Reference + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Public Member Functions | +Public Attributes | +List of all members
+
+
CXXGRAPH::PARTITIONING::Globals Class Reference
+
+
+ + + + + + +

+Public Member Functions

+ Globals (int numberOfPartiton, double lambda=1, PartitionAlgorithm algorithm=PartitionAlgorithm::HDRF_ALG, unsigned int threads=std::thread::hardware_concurrency())
 
+void print ()
 
+ + + + + + + + + + + + + +

+Public Attributes

+const int SLEEP_LIMIT = 1024
 
+const int PLACES = 4
 
+int numberOfPartition
 
+PartitionAlgorithm partitionStategy
 
+double lambda
 
+unsigned int threads
 
+
The documentation for this class was generated from the following file:
    +
  • /github/workspace/include/Partitioning/Utility/Globals.hpp
    • +
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/dc/d4d/Partition_8hpp_source.html b/docs/html/dc/d4d/Partition_8hpp_source.html new file mode 100644 index 000000000..dbbc9fb9e --- /dev/null +++ b/docs/html/dc/d4d/Partition_8hpp_source.html @@ -0,0 +1,348 @@ + + + + + + + +CXXGraph: /github/workspace/include/Partitioning/Partition.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Partition.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __PARTITION_H__
+
21 #define __PARTITION_H__
+
22 
+
23 #pragma once
+
24 
+
25 #include <list>
+
26 
+
27 #include "Utility/Typedef.hpp"
+
28 #include "PartitioningStats.hpp"
+
29 
+
30 namespace CXXGRAPH
+
31 {
+
32  template <typename T>
+
33  class Graph;
+
34  namespace PARTITIONING
+
35  {
+
36  template <typename T>
+
37  class Partition : public Graph<T>
+
38  {
+
39  public:
+
40  Partition();
+
41  Partition(unsigned int partitionId);
+
42  Partition(const std::list<const Edge<T> *> &edgeSet);
+
43  Partition(unsigned int partitionId, const std::list<const Edge<T> *> &edgeSet);
+
44  ~Partition() = default;
+
50  unsigned int getPartitionId() const;
+
56  void setPartitionId(unsigned int partitionId);
+
57 
+
58  private:
+
59  unsigned int partitionId;
+
60  };
+
61 
+
69  template <typename T>
+
70  static PartitioningStats getPartitionStats(const PartitionMap<T> &partitionMap);
+
71 
+
79  template <typename T>
+
80  static unsigned int getMaxEdgesLoad(const PartitionMap<T> &partitionMap);
+
81 
+
89  template <typename T>
+
90  static unsigned int getMinEdgesLoad(const PartitionMap<T> &partitionMap);
+
91 
+
99  template <typename T>
+
100  static unsigned int getMaxNodesLoad(const PartitionMap<T> &partitionMap);
+
101 
+
109  template <typename T>
+
110  static unsigned int getMinNodesLoad(const PartitionMap<T> &partitionMap);
+
111 
+
119  template <typename T>
+
120  static unsigned int getNumberOfEdges(const PartitionMap<T> &partitionMap);
+
121 
+
129  template <typename T>
+
130  static unsigned int getNumberOfNodes(const PartitionMap<T> &partitionMap);
+
131 
+
139  template <typename T>
+
140  static unsigned int getNumberOfReplicatedEdges(const PartitionMap<T> &partitionMap);
+
141 
+
149  template <typename T>
+
150  static unsigned int getNumberOfReplicatedNodes(const PartitionMap<T> &partitionMap);
+
151 
+
152  template <typename T>
+
153  Partition<T>::Partition() : Graph<T>()
+
154  {
+
155  partitionId = 0;
+
156  }
+
157 
+
158  template <typename T>
+
159  Partition<T>::Partition(unsigned int partitionId) : Graph<T>()
+
160  {
+
161  this->partitionId = partitionId;
+
162  }
+
163 
+
164  template <typename T>
+
165  Partition<T>::Partition(const std::list<const Edge<T> *> &edgeSet) : Graph<T>(edgeSet)
+
166  {
+
167  partitionId = 0;
+
168  }
+
169 
+
170  template <typename T>
+
171  Partition<T>::Partition(unsigned int partitionId, const std::list<const Edge<T> *> &edgeSet) : Graph<T>(edgeSet)
+
172  {
+
173  this->partitionId = partitionId;
+
174  }
+
175 
+
176  template <typename T>
+
177  unsigned int Partition<T>::getPartitionId() const
+
178  {
+
179  return partitionId;
+
180  }
+
181 
+
182  template <typename T>
+
183  void Partition<T>::setPartitionId(unsigned int partitionId)
+
184  {
+
185  this->partitionId = partitionId;
+
186  }
+
187 
+
188  template <typename T>
+
189  PartitioningStats getPartitionStats(const PartitionMap<T> &partitionMap)
+
190  {
+
191  PartitioningStats result;
+
192  result.numberOfPartitions = partitionMap.size();
+
193  result.numberOfNodes = getNumberOfNodes(partitionMap);
+
194  result.numberOfEdges = getNumberOfEdges(partitionMap);
+
195  result.replicatedNodesCount = getNumberOfReplicatedNodes(partitionMap);
+
196  result.replicatedEdgesCount = getNumberOfReplicatedEdges(partitionMap);
+
197  result.maxEdgesLoad = getMaxEdgesLoad(partitionMap);
+
198  result.minEdgesLoad = getMinEdgesLoad(partitionMap);
+
199  result.maxNodesLoad = getMaxNodesLoad(partitionMap);
+
200  result.minNodesLoad = getMinNodesLoad(partitionMap);
+
201  result.edgesReplicationFactor = (double)result.replicatedEdgesCount / result.numberOfEdges;
+
202  result.nodesReplicationFactor = (double)result.replicatedNodesCount / result.numberOfNodes;
+
203  result.balanceEdgesFactor = (double)(result.maxEdgesLoad - result.minEdgesLoad) / (result.maxEdgesLoad);
+
204  result.balanceNodesFactor = (double)(result.maxNodesLoad - result.minNodesLoad) / (result.maxNodesLoad);
+
205  return result;
+
206  }
+
207 
+
208  template <typename T>
+
209  unsigned int getMaxEdgesLoad(const PartitionMap<T> &partitionMap)
+
210  {
+
211  unsigned int maxLoad = 0;
+
212  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
+
213  {
+
214  if (it->second->getEdgeSet().size() > maxLoad)
+
215  {
+
216  maxLoad = it->second->getEdgeSet().size();
+
217  }
+
218  }
+
219  return maxLoad;
+
220  }
+
221 
+
222  template <typename T>
+
223  unsigned int getMinEdgesLoad(const PartitionMap<T> &partitionMap)
+
224  {
+
225  unsigned int minLoad = std::numeric_limits<unsigned int>::max();
+
226  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
+
227  {
+
228  if (it->second->getEdgeSet().size() < minLoad)
+
229  {
+
230  minLoad = it->second->getEdgeSet().size();
+
231  }
+
232  }
+
233  return minLoad;
+
234  }
+
235 
+
236  template <typename T>
+
237  unsigned int getMaxNodesLoad(const PartitionMap<T> &partitionMap)
+
238  {
+
239  unsigned int maxLoad = 0;
+
240  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
+
241  {
+
242  if (it->second->getNodeSet().size() > maxLoad)
+
243  {
+
244  maxLoad = it->second->getNodeSet().size();
+
245  }
+
246  }
+
247  return maxLoad;
+
248  }
+
249 
+
250  template <typename T>
+
251  unsigned int getMinNodesLoad(const PartitionMap<T> &partitionMap)
+
252  {
+
253  unsigned int minLoad = std::numeric_limits<unsigned int>::max();
+
254  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
+
255  {
+
256  if (it->second->getNodeSet().size() < minLoad)
+
257  {
+
258  minLoad = it->second->getNodeSet().size();
+
259  }
+
260  }
+
261  return minLoad;
+
262  }
+
263 
+
264  template <typename T>
+
265  unsigned int getNumberOfEdges(const PartitionMap<T> &partitionMap)
+
266  {
+
267  unsigned int numberOfEdges = 0;
+
268  std::list<const Edge<T> *> edgeSet;
+
269 
+
270  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
+
271  {
+
272  const std::list<const Edge<T> *> partitionEdgeSet = it->second->getEdgeSet();
+
273  for (auto it2 = partitionEdgeSet.begin(); it2 != partitionEdgeSet.end(); ++it2)
+
274  {
+
275  if (std::find_if(edgeSet.begin(), edgeSet.end(), [it2](const Edge<T> *edge)
+
276  { return (*(*it2) == *edge); }) == edgeSet.end())
+
277  {
+
278  edgeSet.push_back(*it2);
+
279  }
+
280  }
+
281  }
+
282 
+
283  return edgeSet.size();
+
284  }
+
285 
+
286  template <typename T>
+
287  unsigned int getNumberOfNodes(const PartitionMap<T> &partitionMap)
+
288  {
+
289  unsigned int numberOfNodes = 0;
+
290  std::list<const Node<T> *> nodeSet;
+
291 
+
292  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
+
293  {
+
294  const std::list<const Node<T> *> partitionNodeSet = it->second->getNodeSet();
+
295  for (auto it2 = partitionNodeSet.begin(); it2 != partitionNodeSet.end(); ++it2)
+
296  {
+
297  if (std::find_if(nodeSet.begin(), nodeSet.end(), [it2](const Node<T> *node)
+
298  { return (*(*it2) == *node); }) == nodeSet.end())
+
299  {
+
300  nodeSet.push_back(*it2);
+
301  }
+
302  }
+
303  }
+
304 
+
305  return nodeSet.size();
+
306  }
+
307 
+
308  template <typename T>
+
309  unsigned int getNumberOfReplicatedEdges(const PartitionMap<T> &partitionMap)
+
310  {
+
311 
+
312  unsigned int numberOfEdges = 0;
+
313  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
+
314  {
+
315  numberOfEdges += it->second->getEdgeSet().size();
+
316  }
+
317  return numberOfEdges;
+
318  }
+
319 
+
320  template <typename T>
+
321  unsigned int getNumberOfReplicatedNodes(const PartitionMap<T> &partitionMap)
+
322  {
+
323  unsigned int numberOfNodes = 0;
+
324  for (auto it = partitionMap.begin(); it != partitionMap.end(); ++it)
+
325  {
+
326  numberOfNodes += it->second->getNodeSet().size();
+
327  }
+
328  return numberOfNodes;
+
329  }
+
330  }
+
331 
+
332 }
+
333 
+
334 #endif // __PARTITION_H__
+
CXXGRAPH::Edge
Definition: Edge.hpp:40
+
CXXGRAPH::Graph
Class that implement the Graph. ( This class is not Thread Safe )
Definition: Graph.hpp:76
+
CXXGRAPH::PARTITIONING::Partition
Definition: Partition.hpp:38
+
CXXGRAPH::PARTITIONING::Partition::setPartitionId
void setPartitionId(unsigned int partitionId)
Set the Partition ID.
Definition: Partition.hpp:183
+
CXXGRAPH::PARTITIONING::Partition::getPartitionId
unsigned int getPartitionId() const
Get the Partition ID.
Definition: Partition.hpp:177
+
CXXGRAPH::PARTITIONING::PartitioningStats
Definition: PartitioningStats.hpp:30
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/dc/d50/PartitionState_8hpp_source.html b/docs/html/dc/d50/PartitionState_8hpp_source.html new file mode 100644 index 000000000..75453dcb0 --- /dev/null +++ b/docs/html/dc/d50/PartitionState_8hpp_source.html @@ -0,0 +1,130 @@ + + + + + + + +CXXGraph: /github/workspace/include/Partitioning/PartitionState.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
PartitionState.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __CXXGRAPH_PARTITIONING_PARTITIONSTATE_H__
+
21 #define __CXXGRAPH_PARTITIONING_PARTITIONSTATE_H__
+
22 
+
23 #pragma once
+
24 
+
25 namespace CXXGRAPH
+
26 {
+
27  namespace PARTITIONING
+
28  {
+
29  template <typename T>
+
30  class PartitionState
+
31  {
+
32  public:
+
33  virtual Record<T> &getRecord(int x) = 0;
+
34  virtual int getMachineLoad(int m) = 0;
+
35  virtual void incrementMachineLoad(int m, Edge<T> e) = 0;
+
36  virtual int getMinLoad() = 0;
+
37  virtual int getMaxLoad() = 0;
+
38  virtual std::vector<int> getMachines_load() = 0;
+
39  virtual int getTotalReplicas() = 0;
+
40  virtual int getNumVertices() = 0;
+
41  virtual std::set<int> getVertexIds() = 0;
+
42  };
+
43  }
+
44 }
+
45 
+
46 #endif // __CXXGRAPH_PARTITIONING_PARTITIONSTATE_H__
+
CXXGRAPH::Edge
Definition: Edge.hpp:40
+
CXXGRAPH::PARTITIONING::PartitionState
Definition: PartitionState.hpp:31
+
CXXGRAPH::PARTITIONING::Record
Definition: Record.hpp:29
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/dc/d80/classCXXGRAPH_1_1Graph__inherit__graph.map b/docs/html/dc/d80/classCXXGRAPH_1_1Graph__inherit__graph.map index 5bec4ca23..84586ac1c 100644 --- a/docs/html/dc/d80/classCXXGRAPH_1_1Graph__inherit__graph.map +++ b/docs/html/dc/d80/classCXXGRAPH_1_1Graph__inherit__graph.map @@ -1,5 +1,5 @@ - - - + + + diff --git a/docs/html/dc/d80/classCXXGRAPH_1_1Graph__inherit__graph.md5 b/docs/html/dc/d80/classCXXGRAPH_1_1Graph__inherit__graph.md5 index fc7e72389..6d2b9f901 100644 --- a/docs/html/dc/d80/classCXXGRAPH_1_1Graph__inherit__graph.md5 +++ b/docs/html/dc/d80/classCXXGRAPH_1_1Graph__inherit__graph.md5 @@ -1 +1 @@ -d59ee0438a66d339835cabfb40872565 \ No newline at end of file +722f7a680efe8c23ad5ce3f511be826c \ No newline at end of file diff --git a/docs/html/dc/d80/classCXXGRAPH_1_1Graph__inherit__graph.png b/docs/html/dc/d80/classCXXGRAPH_1_1Graph__inherit__graph.png index 7cfeebc99a8c2beb9e07ef274b5a8db7f86799e7..996602c69f7967ad72d0d30f9970cb698b0b7bce 100644 GIT binary patch literal 9738 zcmZvC1yq&M*6mS1x>NelQi1{^9fuMD>5wj^OS+YoZV@G=B$XCKx+O)V5fl-SkPdn4 z{P(^$#y`eWhcdwPeS7b<)?9PVxuYMbD-q(+;voQqbpR`efhR9%i4}?zsG%$Bh*1k-KO2>)I&Z>crSWH)2>=8X9$xBV8C^xFRw_rhnCG#~K{ZjgS>R}{u6h!QtayUr5 z$p5~XoF!^fOIw?ik}}-?=#Q+tJVxN@e*5{!-@M}DNa@RS^1*bz&Z&xrW3B$)%VIA@ zoaAh6If5<@^o?8nbS>%lk1mkD8&iCnb4}z8&hu9zJ7qKYO$2NPC<0D?WON*CZf-u% z(qai1`r$tIMwPm;sVUE8@gqx3WLVhJudxDy4_+00B4so2_4OhVL=1S|-rgmprMR=l zXJ-W(IZ`YeV&dYR!^4DTfd^?_Up2C%zJ$Ymt+r>#hG=$ea*OKN(0$IuXgo}L~KE-tA$ z#=o_kU=nKTNSnd*(7_+~zFb2%&ozd=QO)R>o1-5a8;gpMk7#X`oT@Z=K2fakyo-{S zHfD9znvIi_m7kyJ=g*%8HI`U-`1s*Ym{+fSekG1ADJfZ4Sg7-@EoLkGuE(|Z_V&gn z>sl4kb37?;G-5htXCEHVe10uShjER7M5?F@^_z~JlZ7;)xAW)l%jNZTTzq`|lCm;6 zeSPYMg#|8dZaF_cF~q0NPK=S)lATGcO3WlUBoq{3(d3-@k49d1IH}lo(#X5I3KVJN z5Gg4s)!Ki-%gV~CuCMQbDDIwZx9QUrH#dvf4rPXRbjZzp@YXmEfEfBnFdCbfxGi^J z?fA6VH?%`$SzBZJ`}nUc4Z|!L%%{OifL#4!#UpUeT*C zvKY%(z#$^)c}{)vfw3_GH8pjTCtKYKyl!{9?b5O%4A;_4R8;g+d%LV<3q6sNj~Edm zIVHuy&JMjn9L%fm8f8!JxREtg$G=E%ad96XAM^cRV;z@qv9X1}C$?rANEsRV=}j0! zT@jJQOg*sk#GD*rINhO_cZlU92uSO<7TctWn4}0iJw0O?#HqB4)hV6D#l&bKk+G}@ z;^X5pg&p+j+}76C1aGe_%lF>~L%BosH^?6<&URMI9Xqsk6=7uu=@f15?v@kG0S3 zy}j7>_VzRa<_L)ELnn93*yVp0XQF=lB?h5;$?U3ZJ+6DJDm9nHOj5j_Ie!*fpPRP& zA-TEnAjK8#-zVtk=oqcBQetCgN3yYD!q%?r{7ZdYtp2Lnd)rjPcMo$g<7Q-KCBN8{ zUm+0k<%5l{Q86(cX2BQXaMp}oUS6YLzEFN!jHA2b`fC(9*XmC#?)@i~#>~@s@nc+K zB1!D^+t;jmVoP=NSut~=IG6`3tRepYE{@E&cz9SjIk8*)kJ3xkR8(+{8l3sY7v|>~ zf-ep-c6Q?##7CiS5#Mp;6%?@O?l@C$jKgX$5T{4m#0Z*O);O^EPb<5*`S~oyReN4W z^^Ulzs;W?S+Sapqd3n0(QHiJ-sVm!62~8h9$Qv47cbch{H8#$!j{Epg3J(u2EaAG< z&i+0MU}g+T`u;01N?crAS2wrNm>9gDBRMx)riu#+o;`hf_1Ev;`L(qa#Tq$1dGe9D z02A2Q*yqP931nxQI)~q&L@0661!uqai_~ji8pGyk~`$?`OCtYj*ya(v5cE)y}W{PEw{0;ap1b6ew8WZi@ggZB_-wbw{OecU> z{v;e29CZ74?pto!Y9u^b|HIARkMy?ysnSw{t*zNU=SU~Gv|Uia0qh(c zP#PY=;Q%I)Nd@h#;y!uuq^n-r@PpUZD1^?q`3dg&`nu2Ap;N`FURriG{amvret3BJ zudh{RuUvA3h|!VYGpY@F`<4f?#`VwKT>xViX=$bp-rGH}8v!`+os$4eOw3Q8KNE3q za3ByG8XDHNwk(2zq=-WMf;Vrl^!4?_A|k%;EO+{x?6Cvxx*cvBhJ}Z#v^Z5)$QmM>sy$&6`ydUrWW9W;xl}*=y}4t^vIC{#_d(B_+MmlPQn~ zcoY^HxdPwqgM!!5Nu9>om5+#s*f}~Eahpyh-zsD9{-E-JaA_TBguFDwcs~A4T-SI@KlbA-_~b8 zDss>LQx{5i56|=0RK+dVCYiO*+z<3K0=^y<#mB2?g~qtPykQsgFaL(NrX9YpFl+7O zF-mUkW)hr%o!`1_$LGy$UyapL(;ntI&8`Cx!Adx~%FgbsY2-&NvGDd4~tR+bOGETydIt+=raGq@bX%`t=~V#ZMO} zROXzowER5iPqNG>s80V_+Jn1_@j~ruIo^(k#gA1cQ2o(D*IgDUERJ_%B!XWPBNCrj zdx+9+e!ETF8F8bhs;;Q;JkD<7pZ@oQ^cds9;^MefYnR7%{r^%9!??tVV1$`gC z_^@QHgW_gr!?{&e;Xei$Xa#Pqmm4gHXh=J;O2p|?+Ssu3nmQ8VKd&UDxsD`!4*Pdc z=dF>=k$RPvpKq*&A5rn}5pdNC*_Gso=4S4HN5PMDKV%Q;%2k(r2r!?3yx{N&LzaJ+dtkk`nXy%*=r%DNq)_5{(AyMj`%^o0;n zb905Dy$(*jlj<8w-T&-YPF7aX*u=Zz>k;$M&lh+#HGeY2JV`h-M5xsT9%y}E$}qG2 z;@Yg?=Gt@*P7+Bkd4q??V$a$m;P0?`S5I^2;2_mo{a%a1O@_Wff6leXxTXF=Y1u-4 z!RKz+_|$){L}G+RYV_vHUaC=W@$+{^k%s#0EKyEXzCuuEAl+kiyxK0jh@_;jEgnx( z6>Ip*n_RT{U)tD8bv?!UpsAx1QC(e%C;T@taVCEiMO(4wex;*>Z0GMtG|k;{OeFI2 z=oD3s(Z$i?Wyj*BXwYS#dI67tO{~SAxy7A%ZxI2(b>{k(++57T^euVgIo+Yxl9)Vt zqCzoANMte`Vcd8Mr>{XZGuhWl$)^bkl0QE)7+LvCnLSw9cU0g|+pMX%ew=gpEn!4z zLJ8GHKto&al=};(lqv4-{JpF?a?Z-m0dAa=69rK>%jm8y%-k^!4w>d@PBq$)caszg3d17n91<+f4s}GuvMf3yR9L>6<2*1jiWhc>x9pAg z$P}%SKEGg~eE0e}i3%5d0?D&+eQwTcd3^%9j%a&(UP6n!)?-}UJ2loSLQkFuRoe{S z&&-N3t71VV2`_js6dIbxB5&Oy^zuTEj*ZEMbO5f%M7 z@ZlACehG{r6lfseH6#mPU2R)hzf1O<`r)154oZ8UXgUwK)~fwH>3MmZk-U!F`};ha^NiV6R&hK8y?o;NaCupqq}l1!ddu<_Mn>1RD17FIV7u3JxE z62~4XWhjffP4JNRA%)C5p za~m7p?L_6hKA$d$kn1%LIZadIN8{I08n4U;6WDK3TGWL-6Ejx}K_Uq(YX!J@rC$lh#w5KYzAe1ZZi+ zuvisGyZ4J$&rgD@U6)NuO1O|Lme;Nk5RExHu< zUF~LQA=}OU&2Nn4oDr;|qKp9_WniBiQLySMV7kw{pC5fcKXC-0RH#!OmQhff%o0`- zG!H?FIAsw9210Uqf&fvPcGO+#KbjxT&B9`v8yt+`8;PPFjiXCg{#lO?g^xq{O3wR~ z*)t-U{DjNK=7&M+DVNu#Xk;|`S?A&+DJ`x29?|nYSruGjhp&uKP^GRDe7;Ui!BJDVC& z_f@%@H4^$w0w*Wf?AE!CbV~)SqTVdSp>&kl94CPEVa)=nh{#9 zXe|GtkrmcNaX=yKo*pd*`1qi{@BN50_&CSt@sr?6qI$UJQY6!1=X9ea`fNSc zG*%hNG+lv#XC5EZ88i!B%L&L2<$Gw`(N*{iYFJGM(h?w{10Wj*$Mxwmc{5lJ1r10O zI{$;8|K6GywFQwG)ff6vYI&D%#3(~ozJjoRBpvy3mVb41)e_*A=1ye}`eD=kDR-)$ z*a^+lIfSF%F@3C!ei{KxF_&f^D4tUB=_DpDDMUw40-YX7f_*VC5L&2F1Zr@kjrEmY z=i%aNKU&=Gtg+Hx{w`OiTDZJ>a`pWD?^za%t5#uQq6KPngpkb?2=-#z-{{R(o8JMP zVPPq<8qKZTBZ?NXN=xY7*;%iy&RwZ#Dp;Ky(y3fvg09xyp0fVZ9wUGK_=~od{S`hw z9)TXEpnod9k@B>O1qG~@R#pnHR|alSv0!VwUTyDWCDX5x>KI6~D)mxPr@CoM0P2Nr zWM1{a;Pu8imsN&qcFgE8S4yM5^o6L~cd?ch%h5^`o@~(?%vQg#O)lS>>gte`l$4fE zW)w0&)Ur&bzcjj_nM_XE3e{hV`_?$A&2!^^Ss!PZ5UtMIB&J{w$@Lczngw!s74u~M z{exVBq;j;Bw0DICo0_((tyL(JQ!W7;mC^jj#^#hr4#&>8D_Psfh*nNcZj}_jl)We9 zt^UEMH4k&g?8yE7Eock;+tsv`uPE3%)ysZdwk(QPgTfL@kU@*fiK0d;?dKDc^!RJ?Cn##<| zvi$bWrn;ely0W;mG}?Q60hj4*Sy>0PY|y@Fqyie1H!CYEkAGyCxvut+f+!Tld*&+M z+}xZgU~v^z4du%3=&?C1NI)lY-`Yf8ULF$*t9@*&rsu1AR$##Wa;8JyKXXmfA6tJP zWkpBhIxn}_K$T2cDmULH4Y-&RaQJtAdQ#z9l z${)Pr9n6W*5@x2RpJy6eMxa!#TgA2pU1Y8Q{{3!e$5ju0aC)%O+tSj4no62fWF`@S zm(<%1)7FTBlF{L}{|gyVo|o4SLZHG71tp~*VsrD``;Ij-GP2C{bgJjk(H3xQwvbgU z8#;9i!NI{I=AS}nX9apPLqkKWFNKqAnV9GtbOUW;YreeIzYV*sF;Glk91aKw=z5(| zbOA!bG-pmg2V_;(%$veO0sf3Z(A#)oJ$quWmxB;oUR$d(?Yuc%!z&yeosFA*c zGWycG{mT*)iT8VdeFCJ;Oi{P|zP|$l13stwr8_#H>kx@J&*3mJF&!TtFM&v~^Y<^g zp_0~1)eQb+h@V02<0J!m$Z-%4l4)*&1`cXgc!HIsr2r%y%>U0u)<9R3Eep!X$WZ-K zc}q=A&2hF~Z8O;JXt$;&XnO55IW-kJ!7W~cY8l6G`euPxw{PE0ns9qg#rG6O{OPEB zWGWk9y4_g#K*Z-N3I2D2t*EH@Kr8uNMd0V0v9YnE zWx70|TJrLCHG6KD+uBAznqwe9_#1_KuURuK{zpV&Vqz>KgtS7+Y)GAt zR9bf}(2_O87i0&L1tK1_)&oQf3qd0tB=P|tFEo>N<;#=+~656 z+N*mVBaMN9QEEn~a+WAO_50L#(S9ZYPVqS4W1ok7BvE%5F8R{>`i+Sodn1jhl|m7& zyQKNK&0bqEpb+D73Ql&7j1a?Pqhe#jGBT)NOZc*Azl5`4=HXGbHUllIBN~&IHvbNG zWwrqN?Exq5_p?Pc8~=R_JWG7}5?@zW*Hx5$C{qx_Wub*s+(ge;9KL9;H2DDP3N z)KmoMjq!|<-0xn)e^3_D*VdMA3%UTol9%cOsBWV4L~x*8>4A+5prfPBn8rqfLbZGM zVy2rx?a~?vNG;OvM1t}I@??r{Ym>)X%qyePC-0! zBO@bP?rYtwDy0*&!~{jLyXf$0NL`(9OKa;Dgnp&5?1Kj+K_@?`mrKP#xl1}so|&GW z&aJK{0gc`A3}BDyh2jNLSXda8N@mcZtIXOIK_muMKNbQQ9qR>k%ewo-Q2uP%Kzh?7 z@cp}YP!QZAE(^T%yu!kiXoc$i`}fngU_T&3pFkw?)mGLbra^= zw;g1&N~_R#3-Ftml@$Yma<)_;?a}rkb!kG$;DxX!h-x@EI3bad*Z{dvfa)y)Cu9y& z<+9LQe-6EPwzuaF6D}P;KmYOG;LR(D<>h5jAY3f0tXE{pL_kAUFgItOo0}scB@G1` zjumvxv!m@u_|@e=K$&tCfFknv*auWOh*wN4umu(fM%l&TP2#%fI`^E7hkzP2o*Q}q zGUl+-zTsg7O-)iFdQk)?Cnw0Xw9tX7+~=|Isd6FOw>0>w>|19TId7e~p1v;E?zd}p z*ed!k)jK(qRruyj4P@bzJ)N#vARjlkC1fw}?c4A5X4Acb4`j!RlJz0ytpUw#z_=(k z`QSA)HI@FRxcGL@LYv6x=_&8cn;O=yKyZGqA$1Za>3?{?OoS3v@@Z&z_(fJ0?ZniS zt-8AUW=`-w3+Pvy03We6WeMI=IU}{TwbRf9zD<^De@nfg-F3Qqdf?FW!`;x>*tl-? zB(ZjzkC2e?aHFbC?<835tVFFm?abIP@IHGLltM>&d3k105r?+E{v)u~ctKSxjEji4 z_QCx}OrHlezp**^G~adH?WU~mH~$B??O$cbGf962Et)20Bx71cOf1XJ&JIS{^qN2O zAKrs6@nQzltM`zy)e!XPvoij>Zld(*NlC~6=g--99jD3-%S%e4>>fYHA@0elU)kOs z0sr8k6yk{p`;U85U<0M+**7^kX^_AuISqsgHFJ7= zEa2qiGzCshz1Nlz2MJDC{|#p5ko8}`(BD6t(2)MpxJ|5kVEcX72c%rJpTwp;H2%Ba z!-vk^!ht93`bfMuIzuX`sfP*K9O$i~CQKI3rq?Uq?XLrohIHr#;n;P1K@#)YwePF_ zDQFQto$n!sJK^%)kHJ2mF_0i`J4>=C6v`aTLPQ8QG2_zuL~*0{HY0GLYWpwTK-86w z+q1UL;p=zs3+iU5kSM`P zvAcp%dYqsHLKwzL?(7BIsTTrXsSzTS7g1tRAx}>0|SwVTSoUw%oN!6*V3(ePgff@7q zHDlx4(a~?n{--%POz_T#!>w7X?ifmzS*TS$w9geV2PiBNbWVe?(vQkRAh6z}?*f1( zc~fhMbGSs`2(Us?SsAC&tSufa$b9I8uCA^KD*~|Qo`!~Aff9>=c^Rx=tG(5JP!38D zg1~r-h3Z@eQwJ>A2msw{MDzyOk}P3;@)go)kD*BW#)}73tN~$Ra>O~mxYz|YSYsGi zW!egIVd&28D{=49kAeOOVd}qubpj|Ve^Wo#a(+#mjsZs{Jd$*;g;7Mf{;|3G&PG#PZ)ah@mLP|NTS)CP@mlJ>! z@ML`)3p~j#@5Mmup3EJLoRKvvV2S8VgTjs`q!Td*R(mj&(Ebd&06t=BY6|k=6#$dO zSFZ>mYLF@g3eTwo1O?k`ta?e9m=a)G=$M?O@c21I`qn8$7rH;-BbdI?cRhZZFMSGa z3_KHoEpL=~7xI76w^M{W0}l)gxc>fkg`8_1;Q1whk!d-cCH#1zh!8l2D|po4jpl*% zY0wrV2_{7ZAQS#qK_Q{87)qXMpIu9d;D5$tBA?Ehj@mB&iNp1XaOe5vJV>FaxVUa` zjs;-dv@4V2<4=KRLMZ^##Q>`t+yc46xM$BW(1`>m{iR!#HNW|#cF_GCDt_ZAKzy3( z*Db)y&Xn{QfjCBisfghdob?u-EFdi0JzZmk_Uu5dz2mu1JP;@j{eV%@4-?4SV+V&$ z@MBDxpR|LAikhLlejO<)N&_5#M(FW_ieTyWu4r;m-#xaczyXqyLcs%)Ra2|bn`Juy zK{^+vs7&eLe@bnOr~B*LP8aHGgUYNs%lne2{joha`S{|l)6n#Z$0|k^C4Xfw{2edF zJDjM)qN%BFVQbri5I}4;ECyLYb9)3`Emp8cF_uPi>sAlV^Mr&)W&yic6O)r*tJy*a z)wN~3@dPEErNoAgb#H!?;&YpB)+AAnx!Iv()UYT-j&WbWd!{qAMyYrge@7g42Szvl3@YN`>ULqESEG zV-hGKXu$YI#l-S;-|B(HMm01v8_~L>JHhBVi z58W*yIf|zR1qChg%wf53A!cYoU%*556&k}5oAtjqdEwao5%c`bc1R!hpU*Y_{GTgP|Mds|`%GiR!O?76d8j4nazWmTr`m4h5t|x?^Yw5$W!(p<#e; z^L}^T`>uOfYi2kz`|R`V{nY<=LSHM(65&6>$H2fKl6xhshJk?@4?cf@+ySrJUG5v; z4aZnPRvP2x_Aj$BFBSs>wkjtrp^ix1nXwQjADhIOFUNkM<*qGW2mcX*eIE;3mqa2^ z>vghmh-zzi=1ZPhaY+&h3GuLKawnN+bEyzgjvB@uJ*k(NDeFv47w1;b#NnwUuk?WF{JM=vtxYv;fKb?Aki?D zz@=fMBz&o^9+&wIW2wKb&3LZK%P-2f%@571Tu@lZ{;uYyY0o_g+&i5r+S*B(QeWq3 zd?E`oGifA(F*>2>+O9|MZth@&Fm)SXV5nlB6JXF3{O>I9nkfXU?PlcV$l~Inyu7^k*+TH;=^j*F8Xik3nUj+f8X5{- zvF^0Cw6t_|m@TvgB9w%L>Pt%4Jd+gRFiJ{B>k;qfx)v z8{ckjZQZPi-8}rrU`W++rckrIy82R9w!XgJ!p!U`1H)@Zaxt;y-QC^u!!=!9U0E5K zg~2H?HxvUm_u+i2zbRLe3aRA!&^Or(pX=JBByH>4qoA?zY5^I1h(gtPL_|g94sSRM zig0re_w{WTmNr@2*dW7SP$^4D_}10AdwYAAzBnkho30^!_)uG2o#&rt>+$SM#YSFkZtfWu1N#E*xk3m>QlEYE)#%vRSX-NC>l*@ZsU%!_zq*3$7$Dep(Vp>@$_B>S}g2wkMqj#LtB> zF8mH<_R4PNH7Xt|>_RRzY1gNPqy1Top?dLvz{OFEAd?+MRKU&N1X>vcd zzPdPW@NoEWdr&gs-0}UCfkzjx?pz19J1`JC82OxyZPiJq%e)-d=@S?|J3CvbS=vbf zS4r=C)&TbI>%3(j-5D`IWWwr5H?0S4; z!_naI#hQIUtm`fO_M3VfHl5`%c zd%oh7KiYno{dRP6dZVUhY;0Vk9i*b_=2i=~AR?mA@MLykA}J<@%VkqtN=hn#B)o%( zk#Ya@H19Pd_{Ht=rZjU978Vo$$JD8Fe(t(5+vtHi*->dThM?f$;yMdH9W(Gz$`BQK z`ZTAiijS3*6%K!?t9uE~Muvp}8zmtkZYXJ4*=GU*U{W{@&8L^&tgNgWy|3z;nna&I zT{&3l!X>8qSzi8a$a0#GTEyM?9JSJXeZkDh>A*ovP*POH!o+0VpUi7BTJ%tD@vaFz zFwbqTo*_wb6)fi~1~nI#<09?yS>1mlBTw1c2aC&X#!9+AQ!o7%yE=;X^~JofsEhvc zB_uMkgKT}K-j!7HaJ63wqOGmn(caFHq=<)y*8q2Ae)#aAf`WpptE(OT(9lq0$sE-A z1sW*@ad?rcSN}2k6$7xauTQbzm6X&su)mj~=NA{f-QB<+`$tB2`T56?NGVB4(Jvz3H|2ah60XJ*n86J5_yW?(v8++d%Z%Q>{zrhZ>vpRtJvH#fKI_PCL;@h`g> z!QCDq5}IxUNofUz!m6qV$e+GJh9GrF(+$ndiE(i`w)$Zg6cnJt)ipE<3kz$Byf1gE zA+&_Zx5YXgGhb5dzABnqTW^AOPfJdgry*H)cDJ$F3cJr-!|SF(>+v*y!Ob24cJb`F zF0fHYM@LQ$PgHuPDl;>)<#Cghjm_A|$b#;|DI19-;&(?!M^;wW??iSeAt6}R$NCjK zk9NujMW^aqY(RLctCNRH3%a3}_ml5@!!DU4h^}>7`!%r*AvYl?sqd~b>chlz`qcV~Nh+eK*a`s#9e0@}d9zySWAZStC$p6)X)yR}Lx zn0V->tF3KuwLj&XN5dY`=ajD4n3&tIcBZO9_Q1ixab)J_=XZ5>p8pMk0+`jH>yV$H zuav@9{Nu-upFe+AR=O~7YHDgGCL~lj9)!_6}ll+OaoOG-+zv+0O~P0Y^Jn|_?^)T|RpjIr9%D`~9MV6M@_6@fTA+88DyBLmq;wBZ}hHwY^6Ls@n8>A``3$4OCRV`Fe|7qt%> z2}&dF&5MoaWAJ17j6mzQg5Yinz2mevu+w^1;HgaUVJh1?H6OCRe`lz+9LknK=)-!3CMG8I8r|bvjlL`t8#Jf)o7dOX zfvqUfsRVHVp$;6fKzkliyxLm+XX?S@n z57!0>1i#=BbpD?j9l}IUPjB?Z)7JsxzY6w$wFO_AF)*_6(|xEky$rAz9mj2tHt#FE z4Ej+d3^(wm4ARgjQ`e9~q3CW_bTl=AXTjGQ;auGYOPeY7O{C5cq%^$nHKRLunD6&x zh6jZpVG$v5jt5GOGG8CX$B#L_*wNF|5D{Uot1lEt9pIcC)8gjhy5|fbd)U{Ed)M01 zlARGDnRklY>tjL z;hG>O?ov>&(PklTdZ`vOJ&a8FLNkzI|I_oFhnZQ*#N@qjD`pw!YG?xfgi{>z+o9$1 z60c5lWh|b(QH$v_{pIdL#FbQGJyH~ab&5GjX*QTKrmGw5>dfKcqIw4tWWNXD#hEmX z&Kngu3VFpkyb8+7)}GmSB(YHx;*cz6&0ROQG+GjzZ79P%RVk_K&Pe~Iq~~1Rd*JlS zunZnn8!q)9N2gPyTn^&ixvsFGx+l6U)ZZU3v^`JE5D!nc%kAsZyy4=u?MpcHtni^U zU0A3?;PTTdumsJ4!S?E^StlMcq2e@D!Zq%*!dDJZ{JjZH=D3QgPy@uMDnJ)h>Ex%-%3%LEr6hA zk?=o;*Sls+j8oNnH}cT7>Zzy%rWA7!cC^-`0yU%%8Kv_wSMgi?f^Z=|G-L2{D*WD(WCNd7B-V>vEvDkkRp z(UD$Q7#DR;_&1oonE$Nw*J&}C>v^K_I&R>z9J>Zje?>P<;P8RiC3>i`;sOd z9PBPG3L0`)9(0ZH((?Q}@P}IZh5a;mrt&vF&NMZR;z-Bf-Mf{olrefUftHJ`StM_^_%<;GPXb>JY`!y5FS5TxQr4%o#ZqhxJ_=Z0CJBq8soEt3;n#bsnZ_9rg|LvQ-LDCoap7@~PO z;}e@_8-+GXn>U-#j>i@mtPh-D_yrq{*E$7)qR;77XRa8r75BW2x0Hww8qo}YM2Pf8 zAB^_KN0Wz1>!(vQuv7Vpk2g##PF6PB@>z6*nLJZoc6hPh&x!(<&muH8F8FFv_F~RU z77A@PH_moN*C>?YLO)shqIn$@w?p&4Z5=G>*zY;98}MP_2-?ot(yo7K;Q*FG+D(l& z*Ee^~9}6X3;rf#*h578P9@c)R(^=TM35 zS{q?Py$N`~QZsNF8gHKctj>_iqvqjCUS3DgaqK&)Ko$Ow`eL@8De$zk|2s&Gce!ct zJ>1+xm6es0n{Pk_ss2F0WijBn_`SaqBRx*xb4_};t{9tMF>hgVKLjqao)lCqD(gF-5 z1p_6gahoj$Mw9q9&a||v zN4I$GPxbb4F!gFn-Mv=4bN5_93!ENuJl*96OMY=t_2tWPRMa8%`XbiC>Bk30A# zKkf%(qD;79(=6f>`Y8qnr%Sf`X~|BD?@?;17-;&M&&`V~D!ymZC*LY^=C5Cwi1%@u zt$1q3wW=q|!4)~N&TY`Zpaa!6!!@q<)#W8{9hGmTU64>A1eCN>Bf7=-sytXh0ALp^)3Xn|zCzuaug4diNz{ zv9LaMEP7t;zcLuV3Nba$U?CaiC=!#q~5ZaBsJyaAOr&9+eln(?Kx0OvW2{~<@$dxLw+`S z6=k3+t%h?Q@Ng6v*9J4Fi*qX~E3?S_nl4T_Ymy;=WBhN!f}+3>SC_a3IHJI4wKSZ9 zolWbfIOy4>q>vL6=RmkavZklsaV5P2dbN0UYs<#gc6xXinFqOf=HCi>-}uBtO?7n; z5PiM9i=%Pz@lVmvK*=N_SGF|eHKNYp;aG7RQ*(1v$?}Z6p5Dyw--YGnvAS^?8H2jo z1_n26fdrmWi7E)>Yb~v_R$PB~+e^^=(;pex+D4GLpYG0_>`YaHE&C3N#u3oyw-{kO z*OIhQxjQev)#Ks_fRb&)w^4u2j?0=3n`ecj*7}mTc^;ptaQ3XNtUUhB-mI>!Zfk4XKK4_K1&9F=k;eWM{zIIenK0ynFk)Zaz(9jLV1-&6EtUk(J6;a~iZN_i0c8Dya9(hu zSC^+w02j0`d;kJpQc@Ce>WEsF147%gcFdse+qb*4&WEc?=nT+;16zSAMxju8dV15= zja7j6a097S4OyCUnT5@AL&yeBSKwdYo(nl>#+i z`2pJ!u*v`Hl+px`|K=!6<6~lC0wN|TCLXF=jg2>{l-VM&Re6!t>hhDU9g7_53GvE{)o`fwEX)Qhg>kE933A1 zR#b!rPGv}0<$ZO*s#|sRA3yRudkq4k#rN)Xc2fpY+`tQsG~u8Gyr|xF5B$zWPA)Vi z=I=Mz&%i5`(*$#JbAvQ#VtW8)J3c;^k&%goD+zj>u=uyqM85*tWo2#M+tULu6uW-I z{2`vP zt{s^B_iy@pp&A+*4Ze6)pNZVifsK1^d*EgZ3YfT(rcdh&=dw>uKANrE_+*bvPp5jc z?g0qZqRFOPMQ8wmkb;!dVX++#?J8Aj&>ThbtE%cH1Q01UZtn8>`jjd1ru)&aK=!Hl z^$VYnaQVUU<2nFSfR0BlNXy9FO4F}jd3bn$+;VNuUQv;)wY59g zZElMJngB-fUVtI*laqt!20sT}^W3Mv3mX@AZEelQ#)ewxqoS_vR9|1wj~@{B&FyVr zm(94)P&q@x`8t=aC!(G&z9+nY|K5J4Ze(^=)P7bN#I;>{n-p-Zj9b^5w(DtD(g#ro z(3>+z__477Z)~B@4}pdwkrWXTSy)&AVF@V6*x$b(>pi}g41x>I3(`h!uRL)u_v^s< zc|*GBuW@k|J~!9N$;qb=z|}zRb%L?5u(WeTAQ$$%B^+-4f|v%80OPZ5*~-hyUAmvMyF- zg6&~v|I7}1^r*@6{2uN1tSs8+=cm5|L)(pJvGpq~Rn^u1-2!1T9}rDj^YfpKw3L;j z($i=CaiPFh0h)}BjSUEBf2}(@G6J-^7f98Sk&$_MYkt@SK@t~mj&0d#P_4P37a5D=FgGTqtvN8t-kLT>{H+w!e05COpo};2G zxHsF2$xxiHOJSXf*$D}^fpeMxf&s*+LO#od?R|ZMv|utO0BrM8nMV^vfqB*)riE8Jz6R-GHS5=m{iH;EEO&7SEsOKjbz? zqYnoGtO1Owv$J!m>itsM0T1QO%#56zTtY$uIHCK~Py%2cEv@lxlP5BZqj=|(KgJH| zNFZP*8-ohHH0>rUo(lh?K0~UoJn4Ozz zZetVvxf=Rd5V&M(8o9sGcr?8%sLT4z-u<8}Spy}%zpsyxJS;nVF;^)iUD(ao#^!Q; zh`wkr&4e$dI5YFZayKd9brcj7vp+zj_n11Go14!SBMzEflycO3&K7WIu|*d+DG7m7 zH7M)pr2*>z<&SvCU83J;ZDdpi9`4}yXMrL@MOBoaFJSfeJ77k9DKj?L0SO7CjUK0G zKJ#9s{%=9EFkPc6BNHf@rI^HJ23#sFEv>Q2+TQ-=`f@LkMVqUe&jCn8M;8|}4obAt zrdjHmkCE{x90%Z^&zo4wapFKO&Z{BlV0WjRWKUpS6ZLL2gcy4ZeBrZK& z-@$>?9>Z_Pt%IVUS)H5?TM3(N-@i8+Cun)ydiMVwPyPS2t03d@ z^BDsHMi7?IP_HE~b{fgiNcHC{dLK}m75^EC;h6MKPfvsAW6L`c^7Mw1n^Rp7jvWXF lP4@i7|7|<}`zhEp)KKxxj%1d~?V~^pIT>Z?5=le9{{gpbNZ|kg diff --git a/docs/html/dc/d91/Edge_8hpp_source.html b/docs/html/dc/d91/Edge_8hpp_source.html new file mode 100644 index 000000000..0585999af --- /dev/null +++ b/docs/html/dc/d91/Edge_8hpp_source.html @@ -0,0 +1,201 @@ + + + + + + + +CXXGraph: /github/workspace/include/Edge/Edge.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Edge.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 
+
21 #ifndef __EDGE_H__
+
22 #define __EDGE_H__
+
23 
+
24 #pragma once
+
25 
+
26 #include <utility>
+
27 #include <optional>
+
28 
+
29 #include "Node/Node.hpp"
+
30 
+
31 namespace CXXGRAPH
+
32 {
+
33  template <typename T>
+
34  class Edge;
+
35  // ostream operator
+
36  template <typename T>
+
37  std::ostream &operator<<(std::ostream &o, const Edge<T> &edge);
+
38  template <typename T>
+
39  class Edge
+
40  {
+
41  private:
+
42  unsigned long id;
+
43  std::pair<const Node<T> *, const Node<T> *> nodePair;
+
44 
+
45  public:
+
46  Edge(const unsigned long id, const Node<T> &node1, const Node<T> &node2);
+
47  Edge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair);
+
48  virtual ~Edge() = default;
+
49  const unsigned long &getId() const;
+
50  const std::pair<const Node<T> *, const Node<T> *> &getNodePair() const;
+
51  virtual const std::optional<bool> isDirected() const;
+
52  virtual const std::optional<bool> isWeighted() const;
+
53  //operator
+
54  virtual bool operator==(const Edge<T> &b) const;
+
55  bool operator<(const Edge<T> &b) const;
+
56  //operator DirectedEdge<T>() const { return DirectedEdge<T>(id, nodePair); }
+
57  //operator UndirectedEdge<T>() const { return UndirectedEdge<T>(id, nodePair); }
+
58 
+
59  friend std::ostream &operator<< <>(std::ostream &os, const Edge<T> &edge);
+
60  };
+
61 
+
62  template <typename T>
+
63  Edge<T>::Edge(const unsigned long id, const Node<T> &node1, const Node<T> &node2) : nodePair(&node1, &node2)
+
64  {
+
65  this->id = id;
+
66  }
+
67 
+
68  template <typename T>
+
69  Edge<T>::Edge(const unsigned long id, const std::pair<const Node<T> *, const Node<T> *> &nodepair) : nodePair(nodepair)
+
70  {
+
71  this->id = id;
+
72  }
+
73 
+
74  template <typename T>
+
75  const unsigned long &Edge<T>::getId() const
+
76  {
+
77  return id;
+
78  }
+
79 
+
80  template <typename T>
+
81  const std::pair<const Node<T> *, const Node<T> *> &Edge<T>::getNodePair() const
+
82  {
+
83  return nodePair;
+
84  }
+
85 
+
86  template <typename T>
+
87  const std::optional<bool> Edge<T>::isDirected() const
+
88  {
+
89  return std::nullopt;
+
90  }
+
91 
+
92  template <typename T>
+
93  const std::optional<bool> Edge<T>::isWeighted() const
+
94  {
+
95  return std::nullopt;
+
96  }
+
97 
+
98  template <typename T>
+
99  bool Edge<T>::operator==(const Edge<T> &b) const
+
100  {
+
101  return (this->id == b.id && this->nodePair == b.nodePair);
+
102  }
+
103 
+
104  template <typename T>
+
105  bool Edge<T>::operator<(const Edge<T> &b) const
+
106  {
+
107  return (this->id < b.id);
+
108  }
+
109 
+
110  template <typename T>
+
111  std::ostream &operator<<(std::ostream &os, const Edge<T> &edge)
+
112  {
+
113  os << "((Node: " << edge.nodePair.first->getId() << ")) ?----- |Edge: " << edge.id << "|-----? ((Node: " << edge.nodePair.second->getId() << "))";
+
114  return os;
+
115  }
+
116 }
+
117 
+
118 #endif // __EDGE_H__
+
CXXGRAPH::Edge
Definition: Edge.hpp:40
+
CXXGRAPH::Node
Definition: Node.hpp:35
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/dd/d69/classCXXGRAPH_1_1PARTITIONING_1_1HDRF-members.html b/docs/html/dd/d69/classCXXGRAPH_1_1PARTITIONING_1_1HDRF-members.html new file mode 100644 index 000000000..65e344ff8 --- /dev/null +++ b/docs/html/dd/d69/classCXXGRAPH_1_1PARTITIONING_1_1HDRF-members.html @@ -0,0 +1,87 @@ + + + + + + + +CXXGraph: Member List + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
CXXGRAPH::PARTITIONING::HDRF< T > Member List
+
+
+ +

This is the complete list of members for CXXGRAPH::PARTITIONING::HDRF< T >, including all inherited members.

+ + + + +
HDRF(Globals G) (defined in CXXGRAPH::PARTITIONING::HDRF< T >)CXXGRAPH::PARTITIONING::HDRF< T >
performStep(Edge< T > &e, PartitionState< T > &Sstate) (defined in CXXGRAPH::PARTITIONING::HDRF< T >)CXXGRAPH::PARTITIONING::HDRF< T >virtual
~HDRF() (defined in CXXGRAPH::PARTITIONING::HDRF< T >)CXXGRAPH::PARTITIONING::HDRF< T >
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/dd/d6c/structCXXGRAPH_1_1DijkstraResult__struct.html b/docs/html/dd/d6c/structCXXGRAPH_1_1DijkstraResult__struct.html index ae3729583..959797523 100644 --- a/docs/html/dd/d6c/structCXXGRAPH_1_1DijkstraResult__struct.html +++ b/docs/html/dd/d6c/structCXXGRAPH_1_1DijkstraResult__struct.html @@ -79,7 +79,7 @@

Struct that contains the information about Dijsktra's Algorithm results. More...

-

#include <Graph.hpp>

+

#include <Typedef.hpp>

@@ -96,7 +96,7 @@

Detailed Description

Struct that contains the information about Dijsktra's Algorithm results.

The documentation for this struct was generated from the following file: diff --git a/docs/html/de/d1d/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord.html b/docs/html/de/d1d/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord.html new file mode 100644 index 000000000..901ed237d --- /dev/null +++ b/docs/html/de/d1d/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord.html @@ -0,0 +1,143 @@ + + + + + + + +CXXGraph: CXXGRAPH::PARTITIONING::CoordinatedRecord< T > Class Template Reference + + + + + + + + + +
+
+

Public Attributes

+ + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+ + + + + + + + + +
+
+ + +
+ +
+ + + +
+
+Public Member Functions | +Static Public Member Functions | +List of all members
+
+
CXXGRAPH::PARTITIONING::CoordinatedRecord< T > Class Template Reference
+
+
+
+Inheritance diagram for CXXGRAPH::PARTITIONING::CoordinatedRecord< T >:
+
+
Inheritance graph
+ + + + +
[legend]
+
+Collaboration diagram for CXXGRAPH::PARTITIONING::CoordinatedRecord< T >:
+
+
Collaboration graph
+ + + + +
[legend]
+ + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

+PartitionMap< T > & getPartitions ()
 
+void addPartition (int m)
 
+bool hasReplicaInPartition (int m)
 
+bool getLock ()
 
+bool releaseLock ()
 
+int getReplicas ()
 
+int getDegree ()
 
+void incrementDegree ()
 
+void addAll (std::set< int > &set)
 
+ + + +

+Static Public Member Functions

+static std::set< int > intersection (CoordinatedRecord &x, CoordinatedRecord &y)
 
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/de/d42/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState-members.html b/docs/html/de/d42/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState-members.html new file mode 100644 index 000000000..177613c3a --- /dev/null +++ b/docs/html/de/d42/classCXXGRAPH_1_1PARTITIONING_1_1PartitionState-members.html @@ -0,0 +1,93 @@ + + + + + + + +CXXGraph: Member List + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
CXXGRAPH::PARTITIONING::PartitionState< T > Member List
+
+
+ +

This is the complete list of members for CXXGRAPH::PARTITIONING::PartitionState< T >, including all inherited members.

+ + + + + + + + + + +
getMachineLoad(int m)=0 (defined in CXXGRAPH::PARTITIONING::PartitionState< T >)CXXGRAPH::PARTITIONING::PartitionState< T >pure virtual
getMachines_load()=0 (defined in CXXGRAPH::PARTITIONING::PartitionState< T >)CXXGRAPH::PARTITIONING::PartitionState< T >pure virtual
getMaxLoad()=0 (defined in CXXGRAPH::PARTITIONING::PartitionState< T >)CXXGRAPH::PARTITIONING::PartitionState< T >pure virtual
getMinLoad()=0 (defined in CXXGRAPH::PARTITIONING::PartitionState< T >)CXXGRAPH::PARTITIONING::PartitionState< T >pure virtual
getNumVertices()=0 (defined in CXXGRAPH::PARTITIONING::PartitionState< T >)CXXGRAPH::PARTITIONING::PartitionState< T >pure virtual
getRecord(int x)=0 (defined in CXXGRAPH::PARTITIONING::PartitionState< T >)CXXGRAPH::PARTITIONING::PartitionState< T >pure virtual
getTotalReplicas()=0 (defined in CXXGRAPH::PARTITIONING::PartitionState< T >)CXXGRAPH::PARTITIONING::PartitionState< T >pure virtual
getVertexIds()=0 (defined in CXXGRAPH::PARTITIONING::PartitionState< T >)CXXGRAPH::PARTITIONING::PartitionState< T >pure virtual
incrementMachineLoad(int m, Edge< T > e)=0 (defined in CXXGRAPH::PARTITIONING::PartitionState< T >)CXXGRAPH::PARTITIONING::PartitionState< T >pure virtual
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/de/d59/classCXXGRAPH_1_1PARTITIONING_1_1Partition.html b/docs/html/de/d59/classCXXGRAPH_1_1PARTITIONING_1_1Partition.html new file mode 100644 index 000000000..dfed6884c --- /dev/null +++ b/docs/html/de/d59/classCXXGRAPH_1_1PARTITIONING_1_1Partition.html @@ -0,0 +1,229 @@ + + + + + + + +CXXGraph: CXXGRAPH::PARTITIONING::Partition< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Public Member Functions | +List of all members
+
+
CXXGRAPH::PARTITIONING::Partition< T > Class Template Reference
+
+
+
+Inheritance diagram for CXXGRAPH::PARTITIONING::Partition< T >:
+
+
Inheritance graph
+ + + + +
[legend]
+
+Collaboration diagram for CXXGRAPH::PARTITIONING::Partition< T >:
+
+
Collaboration graph
+ + + + +
[legend]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

+ Partition (unsigned int partitionId)
 
+ Partition (const std::list< const Edge< T > * > &edgeSet)
 
+ Partition (unsigned int partitionId, const std::list< const Edge< T > * > &edgeSet)
 
unsigned int getPartitionId () const
 Get the Partition ID. More...
 
void setPartitionId (unsigned int partitionId)
 Set the Partition ID. More...
 
- Public Member Functions inherited from CXXGRAPH::Graph< T >
+ Graph (const std::list< const Edge< T > * > &edgeSet)
 
virtual const std::list< const Edge< T > * > & getEdgeSet () const
 Function that return the Edge set of the Graph Note: No Thread Safe. More...
 
virtual void setEdgeSet (std::list< const Edge< T > * > &edgeSet)
 Function set the Edge Set of the Graph Note: No Thread Safe. More...
 
virtual void addEdge (const Edge< T > *edge)
 Function add an Edge to the Graph Edge Set Note: No Thread Safe. More...
 
virtual void removeEdge (unsigned long edgeId)
 Function remove an Edge from the Graph Edge Set Note: No Thread Safe. More...
 
virtual const std::list< const Node< T > * > getNodeSet () const
 Function that return the Node Set of the Graph Note: No Thread Safe. More...
 
virtual const std::optional< const Edge< T > * > getEdge (unsigned long edgeId) const
 Function that return an Edge with specific ID if Exist in the Graph Note: No Thread Safe. More...
 
+virtual const AdjacencyMatrix< T > getAdjMatrix () const
 This function generate a list of adjacency matrix with every element of the matrix contain the node where is directed the link and the Edge corrispondent to the link Note: No Thread Safe.
 
virtual const DijkstraResult dijkstra (const Node< T > &source, const Node< T > &target) const
 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. Note: No Thread Safe. More...
 
virtual const std::vector< Node< T > > breadth_first_search (const Node< T > &start) const
 Function performs the breadth first search algorithm over the graph Note: No Thread Safe. More...
 
virtual const std::vector< Node< T > > depth_first_search (const Node< T > &start) const
 Function performs the depth first search algorithm over the graph Note: No Thread Safe. More...
 
virtual bool isCyclicDirectedGraphDFS () const
 This function uses DFS to check for cycle in the graph. Pay Attention, this function work only with directed Graph Note: No Thread Safe. More...
 
virtual bool isCyclicDirectedGraphBFS () const
 This function uses BFS to check for cycle in the graph. Pay Attention, this function work only with directed Graph Note: No Thread Safe. More...
 
virtual bool isDirectedGraph () const
 This function checks if a graph is directed Note: No Thread Safe. More...
 
virtual const DialResult dial (const Node< T > &source, int maxWeight) const
 This function write the graph in an output file Note: No Thread Safe. More...
 
virtual int writeToFile (InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const
 This function write the graph in an output file Note: No Thread Safe. More...
 
virtual int readFromFile (InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false)
 This function read the graph from an input file Note: No Thread Safe. More...
 
virtual PartitionMap< T > partitionGraph (PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) const
 This function partition a graph in a set of partitions Note: No Thread Safe. More...
 
+

Member Function Documentation

+ +

◆ getPartitionId()

+ +
+
+
+template<typename T >
+ + + + +
unsigned int CXXGRAPH::PARTITIONING::Partition< T >::getPartitionId
+
+ +

Get the Partition ID.

+
Returns
The ID of the partition
+ +
+
+ +

◆ setPartitionId()

+ +
+
+
+template<typename T >
+ + + + + + + + +
void CXXGRAPH::PARTITIONING::Partition< T >::setPartitionId (unsigned int partitionId)
+
+ +

Set the Partition ID.

+
Parameters
+ + +
partitionIdthe ID to set
+
+
+ +
+
+
The documentation for this class was generated from the following files: +
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/de/d6f/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState-members.html b/docs/html/de/d6f/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState-members.html new file mode 100644 index 000000000..342bd056b --- /dev/null +++ b/docs/html/de/d6f/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedPartitionState-members.html @@ -0,0 +1,98 @@ + + + + + + + +CXXGraph: Member List + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T > Member List
+
+
+ +

This is the complete list of members for CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >, including all inherited members.

+ + + + + + + + + + + + + + + +
CoordinatedPartitionState(Globals &G) (defined in CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >)CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >
getMachineLoad(int m) (defined in CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >)CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >virtual
getMachines_load() (defined in CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >)CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >virtual
getMachines_loadVertices() (defined in CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >)CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >
getMaxLoad() (defined in CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >)CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >virtual
getMinLoad() (defined in CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >)CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >virtual
getNumVertices() (defined in CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >)CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >virtual
getRecord(int x) (defined in CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >)CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >virtual
getTotalReplicas() (defined in CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >)CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >virtual
getVertexIds() (defined in CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >)CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >virtual
incrementMachineLoad(int m, Edge< T > &e) (defined in CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >)CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >
incrementMachineLoad(int m, Edge< T > e)=0 (defined in CXXGRAPH::PARTITIONING::PartitionState< T >)CXXGRAPH::PARTITIONING::PartitionState< T >pure virtual
incrementMachineLoadVertices(int m) (defined in CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >)CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >
~CoordinatedPartitionState() (defined in CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >)CXXGRAPH::PARTITIONING::CoordinatedPartitionState< T >
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/de/d77/classCXXGRAPH_1_1Graph-members.html b/docs/html/de/d77/classCXXGRAPH_1_1Graph-members.html index 31621ee51..2fd593a35 100644 --- a/docs/html/de/d77/classCXXGRAPH_1_1Graph-members.html +++ b/docs/html/de/d77/classCXXGRAPH_1_1Graph-members.html @@ -76,38 +76,27 @@

This is the complete list of members for CXXGRAPH::Graph< T >, including all inherited members.

- - - - - - - - - - - - - - - - - + + + + + +
addEdge(const Edge< T > *edge)CXXGRAPH::Graph< T >virtual
ALG_1 enum value (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
ALG_2 enum value (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
breadth_first_search(const Node< T > &start) constCXXGRAPH::Graph< T >virtual
depth_first_search(const Node< T > &start) constCXXGRAPH::Graph< T >virtual
dial(const Node< T > &source, int maxWeight) constCXXGRAPH::Graph< T >virtual
dijkstra(const Node< T > &source, const Node< T > &target) constCXXGRAPH::Graph< T >virtual
E_InputOutputFormat enum nameCXXGRAPH::Graph< T >
E_PartitionAlgorithm enum nameCXXGRAPH::Graph< T >
getAdjMatrix() constCXXGRAPH::Graph< T >virtual
getEdge(unsigned long edgeId) constCXXGRAPH::Graph< T >virtual
getEdgeSet() constCXXGRAPH::Graph< T >virtual
getNodeSet() constCXXGRAPH::Graph< T >virtual
Graph()=default (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
Graph(const std::list< const Edge< T > * > &edgeSet) (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
GREEDY_VC enum valueCXXGRAPH::Graph< T >
InputOutputFormat typedef (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
isCyclicDirectedGraphBFS() constCXXGRAPH::Graph< T >virtual
isCyclicDirectedGraphDFS() constCXXGRAPH::Graph< T >virtual
isDirectedGraph() constCXXGRAPH::Graph< T >virtual
operator<< (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >friend
operator<< (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >friend
OUT_1 enum value (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
OUT_2 enum value (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
PartitionAlgorithm typedef (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
partitionGraph(PartitionAlgorithm algorithm, unsigned int numberOfPartitions) constCXXGRAPH::Graph< T >virtual
readFromFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false)CXXGRAPH::Graph< T >virtual
removeEdge(unsigned long edgeId)CXXGRAPH::Graph< T >virtual
setEdgeSet(std::list< const Edge< T > * > &edgeSet)CXXGRAPH::Graph< T >virtual
STANDARD_CSV enum valueCXXGRAPH::Graph< T >
STANDARD_TSV enum valueCXXGRAPH::Graph< T >
writeToFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) constCXXGRAPH::Graph< T >virtual
~Graph()=default (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
partitionGraph(PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) constCXXGRAPH::Graph< T >virtual
readFromFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false)CXXGRAPH::Graph< T >virtual
removeEdge(unsigned long edgeId)CXXGRAPH::Graph< T >virtual
setEdgeSet(std::list< const Edge< T > * > &edgeSet)CXXGRAPH::Graph< T >virtual
writeToFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) constCXXGRAPH::Graph< T >virtual
~Graph()=default (defined in CXXGRAPH::Graph< T >)CXXGRAPH::Graph< T >
diff --git a/docs/html/de/d82/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy__inherit__graph.map b/docs/html/de/d82/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy__inherit__graph.map new file mode 100644 index 000000000..34a0b956f --- /dev/null +++ b/docs/html/de/d82/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/docs/html/de/d82/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy__inherit__graph.md5 b/docs/html/de/d82/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy__inherit__graph.md5 new file mode 100644 index 000000000..3ce9e2e7f --- /dev/null +++ b/docs/html/de/d82/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy__inherit__graph.md5 @@ -0,0 +1 @@ +ffb39af92866f940306b11be7b7a8b08 \ No newline at end of file diff --git a/docs/html/de/d82/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy__inherit__graph.png b/docs/html/de/d82/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy__inherit__graph.png new file mode 100644 index 0000000000000000000000000000000000000000..c89a512ed4f72e5a988e578e0b92d6d4009f098c GIT binary patch literal 6592 zcmcIpby!sGw%?$Dl!SDAC@_G4w1l9e2ofSlNp~wTC`bv2lA?qNsQA&{Eg{l5bc%FJ zry@DraZ5(7s_Fe;dfBw3M|T{d}?$I6)!?~<}Q4B8K-wVvJPxoc#L;emWDd&3bHeT&vagvrx!yh>lgTv zl7!%Bw)<~sVPWAY6oJT<(HgJMAtA(vJ69Xa%FC^-t@DklV=&qg%Sv{3%NYqiyn~o? zQ$9ymoL^lWU?L?Yji+-zPjrdKR`OiZ&Bj~j2>zTJUx2A8DL0q@`t_Q$G3P0gIFtkKU-CK?+3F9=8@3itQ-tE#F>Y!I@3QST_QKTGu zSDZvoS6A2IAWcYVQ4u36>q&wkiPhv64?H|PY|NG0%}q^B^9u_BK|v|E-S2dLk{TEv zf7Tkt+TY)=s3RxW6vXBeOjuo2MR@k?xoR2uNM#i~-BE6}_%Bb_nR;lxfB%j?J>K;@ zL$uhFu(`f|MU|{y*Tf{@)2HLDncL!Vc_}G#v$HSq8(Lbdf2|A!QLx<+Wsz~mY|l0e z2nZmE{a<~NH|HnovF^A=T3XuXmKINUcUTSzg;KhEmxzc+l!1(cgX8X9?ECi&sTZgF zQWPpHE06ZpQ||MyR{>JU$#31d#ix`1#T`x=O259g*3j7KH2Ec@n}M16ZpOf}i>IUG zMn^Os1?x32Ny%UrXUR`HJCCnkEqnWx`mev+GG}LJmzI{Yv$IP}OPy=vEmD~@k?^(Y zY17m`EEfCi8^b8>;73ByndT5Y({xtTZe|O3J8SVNlC&>OG_&& zE1TuNFE{_*i-^90ywy^q=abY01_oPmb9NLeEjycug+)e2=GpHJBcu+nB7N;zzF}p< z3??}_nT3^=UcfMzjApob;c-ez%4dhM#rgTv#Ken&g0*IiglKf_?vI|`9sv%Hxs8n* zl9J#0`(Km}4h;!^Q1SIWHTdiZFL0MQsg)EITD!aRtE!kb&6}03rXzmEQ!IopsaRRp z;h3II%*>RuXd!#@WVbPhBH_AMc})##h+eJF$?qxO9`mA>PA-1xkx43|@xYv%oH>l- zx0G;y|FfRey0>nbjpQ5sfOWfVjJLG~XJl|QapkUlp7MF*@L20M`OmM z$Vu%fmolν=39VmYr+n)c1UT#^*fSLykS_vvjH-faR?t6C}8Fn&7h@>gnk@TeC4T0%!){7#bo#3Uza#(9m6Wc6JsPbN&4qxJ!ltpVQJ%f`U%X zuV`)OMofGi{E|vaF06O-^h{Mab3DB*$LoA{3mZ=vf5SUFDar3slxg4au%m;6e0jU& zj*f|U^xL;Dj1q79%g=t7o_&6lY}WbW9#_=p~y~sz1S5;gzO)#7W5%XO6{5%s+YnPRHY*(YOT9IR#ZrGMP0spIYcfw#nQ^E ztFse;(#u&?R3t-Bo=lJ8kA9EuZdt3%$;nx$u!p)E^FA)FwY4=UARy!~9wCiSH7`lW z0|$D0-S^fQW3jY*lSUPoTe7n3@cC=kJcqKid3kx0tF^SWU?cndZMr|57%ad^pc+C6+&URGA5 z%OCIiSS?;guktaf9Ch(x-NeKRK*M5jKAgs8a~l8mCD((U1$%Mk>vwOSJAYnPSs5P@ zlaLs&Ed@x=FNNe?ry91hx0ewSX?Qa9WOMTR&v<+~B_$qb)E>v4x-TCK| z`r#>XD%I2bUd+LQ2%lH7wMmgVL4a&~dwae3@W=@I**<2X%JthF-sqKu1zI+?9#bK? zAM@c&Wo}J)pJ%K)-_LArveDD)7#nw+3LPFEYG`OMF*7?jIE>mqwX{rq^X848A0Bd1 zNT@JBf8+4iDuPfMDJv`Ea5&g~DJiLmi3tECbhop!b3-?CL{x2GUte}M@A;sYCy&G> zBx+q(V0?8@H81*F@$>WBihV385&e#zkS6<2wfdJ3c1U8Q zxMGA?eVdZ<^151ExzT9f&KBY2%}un|-r7X9o5|N_N@*JR?%n$%8^q7Ph!zEBT79Is zp6tO*MuhX#jK?nA@Yn(5%0Zi8v7|bLK=D2n#P%#vg@r-_v0f{Km$kKrV5dO$K)L`> zUp#^@N&Yz)kchW$`+IvS85yNUU&(DdvTC%dE6>l(HTt48O;g?rF}(i%T_4C4*e*df z$=24E1?|J)%ADWn#BNa~LLAtreHs-Lv$(eQ1xVM;?KkiTQumUG;_2EqXWX&JqeqW` zZCk_HHb+Y`5)%_sQW{%Y2oXvenx?69NM?Ti-u8A;S=q1OzY7Wq6f~joqhn*BMSvql z1Lj&@d+XfSNlBM{{{Ci)+_bQ;xOww=US3{7fuM*ql9-;}0tEK``!#lU zbAS>70Ra@cr?XSe6E2TF`KgI}81nV&4MV4Wp!4@>dS``*125F#h&+xxXPZKDbP9a- zMs1enMqrr~WMrv8)F_nqRy~ory87_&uK&i*$5!dlPO`pwGX4{yc|$-SLNLYE|vGLg@wf zHm5ch7oQ&NSlQV8h=_=onVEqW20HQb^0KkA0`7&PQy_&;*Y%qUkmsPbuB*dlYg;0v03l`EHG=?-I+ zZnG@jKUj9DDk>7zKs~gw($>}0RaZ}fQdo+d93Q8qrb35_KN`-379K6J@$&S9evgfg z?z1hOYYksrUM3(UOish{WRmel^WNv~c*895`t|G1t}Z+zCMHH+ULN#qd1FIdL_|bX z^bAr_S!q=Hm;f=gwx(ld9vd0q78EowHvWs1l^lWQmT;Qv?Cy?hjL0%xiZ zmJ)wiRpsgC_8Im(T3Mbg(EK!(fr*JdoD{4VH8u6ugT**(tl+K|U6P3ZvfT388vo_X z^*&2x%l&EKMOIc;mIfa_e25?f1OaJxV;^W~efd418jrqlP9;ox2kKT zCnxt04*Gw!cXApT7`X60yQ=E&XtP!U&6Sd!UF9$)jz*)oqC&h?!&&)MxJjaw%ZiFd ztK9_4g|A%6tE^-kU3^?=n+3e{2*}a8`_sX8E87_a^sfvv(*T@$_3BmL=CG_wT+BwfO#%m^208iCnMWxicm}i29Fnggu6pZ8VWXU zXJ;oeGP0qe0qAyKw8p>12S-Mxs$8-C{nSWeULGqI6%`}n z!STTpHMO3$HpRho^9D&+)+Okp zwUXZ6`_O0J-Y4)P{ymf{Feqr3#(zg5J12)Dmf-yP^I&J-0ss$u?&!$KkdTn&m6e^{ z-LX=;fv?_2P?kPlRs4(#=@-c3MQv0S72CqmxC$$5jK9A>5F#s}ll)C@Z*NnR92ml{ zU%$$S(p@U624N#4B-Gc}m-&H6KV4G;3Q#;y;dt?li0#i=Tn^bNG}5Kqrd<;YR#(5R?^Pf||`uW;_~M!S1#O@ByRP(tdu z;_5@`h%?Fkf|2;f87}S&RgJg&mzBUi$Jt-eq_CBIhN&Fy>}2AK>ar{r70I62#uMzt z>}Tft^!IJo7L2c~c$^*CJL&W=JNW$xbO7~DsZCDry?mFc;bT4LBL)YEcQto*X1KIGe)i+J6 zAChl2hTMJd;K~R7>A4V2>gAmUrrBRA>WMQ=vkO?NYbSnnq#ELJw=+)nb{5WUXQ#9G zV$35Grs^z7YEJ4ci+6XKg9k-j{U|n@Axb6r`JtVH{rxTRkcP(7V}^tm4P;hUl}h); zhn}+~Q;}L(N#!O$NI?*N{mpyv$yp>assCXHNW@tD?I^(a84GsMQM?r+p(9){& zysN50`*KPN2|@pD4dv*tS4G5vrWBQz11SRx(?5LB0|8;WEGVdUh=!C6v<@*Uq<$)ZpFl48r{r!l2Au+MDi2e7{ zWl&G^mWz;0^Gs@uLFQFe9f9b+X}4jq)fE+{D2LHv6fZByXv-oME3w=L>-g3b-AtJL z*$<74C)?WE*nE$-f7hNGsi`@+yT8XSKnREUTrz4e5Nn{R$$>&?>*1mK`tsng_RdbYxi_JqUf@X}m|I(?fBg8pJ&Ic$4?qs4ed(Lpjf1o6&2WF0Js~k} zP0-alQ~({((nf=EEe&Wk&jMzZ&dtbB(ANI-b9sQD?h#ZF9O9>4WkrC@Ay^#j681x3sk2S67%bhoPhQA)Gy# z`i8lE`}StdZ(|h|vhvTVss6G_GCs!)RMQ(9`8hdQQ=tfBs=y0$Qj3#RJACA{XMY*}Tk>|z5J6W0;vi~@MtixEOUIY@ag04NZvl}gYME{fyEGS6Z zpPc;`#zV#TQu@m6M}c2ktxG~*y^`axDbj^Ggt0LWr2ZRuUsedC zZGv)V&|uK0CGumV>Zgz#%qYSdDCwlaYB-q21HFDOMTUii`TO_!!Gs1vJfwtu7+P6c zTDGiZXJtV&QNMqm(q<0=I0RfqM#endB7CIIQlzA$#K_PPK9`%DD_~UBg!acSh>M9G zZ#7b^jua>`U*YF3%ur~P;<*+O9!~K;S^HyL+>f3FLC8M?j;5y1tNdh>!2kOP1zFJZ zP?|+n?1f2Ai?g`p{-7iyoP)B{kOZ8D-!vWR?Tsid7CC$jV9%u3n5qpIOUB*5e_zsL z#}e|(W74C44FC8bD3PDmG!bJuQ> zvkpy7!MKcHP%zxB$ReHk&-97d3~U<=?Ut-=betUhhWSR(6=-bmYPH8Z*!NNg9L=NB z6?G03Ap7r|&9`M1rwYw(V=zLtFfI@X;^X6W3XCBzTH4s8oMwtUeCJ$C+!LoXK_2YMbvfGET}Gi?7dsj4 zEx;65S*3wOm#g2qx84@XQT=p%wlc1f!k06@hU0t%IpCL`k+BkjD*ymI*v7_2VPPQ* zjNHAvN_61{1=ZBlV19|zEe~XbhK9mRJcPXp<`Sy$GK`dzkRG<6H^HtzePGZ;BJFgu zyE-T^kc5N;CP-yvSHCYTEy3&qd#Z36Q-?yLudA1UmE=O90{s1(T3c(uXSloX?<`;; z9x8Jc(|xYxjqt#Z-0Xz3g-ASet&fjShU(uWq@*btSkU6+oB+f8EOeT84H&M8WzPwMdv~aGBYu*u2&@_T2Z)-iE0>m zQczHAuBsYyvQ(8jC7d2@F385N3}nopqg5YC}_AR>8R zV1$vzXQ!!+&CMS=BIM5l&mf3+oRN;s59orKnR?BdU?FSgNI$=N!P;Yu`}eni?_rrv zPEKn!?9G1lra&YgKYZ};@+#0TTY)Qq#JJP%Y>4KONrdHS&CA`>(0DwMeh*q1ZX~5n zNH{dq#lf03I_WB(Txa{)tK6M}NB9urY(AP= + + + + + + +CXXGraph: Member List + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
CXXGRAPH::Runnable Member List
+
+
+ +

This is the complete list of members for CXXGRAPH::Runnable, including all inherited members.

+ + +
run()=0 (defined in CXXGRAPH::Runnable)CXXGRAPH::Runnablepure virtual
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/de/d93/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__inherit__graph.map b/docs/html/de/d93/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__inherit__graph.map new file mode 100644 index 000000000..2181d134f --- /dev/null +++ b/docs/html/de/d93/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/docs/html/de/d93/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__inherit__graph.md5 b/docs/html/de/d93/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__inherit__graph.md5 new file mode 100644 index 000000000..b21f563b8 --- /dev/null +++ b/docs/html/de/d93/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__inherit__graph.md5 @@ -0,0 +1 @@ +df177e03bb17e95d798ac79b4c93d980 \ No newline at end of file diff --git a/docs/html/de/d93/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__inherit__graph.png b/docs/html/de/d93/classCXXGRAPH_1_1PARTITIONING_1_1CoordinatedRecord__inherit__graph.png new file mode 100644 index 0000000000000000000000000000000000000000..7fb4758cd371d186ef216b6ee3230e8a2780a4fe GIT binary patch literal 6846 zcmb_hcR1Dm-#*C-*(=%O*du!#TgNDSj}($k_Ke6*9IGTGo6Hm<4HO}JudHmcBjb5_ zzQ5}k*Y$h;dyWg2&p6(n_v?P$ulv4FjE)xiG65X{0)e=!uBM^~zkA?29v=&Sst?(m zpTM=&M5`dq&c9xMC`?8m=seX`6b<}dtY`WwPz>*Xb5k>EzC}t#rJ~Ba5lyJdM?j$Z znw8^Kt6WRrZ9_*fGscZjuIlL6u)g<*R^|+5)|a?Bbf)w5Ir%)N_O`rXk18XaKg$2| zo_dCgZdTr0tVs9lMjcE{2&S(KvEWB2As+sW_W9%51l_=4ZcO*zr_wE|p}S zElPno+T^FyzupB42k$c#mn44quD<(~D_1;!b@mPn(8~q=DKRWvSy@3KA|fK#$%{)$ z2)qf2h+fG0dstazKStU<{d~Kwu5Jk~SzR3;A7A|S>s8j+*w~|wy2i%YQl7|6t#8P= z%}s4)QV$Q0%InU86cov!p`lq>j5Wn|b+oI_ckZyvZChOD!lC$7@ZrHpKp1T@r#3Ev z&+@(3!Nw%P5pzmPilmIp>dHz|`+U9UqV>I;va*{wI+fh~R!y?P!sMf0zhc%e*_J=) z!@t&JFG?1tB5)VNaXAcX(&2jj z`n7?+J})n?azML14?q84UterYjDw3y@ZbIQ);Jn(FE2eky+kA7^c#i!7#Hyj21?4j zii)%Sb@P@lb6bz&>{abaHTL{ra`Zf2ZKh8xa(0vZZBysW;ai z3mYq^s0e@k@7}OgZrO-rHR^7~6K4cMly04Y&<9QSd2fH8?#h+?{QMkh#)Ny0jj_*}>Ed z4Dl}f0s=^knxIva3iqunqg|+qV=H6jfKNVR;Dg^@GK)@mGU`gQr8z zP(yXMKZlvVv175KM}(G{*On9)-ywO@m-uTmVGtAF7xouggpZ%!&>+tzPls!Ne;@sX z{_t=yTTD!BLEO;D$jr=aWod~^IN;vB#T?}*yRPSVZEP+getOiKnwnA)sOsx`wkL6r zyO|P3eEF8Z#L3PM_{_bIMx)o3$vlW-iK_s{Ymtw2V%eFq_CtRkAMV_r`&wLF95Yf@ zR;DYKsFnvUQ&}mrhRwm+rC&U#i=B_dnPOboKI4AtLx3tPrsWKuUEJH-`wAW1s|L@- zAFAHJ=i4b-qF0pB=tV%s{rmUZ_}5;&Vnu`|CsQD9x5iRQNlDQY<6Vx})zj6js;$kI z4>`?31@<7fluOps)d>NDvkoMb+KzrP+nfXvAWt}D{O9V{`csp z`pug+)zv+MCHb09XAhZ8wy-N5NCuX)w6q)@9SgNGztCxFXngOlkZbsydXj(_QF!Vc9(jA?V#Ml6;{w(g@uJ~Q;nu${ue!_CI<(-Pma9h zvNvaE!^F!h>V-Ku(Z>m=7jq1-?8h#Oy-!Os3JMBxcmEwj!3mTK>?I;B42`0sr1Uj` zNpSY~wew z{r;KeC^8A4sSkk%r@xy?fWd^HC#q*bNnoGn;8GF0&V`Pr6&Cf|tu$6@^p@J%B=wgS zb9*NyC&ffXdkXG$qyaXmC@FVs^tfUz@>#i35zqJk&LhJL3m4xy4Fl14c6G%+e$2|s zYHec^9v0Suicy&@)-RmT3ent!J)Kwj6se`DnXAJUn}_p|3+ti6%U=6iw{8{T$Z1CW z_hdVtNvR1&?jCW^ap^-s&U$)u>Rp9366A2?%syY}j6WS3GNPfOAt6bCCjP8Nz>Y++ zn%?16JUV!0&$WGxkXY5+Jg_?pwZ6Wdz=)z-vyk(aBmd0pQA=G${66qtywc;`vwNQyuDo<959mQq79;B1*}1W?0S8g24^2%?(1OD0L5JH5Po6y4S?pe2S`w9z z5TPZyd^w)q{GF(n7%Jq{!qO7O%^lNf&B4x&KmZ^rrBc$;^te(0DjJTBO@Z<{}XvvzImgJJv=#?`Rtiw@X@Z|$K&n3d`);D za*-6IWR8xBu`vxLrKrce8WR&!4QU7$t3X}Cd?F87%%CFR#=*g1Y2l8dqN1fGLvlO4 zjL&PegQKGWO-)U&;l94@z13j^0+^jV1{-1T?A#)UM86{>AOJuy$pt-o{#>K5pPMqa zq@<)e9cp^ilcOwntI?#NS3_^EOS6qKgdjX+Pnt9Iuv#o>!GXVSO`}=F7(5&4Z9f2SM{^nT%-5+dN zQpde@pZRhSvm@Wi$s!qAOuW6j+u7FE*4>RJc(J>?%ZLit?UIdk^M1GdS?6sb1Y&4t z$hhLxxeQWPZk}&XJ~=+FJfknhrzhr=k{X?wn(FR$`|(0bJ6rBD2?^7u1nb1lr)4CQ zo|1r={WVj}WoHJd?C#+6$6!Bc}iFoky?8L96291u6)-2;8Cxg1Chaut5fAm}= z(2`1=TVMRw#8ByJ17J*I?nVM$4J)TJ~| zcd7urXSA<_B3X6ZH4;<3vsD5XDfA6FZ0}Ao{c|+-%gpcX9i|<>px2lVs`&-f+WG>q zk&!Ynm!v8;mtS8$o1zIlaYa!P-C0m1myUaEQo4V(TFUPRd~7Thwp{XmjuQ0t_9_?3 zr}`;=UnE@GotBZFZ^ST$A#e&w4-XUSEsAU9>nt8TIJJ@8x$^!~)B!>7&`_)0*+Hb5 zyE_uW%-4DG?b4DxE!~$RvO~3^sPJeTd$q4CF*l4ZBA#W0i2Gf+Z1|If>fhGwU*%%oE&XTHiV~sCk<=2#X|J;_2J53SVA*1C)+S=XAOca3c0k-#m?AX$%4HvF<%@Ljk%P}38JG7hdmZ#d_9Tpor)$gXAdj~NOE?EuS&A-Z$t&i##v`j;U#<|B>@g1G@fmo zqRoQg?sB(;1-#dd8=YW*U_or)5V<9l9TnlyhOKG#Y2v_&{|qQ$}Jnz z*pnV35uZR#)VfW}!47CX6#!q>J~@fv<6HaHm9Z3k?btSZ^mV2R9COYeW>+5=i>vaBPru6Ssun{?i6bJryVHo6@%Ni ze>VE>3=9lJUcP!gU$3E|VRNzp4>8i{?+JPb3gqmt@PLt#@%{VvbaZsY#Kf>gFczHYE#xn(GD0SzYIiEiHAr zb&JtQ*@vqYJoU-x#K(~AZ*yfPRaj0h0C!-7T_@j1tOfY_0j_yGh;a#Wp#D+bfG(8pxzOo z-{w-&(xj!Op&!P_#-^Hr%^TyuT$h!BwtQPvr5Hc{&c(B(XJX>9_`>31Lw)@n3EM|{ z>=(Ac48W+(NKa>3WH;gC<4fdpLm*f&f0{|;**Q4waB`73WNDN=VdV<$Wj+|jtG954 zjl`(g3a9HAYNd`3jE|R=mc|`9kJT)XzPZ=74_ZXnu9Ft=>7C2C4xXXmARw157Of?d zxB!OefwME;(+)#JLsi+{TVV1)G(vx=hPSk|L|cfqWu?^U5FnY8_VH9zRdE7sv!%UD z!o!kWRaLvvMZUGQsre*h zFl5Q?Di^b)y$KM^lms7-R(NaJN=O8r1}^vIL$UxJ6r;f0v+O0F0U&=IU}RwMl17KM zB!DR|;vb8|o{wQe4-F6R_{m}f>p>B8WudM*UBbr)uYE^|*25+?kf&N&BWIVz`&Var zkQ@_AQ{kmv@z&NBB6P7kyWhTMeY}gKy+j{VKy*4qC^k}*>LqdB@ab5YPAJ#|>o}<^*t5?ZmQZh5+#pD8ZmtcqC zaa-sv6A=MKeP>%P5l6Af6x0>!mFD7W5Nd&@n4Xpw7k^h%lhQm>Q(Mc)!C`1@9I`iP z93&^t$_n%}I5tLyAO%|jMKCbH29E>*$l~TE6NEy*=s@nHqyEq`BO@jbiI;g+*gfa#0~TfqIR*y0CL)sDW#=jRA}J~9N#8p92R+DvWEKFs% zBj!5d6JTxB*$3QGVBp`=lfT2SO_Nho#X?Sx0f3lFa6Wr`dl0DL5z|YCoCfLZQ*0X? zfQA8|aBfAiR<5h6#xux>3k&zPw&s_WtruoL*xuj&(bo2Rdz*lm7%XBr1TiR5zgi-7 z>qH5+DWIJS%Z7c}2QUVI4>lLK{5IvkL3Nm9{e*;sbc*x+k9L=zi#a7FCu3%QU)c1N zyfS#xOL}r>i288byxLY>QSr0e$CIJnUKUr#G$`@0GsIn3$zz7gE#JI-tGXhVCSVx= z5e25wLckZ20eCjZ286`L!2nYrZ?v_yE1E@-FipYzeG3pAys_)@aCb)_B&DRNsHuf% z9~TrL9WJW#DJRk9<>y1nX?J>j7~R|6u0Ga6mChE`T<^bQXJnN2?%jU%-Hy|}iV*I% z)Nk%}%RxX00tBYHUFWkZ>sEpq*}u&XYk%4rNPK`hTB6C8%8QE~G&Kn`x~L_9$zj&A zehUMiz4pd&YjFq{7k6n+%T|XtN;$U|tYTt?`4)RdMn+s*T-8~wkjt3pm4B@Y600DU z7>cJd-(q89m7|FHE$ZAMFvvwGP-jQ55&^PKj`pU54=f>Z195~=lZ8m&Ooob1+{A1_xW?f4VIr5D*c=h|+~L1{dbWTJ-F92%ZFZ zc_Blusjd$AyI%&WP;~gihYw3jS3&hueT9x2z4-8BN8*FS1sdu&j%#WVPsPy)ssyON zsGE=i{As_CtZHnWfU))IlL8uzw@ZUeHiaBvbd>wlF7g82W~l+x8RqxG!UE*OC=?0@ z2M4GL<{f$bNGP00O-%*-tZi&G`K;6V+{w#%^~(D8?c0uyV-pkfG&G!)1f$O4h)@OQ z%2DSWo%1*qdat@#IB&PPtE=qYJEPAJdxY6z6q}B>JK!*Gc<=BqkOhi{<|)ARw5#{a z7gkwWSyt9r$jl(pAR{B|&XzZJ7%0a(*=GhkO7frn@(hAr zn4AQ|EyB&s&CdSl1`@(*mcg5d(2ID)KpyncUiKi0XJ%$1BO}SI%#QXYDf<}rH(|<^BlON4ZfRTclS4^<*i$yVQxcm0k6HlCj|us&?wtG zJG?wRv2k$_kv^N%^aSZ!U0n@npL#NqdukPR?t@A2`Lx4`g#V2Z{+C-)tJ~r|%@V=4 zeVNEy2T%Dk8*iTCA@hNY8fhB>t9ypI?!P{mIrm-*XBYOFNwKdHnZZW^@WGU-mP)zO H?Xdp + + + + + + +CXXGraph: /github/workspace/include/Utility/Writer.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Writer.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __WRITER_H__
+
21 #define __WRITER_H__
+
22 
+
23 #pragma once // This is to make sure that this header is only included once
+
24 
+
25 namespace CXXGRAPH
+
26 {
+
27 
+
28  template<typename T>
+
29  class Graph;
+
30 
+
35  template <typename T>
+
36  class Writer
+
37  {
+
38  public:
+
48  virtual int writeGraph(const Graph<T> &graph, std::ofstream &file) = 0;
+
49  };
+
50 }
+
51 
+
52 #endif // __WRITER_H__
+
CXXGRAPH::Graph
Class that implement the Graph. ( This class is not Thread Safe )
Definition: Graph.hpp:76
+
CXXGRAPH::Writer
Definition: Writer.hpp:37
+
CXXGRAPH::Writer::writeGraph
virtual int writeGraph(const Graph< T > &graph, std::ofstream &file)=0
Function performs the writing of the Graph to the file.
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/de/ddc/classCXXGRAPH_1_1PARTITIONING_1_1Record-members.html b/docs/html/de/ddc/classCXXGRAPH_1_1PARTITIONING_1_1Record-members.html new file mode 100644 index 000000000..26f95bb05 --- /dev/null +++ b/docs/html/de/ddc/classCXXGRAPH_1_1PARTITIONING_1_1Record-members.html @@ -0,0 +1,92 @@ + + + + + + + +CXXGraph: Member List + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
CXXGRAPH::PARTITIONING::Record< T > Member List
+
+
+ +

This is the complete list of members for CXXGRAPH::PARTITIONING::Record< T >, including all inherited members.

+ + + + + + + + + +
addPartition(int m)=0 (defined in CXXGRAPH::PARTITIONING::Record< T >)CXXGRAPH::PARTITIONING::Record< T >pure virtual
getDegree()=0 (defined in CXXGRAPH::PARTITIONING::Record< T >)CXXGRAPH::PARTITIONING::Record< T >pure virtual
getLock()=0 (defined in CXXGRAPH::PARTITIONING::Record< T >)CXXGRAPH::PARTITIONING::Record< T >pure virtual
getPartitions()=0 (defined in CXXGRAPH::PARTITIONING::Record< T >)CXXGRAPH::PARTITIONING::Record< T >pure virtual
getReplicas()=0 (defined in CXXGRAPH::PARTITIONING::Record< T >)CXXGRAPH::PARTITIONING::Record< T >pure virtual
hasReplicaInPartition(int m)=0 (defined in CXXGRAPH::PARTITIONING::Record< T >)CXXGRAPH::PARTITIONING::Record< T >pure virtual
incrementDegree()=0 (defined in CXXGRAPH::PARTITIONING::Record< T >)CXXGRAPH::PARTITIONING::Record< T >pure virtual
releaseLock()=0 (defined in CXXGRAPH::PARTITIONING::Record< T >)CXXGRAPH::PARTITIONING::Record< T >pure virtual
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/de/de1/CoordinatedPartitionState_8hpp_source.html b/docs/html/de/de1/CoordinatedPartitionState_8hpp_source.html new file mode 100644 index 000000000..6d5103d04 --- /dev/null +++ b/docs/html/de/de1/CoordinatedPartitionState_8hpp_source.html @@ -0,0 +1,274 @@ + + + + + + + +CXXGraph: /github/workspace/include/Partitioning/CoordinatedPartitionState.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
CoordinatedPartitionState.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __CXXGRAPH_PARTITIONING_COORDINATEDPARTITIONSTATE_H__
+
21 #define __CXXGRAPH_PARTITIONING_COORDINATEDPARTITIONSTATE_H__
+
22 
+
23 #pragma once
+
24 
+
25 #include "Record.hpp"
+
26 #include "Edge/Edge.hpp"
+
27 #include "Partitioning/Utility/Globals.hpp"
+
28 #include "PartitionState.hpp"
+
29 #include "CoordinatedRecord.hpp"
+
30 #include <vector>
+
31 #include <set>
+
32 
+
33 namespace CXXGRAPH
+
34 {
+
35  namespace PARTITIONING
+
36  {
+
37  template <typename T>
+
38  class CoordinatedPartitionState : public PartitionState<T>
+
39  {
+
40  private:
+
41  std::map<int, CoordinatedRecord<T>> record_map;
+
42  std::vector<std::atomic<int>> machines_load_edges;
+
43  std::vector<std::atomic<int>> machines_load_vertices;
+
44  Globals GLOBALS;
+
45  int MAX_LOAD;
+
46  //DatWriter out; //to print the final partition of each edge
+
47  public:
+
48  CoordinatedPartitionState(Globals &G);
+
49  ~CoordinatedPartitionState();
+
50 
+
51  Record<T> &getRecord(int x);
+
52  int getMachineLoad(int m);
+
53  void incrementMachineLoad(int m, Edge<T> &e);
+
54  int getMinLoad();
+
55  int getMaxLoad();
+
56  std::vector<int> getMachines_load();
+
57  int getTotalReplicas();
+
58  int getNumVertices();
+
59  std::set<int> getVertexIds();
+
60 
+
61  void incrementMachineLoadVertices(int m);
+
62  std::vector<int> getMachines_loadVertices();
+
63  };
+
64  template <typename T>
+
65  CoordinatedPartitionState<T>::CoordinatedPartitionState(Globals &G) : record_map()
+
66  {
+
67  this->GLOBALS = G;
+
68  for (int i = 0; i < GLOBALS.numberOfPartition; i++)
+
69  {
+
70  machines_load_edges.push_back(std::atomic<int>(0));
+
71  machines_load_vertices.push_back(std::atomic<int>(0));
+
72  }
+
73  MAX_LOAD = 0;
+
74  }
+
75  template <typename T>
+
76  CoordinatedPartitionState<T>::~CoordinatedPartitionState()
+
77  {
+
78  }
+
79  template <typename T>
+
80  Record<T> &CoordinatedPartitionState<T>::getRecord(int x)
+
81  {
+
82  if (record_map.find(x) == record_map.end())
+
83  {
+
84  record_map[x] = CoordinatedRecord<T>();
+
85  }
+
86  return record_map.at(x);
+
87  }
+
88  template <typename T>
+
89  int CoordinatedPartitionState<T>::getMachineLoad(int m)
+
90  {
+
91  return machines_load_edges.at(m);
+
92  }
+
93  template <typename T>
+
94  void CoordinatedPartitionState<T>::incrementMachineLoad(int m, Edge<T> &e)
+
95  {
+
96  machines_load_edges[m] = machines_load_edges[m] + 1;
+
97  int new_value = machines_load_edges.at(m);
+
98  if (new_value > MAX_LOAD)
+
99  {
+
100  MAX_LOAD = new_value;
+
101  }
+
102  }
+
103  template <typename T>
+
104  int CoordinatedPartitionState<T>::getMinLoad()
+
105  {
+
106  int MIN_LOAD = std::numeric_limits<int>::max();
+
107  auto machines_load_edges_it = machines_load_edges.begin();
+
108  for (machines_load_edges_it; machines_load_edges_it != machines_load_edges.end(); ++machines_load_edges_it)
+
109  {
+
110  int loadi = *machines_load_edges_it;
+
111  if (loadi < MIN_LOAD)
+
112  {
+
113  MIN_LOAD = loadi;
+
114  }
+
115  }
+
116  return MIN_LOAD;
+
117  }
+
118  template <typename T>
+
119  int CoordinatedPartitionState<T>::getMaxLoad()
+
120  {
+
121  return MAX_LOAD;
+
122  }
+
123  template <typename T>
+
124  std::vector<int> CoordinatedPartitionState<T>::getMachines_load()
+
125  {
+
126  std::vector<int> result;
+
127  for (int i = 0; i < machines_load_edges.size(); i++)
+
128  {
+
129  result.push_back(machines_load_edges[i]);
+
130  }
+
131  return result;
+
132  }
+
133  template <typename T>
+
134  int CoordinatedPartitionState<T>::getTotalReplicas()
+
135  {
+
136  //TODO
+
137  int result = 0;
+
138  auto record_map_it = record_map.begin();
+
139  for (record_map_it; record_map_it != record_map.end(); ++record_map_it)
+
140  {
+
141  int r = record_map_it->second.getReplicas();
+
142  if (r > 0)
+
143  {
+
144  result += r;
+
145  }
+
146  else
+
147  {
+
148  result++;
+
149  }
+
150  }
+
151  return result;
+
152  }
+
153  template <typename T>
+
154  int CoordinatedPartitionState<T>::getNumVertices()
+
155  {
+
156  return record_map.size();
+
157  }
+
158  template <typename T>
+
159  std::set<int> CoordinatedPartitionState<T>::getVertexIds()
+
160  {
+
161  //if (GLOBALS.OUTPUT_FILE_NAME!=null){ out.close(); }
+
162  std::set<int> result;
+
163  auto record_map_it = record_map.begin();
+
164  for (record_map_it; record_map_it != record_map.end(); ++record_map_it)
+
165  {
+
166  result.insert(record_map_it->first);
+
167  }
+
168  return result;
+
169  }
+
170  template <typename T>
+
171  void CoordinatedPartitionState<T>::incrementMachineLoadVertices(int m)
+
172  {
+
173  machines_load_vertices[m] = machines_load_vertices[m] + 1;
+
174  }
+
175  template <typename T>
+
176  std::vector<int> CoordinatedPartitionState<T>::getMachines_loadVertices()
+
177  {
+
178  std::vector<int> result;
+
179  for (int i = 0; i < machines_load_vertices.size(); i++)
+
180  {
+
181  result.push_back(machines_load_vertices.at(i));
+
182  }
+
183  return result;
+
184  }
+
185  }
+
186 }
+
187 
+
188 #endif // __CXXGRAPH_PARTITIONING_COORDINATEDPARTITIONSTATE_H__
+
CXXGRAPH::Edge
Definition: Edge.hpp:40
+
CXXGRAPH::PARTITIONING::CoordinatedPartitionState
Definition: CoordinatedPartitionState.hpp:39
+
CXXGRAPH::PARTITIONING::Globals
Definition: Globals.hpp:32
+
CXXGRAPH::PARTITIONING::PartitionState
Definition: PartitionState.hpp:31
+
CXXGRAPH::PARTITIONING::Record
Definition: Record.hpp:29
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/de/deb/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy.html b/docs/html/de/deb/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy.html new file mode 100644 index 000000000..d800303cf --- /dev/null +++ b/docs/html/de/deb/classCXXGRAPH_1_1PARTITIONING_1_1PartitionStrategy.html @@ -0,0 +1,103 @@ + + + + + + + +CXXGraph: CXXGRAPH::PARTITIONING::PartitionStrategy< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Public Member Functions | +List of all members
+
+
CXXGRAPH::PARTITIONING::PartitionStrategy< T > Class Template Referenceabstract
+
+
+
+Inheritance diagram for CXXGRAPH::PARTITIONING::PartitionStrategy< T >:
+
+
Inheritance graph
+ + + + +
[legend]
+ + + + +

+Public Member Functions

+virtual void performStep (Edge< T > &t, PartitionState< T > &Sstate)=0
 
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/de/df5/classCXXGRAPH_1_1DirectedEdge.html b/docs/html/de/df5/classCXXGRAPH_1_1DirectedEdge.html index e6473ac49..e5cb2af29 100644 --- a/docs/html/de/df5/classCXXGRAPH_1_1DirectedEdge.html +++ b/docs/html/de/df5/classCXXGRAPH_1_1DirectedEdge.html @@ -149,7 +149,7 @@  
The documentation for this class was generated from the following file: diff --git a/docs/html/df/d03/Reader_8hpp_source.html b/docs/html/df/d03/Reader_8hpp_source.html new file mode 100644 index 000000000..fd92c1e88 --- /dev/null +++ b/docs/html/df/d03/Reader_8hpp_source.html @@ -0,0 +1,117 @@ + + + + + + + +CXXGraph: /github/workspace/include/Utility/Reader.hpp Source File + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Reader.hpp
+
+
+
1 /***********************************************************/
+
2 /*** ______ ____ ______ _ ***/
+
3 /*** / ___\ \/ /\ \/ / ___|_ __ __ _ _ __ | |__ ***/
+
4 /*** | | \ / \ / | _| '__/ _` | '_ \| '_ \ ***/
+
5 /*** | |___ / \ / \ |_| | | | (_| | |_) | | | | ***/
+
6 /*** \____/_/\_\/_/\_\____|_| \__,_| .__/|_| |_| ***/
+
7 /*** |_| ***/
+
8 /***********************************************************/
+
9 /*** Header-Only C++ Library for Graph ***/
+
10 /*** Representation and Algorithms ***/
+
11 /***********************************************************/
+
12 /*** Author: ZigRazor ***/
+
13 /*** E-Mail: zigrazor@gmail.com ***/
+
14 /***********************************************************/
+
15 /*** Collaboration: ----------- ***/
+
16 /***********************************************************/
+
17 /*** License: AGPL v3.0 ***/
+
18 /***********************************************************/
+
19 
+
20 #ifndef __READER_H__
+
21 #define __READER_H__
+
22 
+
23 #pragma once // This is to make sure that this header is only included once
+
24 
+
25 namespace CXXGRAPH
+
26 {
+
30  template <typename T>
+
31  class Reader
+
32  {
+
42  virtual int ReadGraph(Graph<T> &graph, std::ifstream &file) = 0;
+
43  };
+
44 }
+
45 
+
46 #endif // __READER_H__
+
CXXGRAPH::Graph
Class that implement the Graph. ( This class is not Thread Safe )
Definition: Graph.hpp:76
+
CXXGRAPH::Reader
Definition: Reader.hpp:32
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/df/d27/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__inherit__graph.map b/docs/html/df/d27/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__inherit__graph.map new file mode 100644 index 000000000..6e10bd097 --- /dev/null +++ b/docs/html/df/d27/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/docs/html/df/d27/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__inherit__graph.md5 b/docs/html/df/d27/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__inherit__graph.md5 new file mode 100644 index 000000000..816c1bc7a --- /dev/null +++ b/docs/html/df/d27/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__inherit__graph.md5 @@ -0,0 +1 @@ +e2f76fb6661b9a3c8ee9967d3c5fda19 \ No newline at end of file diff --git a/docs/html/df/d27/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__inherit__graph.png b/docs/html/df/d27/classCXXGRAPH_1_1PARTITIONING_1_1HDRF__inherit__graph.png new file mode 100644 index 0000000000000000000000000000000000000000..e0332e3221edbc37f283c54cc2650323c97e727e GIT binary patch literal 6630 zcmcgxbyQW|wm*b`gn+<7LIF`qLJ$$@PNfl0N;*YJ>5>u&X{1Y}C8fI?q#KcrBOxuk z>AT;(TR|F|3NE6^v;vx_T0$CXe75F^}-yt~Y@Kbio@b3#) z2J+Gph|9lUsdd?r2n0oftc0lA+r;f8S6VXX%Z`SQs!D3^F^>c*`6!iVL)PD= znqTGJTAy5NW^o+fC{bii7?c}l6l9jgrmJuW3jM-l>=fye&lpSE74y?2vFH3E&U7`t zzYm{s=;-%&@6p+b$BLlo+-k3riO?!Fr4KCvJqB)(Mlary2pP%2cJ_ZKHmDp8W6=G7a*gB6tE}uwO zR#p&R#yv6C^Yuyk_;Sk1A0s0p{r#~L`jQ`7B0V@pMn?q&1b#(4%hx2Ppa^1L+Gh&I z#0|Sb<5s^94jvsDxpqt7_(xmt*w|R9>3}V7Vr#2JS!|!l{#yb2s=7MC zJ9i{hRZGju$*hTS{S4bb42_Rp?)7l&-Y!-)C_X-#_k48!{zScdjlCGDyZawFXy>y$ zS~6lZE@OI}5?GdGFmf@#?Q}gmEiLUB*~SUgv9Pe<nL6iqjR_0UxNJLb)>K5qsja9OR#D+-Ys)oun-sSrgeu_H zS8@*BwY4>BAvaAX(&x{gV_muO^5tH2tHEvnjmHfn(tp0Y*s$Zt)2GF;7^twqLUu%B zx#jraXl-q+a)#8KDs2LSkmTfBtWONo-oC9YFE8(9fA@7UQmnaNzwq&b z@7kJ~o6XCYbiPe*57vlT8hd(rMn<9rRx|2w@fkTv1~M{kn74cs%0iNo2Dbf(zNcZp zX3tkwTs+j*M}SDp%5qp6OdI^~>+tY!w#La2*7$0^UPo1R355!qe_vE&qplt;Kmh&u z^eKVPifz@sXZf!k9g#s2&d$!bQFwl0xB0&m7TzK!571Led|!#E-SUo1NtvIXt}*}4 z;FeKW_vZt}gF(V;2(N|);o!FB6zXL}=P!Z@=W`vOh1A zSz)up6lGyyQAp%n{Q2|ULq1;Kg>30HYSQV})8CuBc+k+qv}~?QuudKx9+P6t>)Y^< zwwXr#`=Qj2OPo-;=hwO=bnoP3h+_`>i=VPg{M!1D-7i*KW4e3yEz}RHde-W-F!~PCk6u{4O__h4rPmIWwPwe(B_dNH2|`py2d3 z8@(#qyOb%3iRXLE^2lJxj3MZzsi~=7j1R5UUc8u|EHxb+9qrn&O3A^&4G$M&ii?X= z)6g)CJ-Km&nt$~0VcRzeDJdipd2zl!;Jy+S`p%*2eI&Lu|=au zSI}vP8X+PYTTyWcX(HX0F*jR6{k(g@!IWTm1y+gt7_EG!Hr=cul!K~0u+0508r`~CA% zc=hDu#Qk%0;2l@{(@fz<9*?XhUc-QW{rYt%Ls~J3?{|9$72INCVj_HTyacG`alR|f z-P_oxzuKP!XX;>QR|+`JxU{r1kSu6vWo2b%78em=yFQ%t*lwkB=Jbnl#^5xOHai@z zmZapB&FA%Q&ZefOuU@?pcEt7VRA<3uMvL3>Hj8ZR>)Vdi^XTgB9T^`V9~%n|3=9kk zx_b5M$I#60>(XJjw(Tz19z=``t&>m+IoR5k1O#9cYZ2iPn{iXd_5dSvJYOhP`xgsc zp}Z!>JouVO&Y2N^-1HA2@x^}1rOfi`aO2v!gQ_ko@^5c4GMdiUyBj^YK}F?cZ%<^t6*-!xF+MsDr=c2kgJUg3| zl0rjF%;~&mgbX&evT{4wTP9&tIH2DbG5Vn9-}pLn!?U@i<@dpXnwr|@C-D(6F<1yD zHZ~aNF+$<uYOFvp9&(zP=Mvha#l?u8kz?C_2Cqc)2rKk0|P0%Z_*Ez#$#fTDjdgo8bvrUCdz2_ zWMF0n#ID>k{ENc*bv*dNweHyH2#5UvXJ}x*!RZmJ>fYdG&3V3nK?P}pFT~^&3Ww1 zJbwDL50p(u7>ylo;=zIaND-_8;7Q0~V`QevZfH?RNNBpky2YlhvT~xOrKPv`$x08C zPC-yaQc^)t5e*VKHZwC5mhph7vGJbAJl63r1_&e$j-tau$DlYLA9TK?P+A#SWpLYd z985EQ(H6gefST%RgGp*?YQTAA6_xb-{F&L=5T1?o_2}s6w4U)IJwkl^L>_C(5UJ9N ziuT;aUH_Jz@UbAm&<`K%p`#6uY|o?O;wph-fC$ss42m@s6;TK4-#K(^m7YC=A==sA z9vvR8c0FSEq1DmRdGqGY_iV+>pOK2}+LeRT)A#m`qfB`*MK?A##l^%J6cX2#m;JW! zuES9ch;dXRzkd%_rt#c{Q&9wlu(X0V}_Z3w*flmwh@ZqaEJ$(kF zVzQ>D=Gw-F0ipP=dY0WvuP6;U4>va^78bi+eQi#TZ2AR$B%LCol)JmT?ca-Q%)rKG zeqzGR%q*~Q*o?c3K~Y}5XKqf2p573I6(1j8OiWBwRh6!;ZgO(6tgI}+Oy(h_;c%ub zaOZTnrG}gw@Ht0hSFOY5vr83%aHq|5Q6KlSL!D}SW&wd(P&?-*`APs$L;6uFXVYat*6CIC!VZ;ucI^TusOCkzeYz#x6~ez zmzO7wL4@gie#}|DwXy<>YG1Z(IR1f$Xav5nwz7h~z!qnwrsNzucGc9?XKS5d1g$U5 zPcXV35Y3sl46WM(;fss6oSvQn9o)vb{pbC6v$C7h_8B!bt_lhYpsA##JD^Rw zySqVs(%EIe8Ln?{6X4?J=H-D>&M7RMt8@L9oy~YE%4BD^XK&C1B?czy?eCY$%asbD zbU@7sIyoI}ZEXSEgZ}w*cJzpcCw<51%^PMGmTLR;>lT$cs@Z?p@bTlvAt524hM}*I zZC+gW9#~D`cj||$qr-HiH=gj801hD`WAw}WO%2;$;#-O*w}8auSY<}sGRn%zc=`Bp zb8}&0e*<~I+`z*?9l-W9pNNPcg4_5!F9bZUF_v=j^G`Q7`}CQ-(9!}>q{F%WQBF^f zCaFbTL!;<<`Gzl{5Oiv?fU~W>J}u8c3)fOd_ec<-6w#e~_bjK%%;6zWb*TMXqkJqo zOl!&HR%2r$kca+!-HWgKO<*Om^ul4;o&e%zw&p+k7Kew2>yLi~M?_qY&zNIbn5{MQ zqQyzi&JJ)78tm#~W?(Qe`;Ct~?C+Ybm_wfcAQEkT z{rZD^59v+T5Kf2nZ=Uh?-z5C~n`2`Wd;4A=ij1pJMWf)kWL@Z@q&NmPA~pMHCkCyd zw08GuHmveu11Z7D#5-Ve*hCw#fdS4z4A1L5W4vv7IVuq)1H z8i%&}Ij$&_pT34@?u(u}x0j+Z|@o)2wKjuR&OM-f^%1$N(6>=Kcdj~V&-hm)l| z_9rL%<4!vx1UZR|*xb~Q2ltt)dyR%4a4l#>QxCqrLxkJ5zP^m!{3iOi78e0|+1KyKhQCS@p- zTm60h8Zjo)MXD?4yURTdM+Z3ma-&}{;H9dnqnaAy8^HtQx>YK&b;&Qma4HWE?+mYV zU66ZAW$4tt4R8@`0ploE>oME6BpB{2%5pu(xz@A6$D!>xFEtq(o2KyaqhBvxyc--gSo+gy zQi?#Fp3>kar7z+NWQj5TM-zDePxt%3%KSxVgCzh=|C@ zfajg}^$)iuK?j`A^ZEGpEMH6dx`>%1^j?AH;RuUAwl+ICijzXPs(WeoOY9YjkG#CR zGG&dA|8epE*~h`YC*}M1?;|22z#2|i9RgW^rc2Gsa|OX>)9~l;cz20`fx%1@q#AH@ zS0tn7+4du69egYdgp!t)Gay5Ew;W}NiJ95)$!ZFSI;s%u5+hl~0nf`Q-zNPVl$2n= z-OqPB;^M$9f?lX|Ju(o#BV}%3(GMyY;1uA^Oylj_V|aA2zM`U{u&}VJt7|+zcv(@< z&)Cv zcjZm`K7rX}XKevq$bOozvbczbXark(mGsull7m$eb`B2ILX)rMSUwncK9BRtk`mk3 zukWV}q<{m<$S}0G=RQU8c!GE}FuKWet- zTWTs|`bU#5HpCBM9gsYf6&Fud*_ld9V^7^h2E*mx;DCpRch^2Wqfobwl8np&_^P$F z)uT?rJ#$0V>)qDEf_~YX*=h%f0@n7{zi01a1hpa%P?-9Yl>~4#jCb!E8yUTIacOUD zT|imu)HrVM=!ki)=F)-#76*3aL zmb^hRFBg~Xa(6U<=$eSL4vvq6q@?@Fax4%B^)+c79e3Cm6^~V5SXk^_HGpkwtOmFj zaK=+Ay1MK{IBxFlHZzqlWyh|vP<1%+tu5_m&!ikpgZ}R1$s|U=z^b&Q!T!^FfykJEL=G^Ghs9_Nplq1T9Is0wRqwONr%141COAf_(g*o4yFhYQ*4AwX z#Rl?061T6^-H?xAt#Uiz@(_K)@&o->33flYe?PIb;9$J^-Hb4yPh7^`AkK$?cr+Ly zWq*3q*LHeP-)sx#(FS6Mwm0XdxTJpnV`1UG^;B7AW+v1qXk5cYLtTBe^3Br7$Vi}7 zT}=%?C+C~)DCWwCfP~+#N?);KW2AZD8&A4v;R~3o(Bg3qgX{a&sy+a)=0B_2 z*kZ&L%c`{piV%EFn$p`pr@sYV4}V=W!|LZ`x2;9A5xR%^*0bH+@0;`iTo$Nc){nq- zpX{$LQNgs;y_&6_n9vkTDdNrkw|!StR^I*n8%~&+oqc8hq)4|;PDbWSe!h0KeU8kX z_kn?$B}QE%IjU#~G&D5GH#G{i(GW~)ln*VUii%KxArH8?K={G@7V6X>Nl55z=DZXx zzzjiV#fA*tMXdl4%vQef?UbBM6_GY0- zZ#yBjw2&x6rlq8+N^cu1aXVsbXg%^`Ccw_o5wZtG85sz>V7}@-FFn-MMlxk1`%{E3 zLBti+pW+fw@jF7PETO4D&E}@!&32*c&)6S5a{9e7n&Nrk{PN{XP0cvaCQG$gkz)@{`>96)|4cCB-`2=s%EZ(!!A^gQ?&^95B6Pmi`Fl&tQt5z@yqw$= zn6!=2yexXC=`RwwD>Bj%e0=VE?Rw#ijEshIEdZ$h_WX26SFuV~6;y@_Z=M$3~xtx+xc&qq*b5b>G0(-^)GWwa&n&xK&glz$CAYKlrfl_tHm*h>3|wN=iydwCba} ze<6}p&=4ZBvR$pMKhIDN13f*idq0CDP}5B8E;ba({`4LL&lsenq(J>bg}Ge2kmPkP zzu%9H@$>QFAe9I#rAC+^^7FqiK&#a%8DfMS2$p<31U3h{_V~wbH}J3f&{%G6@Jtt% z(+ugb{=~=PZr?$J2Zn~~f)R!z<9_%sh>%+M15-=aJFC0b{e6Dij<@55+QV*>lOeyU zhnxV_aG4yXKt+`x9&pXr#KhzGs0NMac`;z%GgiTf8z=tslHipu-vgnFCHfYzWB`KP-RofTB=|r6Nar+c zkBg6=g*Y0Tu&&OXmJ8A%mV5VL&zaF55DSdd2!#GONhG^Alg=~-4kcb$Vg~8d!fm=#GyFEfXs%7#4sz$RrYYteaT^q_5L&kQCBr + + + + + + +CXXGraph: CXXGRAPH::PARTITIONING::PartitionState< T > Class Template Reference + + + + + + + + + +
+
+ + + + + + + +
+
CXXGraph +  0.1.6 +
+
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Public Member Functions | +List of all members
+
+
CXXGRAPH::PARTITIONING::PartitionState< T > Class Template Referenceabstract
+
+
+
+Inheritance diagram for CXXGRAPH::PARTITIONING::PartitionState< T >:
+
+
Inheritance graph
+ + + + +
[legend]
+ + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

+virtual Record< T > & getRecord (int x)=0
 
+virtual int getMachineLoad (int m)=0
 
+virtual void incrementMachineLoad (int m, Edge< T > e)=0
 
+virtual int getMinLoad ()=0
 
+virtual int getMaxLoad ()=0
 
+virtual std::vector< int > getMachines_load ()=0
 
+virtual int getTotalReplicas ()=0
 
+virtual int getNumVertices ()=0
 
+virtual std::set< int > getVertexIds ()=0
 
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/docs/html/df/d71/classCXXGRAPH_1_1UndirectedEdge.html b/docs/html/df/d71/classCXXGRAPH_1_1UndirectedEdge.html index 18d64ef41..84d1c273f 100644 --- a/docs/html/df/d71/classCXXGRAPH_1_1UndirectedEdge.html +++ b/docs/html/df/d71/classCXXGRAPH_1_1UndirectedEdge.html @@ -148,8 +148,9 @@ std::ostream & operator<< (std::ostream &os, const UndirectedEdge< T > &edge)   -
The documentation for this class was generated from the following file: