Fix CXXGraph::Graph object to have symmetry (parity) in signature for… (#542)

* Fix CXXGraph::Graph object to have symmetry (parity) in signature for (add, remove) x (nodes, edges)
Fixes #506

* Fixed Test for DOT and MTX

* Fix A success flag when addEdge fails would be useful change to this API
Fixes #521

Author: ZigRazor

README.md

@@ -13,24 +13,24 @@
 
 [![GitHub license](https://img.shields.io/github/license/ZigRazor/CXXGraph.svg)](https://github.com/ZigRazor/CXXGraph/blob/master/LICENSE) [![GitHub release](https://img.shields.io/github/release/ZigRazor/CXXGraph.svg)](https://GitHub.com/ZigRazor/CXXGraph/releases/) [![Conan Center](https://img.shields.io/conan/v/cxxgraph)](https://conan.io/center/recipes/cxxgraph)
 
-[![Generic badge](https://img.shields.io/badge/Required-G++7.3.0-Green.svg)](https://shields.io/) [![Generic badge](https://img.shields.io/badge/required-C++17-Green.svg)](https://shields.io/) [![Generic badge](https://img.shields.io/badge/Required-CMake3.9-Green.svg)](https://shields.io/) 
+[![Generic badge](https://img.shields.io/badge/Required-G++7.3.0-Green.svg)](https://shields.io/) [![Generic badge](https://img.shields.io/badge/required-C++17-Green.svg)](https://shields.io/) [![Generic badge](https://img.shields.io/badge/Required-CMake3.9-Green.svg)](https://shields.io/)
 
 [![Generic badge](https://img.shields.io/badge/Build-Passed-Green.svg)](https://shields.io/) [![Generic badge](https://img.shields.io/badge/UnitTest-Passed-Green.svg)](https://shields.io/)
 
 ## Introduction
+
 **CXXGraph** is a comprehensive C++ library that manages graph algorithms. This header-only library serves as an alternative to the [Boost Graph Library (BGL)](https://www.boost.org/doc/libs/1_77_0/libs/graph/doc/index.html).
 
 [CXXGraph Website](https://zigrazor.github.io/CXXGraph/)
 
-## We are Looking for...
+## We are Looking for
 
 **We are looking for:**
 
 - **A Web Developer** for the development of the CXXGraph website. All documentation is currently hosted on this GitHub page.
 - **Developers and Contributors** to provide input. If you are new to the open-source world, we will guide you step by step!
 
-If you are interested, please contact us at zigrazor@gmail.com or contribute to this project. We are waiting for you!
-
+If you are interested, please contact us at <zigrazor@gmail.com> or contribute to this project. We are waiting for you!
 
 ## Table of Contents
 
@@ -73,7 +73,6 @@ If you are interested, please contact us at zigrazor@gmail.com or contribute to
   - [Other Details](#other-details)
   - [Author](#author)
 
-
 ## Install and Uninstall
 
 ### Install Linux Tarballs
@@ -114,14 +113,14 @@ For self-compiled installations using CMake, execute the following from the comm
 
 ## Prerequisites
 
-- The minimum C++ standard required is **C++17** 
+- The minimum C++ standard required is **C++17**
 - A GCC compiler version 7.3.0 and later *OR* a MSVC compiler that supports C++17
 
 ## How to use
 
 To use the library **simply include the header file `CXXGraph.hpp`**, (make sure to add the [include folder](https://github.com/ZigRazor/CXXGraph/tree/master/include) to your compiler's inlcude path).
 
-CXXGraph revolves around the graph object which contains nodes and edges. This object can then be manipulated with a wide variety of algorithms. Please see the [examples section](#examples), [examples folder](https://github.com/ZigRazor/CXXGraph/tree/master/examples) and [website](https://zigrazor.github.io/CXXGraph/) for more information 
+CXXGraph revolves around the graph object which contains nodes and edges. This object can then be manipulated with a wide variety of algorithms. Please see the [examples section](#examples), [examples folder](https://github.com/ZigRazor/CXXGraph/tree/master/examples) and [website](https://zigrazor.github.io/CXXGraph/) for more information
 
 ## Examples
 
@@ -136,9 +135,9 @@ int main(){
   CXXGraph::Node<int> nodeB("B", 2);
   CXXGraph::Node<int> nodeC("C", 3);
 
-  CXXGraph::DirectedWeightedEdge<int> edge1(1, nodeA, nodeB, 1);
-  CXXGraph::DirectedWeightedEdge<int> edge2(2, nodeB, nodeC, 1);
-  CXXGraph::UndirectedWeightedEdge<int> edge3(3, nodeA, nodeC, 6);
+  CXXGraph::DirectedWeightedEdge<int> edge1("1", nodeA, nodeB, 1);
+  CXXGraph::DirectedWeightedEdge<int> edge2("2", nodeB, nodeC, 1);
+  CXXGraph::UndirectedWeightedEdge<int> edge3("3", nodeA, nodeC, 6);
 
   CXXGraph::T_EdgeSet<int> edgeSet;
   edgeSet.insert(make_shared<CXXGraph::DirectedWeightedEdge<int>>(edge1));
@@ -156,7 +155,6 @@ int main(){
 
 See more examples in the [examples folder](https://github.com/ZigRazor/CXXGraph/tree/master/examples).
 
-
 ## Unit-Test Execution
 
 The Unit-Test requires CMake 3.9 and later, and the **[GoogleTest](https://github.com/google/googletest)**  library.
@@ -188,7 +186,7 @@ make                 # Compile
 
 ### How to Run GoogleTest
 
-After the build has compiled, run the "test_exe" executable in the "build" directory with the following command: 
+After the build has compiled, run the "test_exe" executable in the "build" directory with the following command:
 
 `./test_exe`
 
@@ -232,7 +230,7 @@ make                       # Compile
 
 ### How to Run Google Benchmark
 
-After the build has compiled, run the "benchmark" executable in the "build" directory with the following command: 
+After the build has compiled, run the "benchmark" executable in the "build" directory with the following command:
 
 `./benchmark`
 
@@ -288,6 +286,7 @@ Both the [Doxygen documentation](https://rawcdn.githack.com/ZigRazor/CXXGraph/ma
 The Classes Explanation can be found in the [classes section](https://rawcdn.githack.com/ZigRazor/CXXGraph/master/docs/html/classes.html) of the [Doxygen documentation](https://rawcdn.githack.com/ZigRazor/CXXGraph/master/docs/html/index.html).
 
 #### Network Dynamics
+
 More information can be found [here](https://zigrazor.github.io/CXXGraph/component-explanation/network-dynamics).
 
 - Adjacency Matrix
@@ -296,8 +295,10 @@ More information can be found [here](https://zigrazor.github.io/CXXGraph/compone
 - Transition Matrix
 
 ### Algorithms
-The following is a list of all the implemented algorithms, more information on the algorithms can be found [here](https://zigrazor.github.io/CXXGraph/component-explanation/regular-algorithm). 
-#### Graph Traversal Algorithms.
+
+The following is a list of all the implemented algorithms, more information on the algorithms can be found [here](https://zigrazor.github.io/CXXGraph/component-explanation/regular-algorithm).
+
+#### Graph Traversal Algorithms
 
 - Breadth First Search (BFS)
 - Depth First Search (DFS)
@@ -336,24 +337,25 @@ The following is a list of all the implemented algorithms, more information on t
 - Tarjan’s Algorithm (DFS-based topological sorting)
 
 #### Eulerian Path/Cycle Detection
+
 - Hierholzer's Algorithm
 
 #### Graph Transformation
+
 - Transitive Reduction (reduce graph to essential edges while preserving reachability)
 
 #### Graph Coloring Algorithms
-- Welsh–Powell Coloring Algorithm
 
+- Welsh–Powell Coloring Algorithm
 
 #### Partition Algorithms
+
 - Vertex-Cut
 - Edge Balanced Vertex-Cut
 - Edge Balanced Vertex-Cut based on this [paper](https://arxiv.org/abs/2010.09007)
 - Greedy Vertex-Cut
 - High Degree Replicated First
 
-
-
 ## How to contribute
 
 [![GitHub contributors](https://img.shields.io/github/contributors/ZigRazor/CXXGraph.svg)](https://GitHub.com/ZigRazor/CXXGraph/graphs/contributors/)
@@ -362,7 +364,6 @@ If you want to change the code, fix an issue, or implement a new feature please
 
 If you want to discuss new features or you have any questions or suggestions about the library, please open a [Discussion](https://github.com/ZigRazor/CXXGraph/discussions) or simply chat on [![Join the chat at https://gitter.im/CXXGraph-Community/community](https://badges.gitter.im/CXXGraph-Community/community.svg)](https://gitter.im/CXXGraph-Community/community?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)
 
-
 ## Roadmap
 
 | Completed | Description | Date of Completition |
@@ -384,7 +385,7 @@ If you want to discuss new features or you have any questions or suggestions abo
 
 ## Contact
 
-E-mail : zigrazor@gmail.com
+E-mail : <zigrazor@gmail.com>
 
 [![Join the chat at https://gitter.im/CXXGraph-Community/community](https://badges.gitter.im/CXXGraph-Community/community.svg)](https://gitter.im/CXXGraph-Community/community?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge)
 
@@ -416,11 +417,11 @@ Thanks to [GeeksForGeeks](https://www.geeksforgeeks.org/) for some algorithm ins
 
 Thank you to all the people who have already contributed to CXXGraph!
 
-[![Contributors](https://contrib.rocks/image?repo=zigrazor/CXXGraph)](https://github.com/ZigRazor/CXXGraph/graphs/contributors) 
+[![Contributors](https://contrib.rocks/image?repo=zigrazor/CXXGraph)](https://github.com/ZigRazor/CXXGraph/graphs/contributors)
 
 ## Cited By
 
-- Ruizhe Wang, Meng Xu, and N. Asokan. 2024. SeMalloc: Semantics-Informed Memory Allocator. In Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security (CCS '24). Association for Computing Machinery, New York, NY, USA, 1375–1389. https://doi.org/10.1145/3658644.3670363
+- Ruizhe Wang, Meng Xu, and N. Asokan. 2024. SeMalloc: Semantics-Informed Memory Allocator. In Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security (CCS '24). Association for Computing Machinery, New York, NY, USA, 1375–1389. <https://doi.org/10.1145/3658644.3670363>
 
 ## Cite Us
 
@@ -437,4 +438,3 @@ View the [Estimated Value of the Project](https://www.openhub.net/p/CXXGraph/est
 
 | [<img src="https://avatars0.githubusercontent.com/u/6591180?s=460&v=4" width="100"><br><sub>@ZigRazor</sub>](https://github.com/ZigRazor) |
 |:----:|
-

benchmark/Edge_BM.cpp

@@ -8,7 +8,7 @@ static void BM_EdgeCreation(benchmark::State &state) {
   auto n1 = *nodes.at(0);
   auto n2 = *nodes.at(1);
   for (auto _ : state) {
-    CXXGraph::Edge<int> e(1, n1, n2);
+    CXXGraph::Edge<int> e("1", n1, n2);
   }
   state.SetComplexityN(2);
 }
@@ -21,7 +21,7 @@ static void EdgeCreationDestruction_new_delete(benchmark::State &state) {
   auto n2 = *nodes.at(1);
   CXXGraph::Edge<int> *e;
   for (auto _ : state) {
-    e = new CXXGraph::Edge<int>(1, n1, n2);
+    e = new CXXGraph::Edge<int>("1", n1, n2);
     delete e;
   }
   state.SetComplexityN(2);
@@ -33,7 +33,7 @@ static void EdgeGetId(benchmark::State &state) {
   auto nodes = generateRandomNodes(2, 2);
   auto n1 = *nodes.at(0);
   auto n2 = *nodes.at(1);
-  CXXGraph::Edge<int> e(1, n1, n2);
+  CXXGraph::Edge<int> e("1", n1, n2);
   for (auto _ : state) {
     e.getId();
   }
@@ -45,7 +45,7 @@ static void NodeGetNodePair(benchmark::State &state) {
   auto nodes = generateRandomNodes(2, 2);
   auto n1 = *nodes.at(0);
   auto n2 = *nodes.at(1);
-  CXXGraph::Edge<int> e(1, n1, n2);
+  CXXGraph::Edge<int> e("1", n1, n2);
   for (auto _ : state) {
     e.getNodePair();
   }

benchmark/FloydWarshall_BM.cpp

@@ -14,11 +14,11 @@ static void BM_FWDirected(benchmark::State &state) {
   CXXGraph::Node<int> node3("3", 3);
   CXXGraph::Node<int> node4("4", 4);
 
-  CXXGraph::DirectedWeightedEdge<int> edge1(1, node2, node1, 4);
-  CXXGraph::DirectedWeightedEdge<int> edge2(2, node1, node3, -2);
-  CXXGraph::DirectedWeightedEdge<int> edge3(3, node3, node4, 2);
-  CXXGraph::DirectedWeightedEdge<int> edge4(4, node4, node2, -1);
-  CXXGraph::DirectedWeightedEdge<int> edge5(3, node2, node3, 3);
+  CXXGraph::DirectedWeightedEdge<int> edge1("1", node2, node1, 4);
+  CXXGraph::DirectedWeightedEdge<int> edge2("2", node1, node3, -2);
+  CXXGraph::DirectedWeightedEdge<int> edge3("3", node3, node4, 2);
+  CXXGraph::DirectedWeightedEdge<int> edge4("4", node4, node2, -1);
+  CXXGraph::DirectedWeightedEdge<int> edge5("3", node2, node3, 3);
 
   CXXGraph::T_EdgeSet<int> edgeSet;
   edgeSet.insert(make_shared<CXXGraph::DirectedWeightedEdge<int>>(edge1));
@@ -40,9 +40,9 @@ static void BM_FWNegCycle(benchmark::State &state) {
   CXXGraph::Node<int> node0("0", 0);
   CXXGraph::Node<int> node1("1", 1);
   CXXGraph::Node<int> node2("2", 2);
-  CXXGraph::DirectedWeightedEdge<int> edge1(1, node0, node1, 2);
-  CXXGraph::DirectedWeightedEdge<int> edge2(2, node1, node2, 3);
-  CXXGraph::DirectedWeightedEdge<int> edge3(3, node2, node0, -7);
+  CXXGraph::DirectedWeightedEdge<int> edge1("1", node0, node1, 2);
+  CXXGraph::DirectedWeightedEdge<int> edge2("2", node1, node2, 3);
+  CXXGraph::DirectedWeightedEdge<int> edge3("3", node2, node0, -7);
   CXXGraph::T_EdgeSet<int> edgeSet;
   edgeSet.insert(make_shared<CXXGraph::DirectedWeightedEdge<int>>(edge1));
   edgeSet.insert(make_shared<CXXGraph::DirectedWeightedEdge<int>>(edge2));
@@ -61,9 +61,9 @@ static void BM_FWUndirectedWeighted(benchmark::State &state) {
   CXXGraph::Node<int> node3("3", 3);
   std::pair<const CXXGraph::Node<int> *, const CXXGraph::Node<int> *> pairNode(
       &node1, &node2);
-  CXXGraph::DirectedWeightedEdge<int> edge1(1, pairNode, 1);
-  CXXGraph::DirectedWeightedEdge<int> edge2(2, node2, node3, 1);
-  CXXGraph::UndirectedWeightedEdge<int> edge3(3, node1, node3, 6);
+  CXXGraph::DirectedWeightedEdge<int> edge1("1", pairNode, 1);
+  CXXGraph::DirectedWeightedEdge<int> edge2("2", node2, node3, 1);
+  CXXGraph::UndirectedWeightedEdge<int> edge3("3", node1, node3, 6);
   CXXGraph::T_EdgeSet<int> edgeSet;
   edgeSet.insert(make_shared<CXXGraph::DirectedWeightedEdge<int>>(edge1));
   edgeSet.insert(make_shared<CXXGraph::DirectedWeightedEdge<int>>(edge2));
@@ -82,9 +82,9 @@ static void BM_FWNoWeighted(benchmark::State &state) {
   CXXGraph::Node<int> node3("3", 3);
   std::pair<const CXXGraph::Node<int> *, const CXXGraph::Node<int> *> pairNode(
       &node1, &node2);
-  CXXGraph::DirectedWeightedEdge<int> edge1(1, pairNode, 1);
-  CXXGraph::DirectedWeightedEdge<int> edge2(2, node2, node3, 1);
-  CXXGraph::DirectedEdge<int> edge3(3, node1, node3);
+  CXXGraph::DirectedWeightedEdge<int> edge1("1", pairNode, 1);
+  CXXGraph::DirectedWeightedEdge<int> edge2("2", node2, node3, 1);
+  CXXGraph::DirectedEdge<int> edge3("3", node1, node3);
   CXXGraph::T_EdgeSet<int> edgeSet;
   edgeSet.insert(make_shared<CXXGraph::DirectedWeightedEdge<int>>(edge1));
   edgeSet.insert(make_shared<CXXGraph::DirectedWeightedEdge<int>>(edge2));

benchmark/Graph_BM.cpp

@@ -18,7 +18,7 @@ static void AddEdge(benchmark::State &state) {
   CXXGraph::Graph<int> g;
   auto n1 = *nodes.at(0);
   auto n2 = *nodes.at(1);
-  CXXGraph::Edge<int> e(1, n1, n2);
+  CXXGraph::Edge<int> e("1", n1, n2);
   for (auto _ : state) {
     g.addEdge(&e);
   }

benchmark/Utilities.hpp

@@ -42,7 +42,8 @@ static std::map<unsigned long, CXXGraph::Edge<int> *> generateRandomEdges(
     randomNumber1 = (distribution(rand) % MaxValue);
     randomNumber2 = (distribution(rand) % MaxValue);
     CXXGraph::Edge<int> *newEdge = new CXXGraph::Edge<int>(
-        index, *(nodes.at(randomNumber1)), *(nodes.at(randomNumber2)));
+        std::to_string(index), *(nodes.at(randomNumber1)),
+        *(nodes.at(randomNumber2)));
     edges[index] = newEdge;
   }
   return edges;
@@ -67,7 +68,8 @@ generateRandomUndirectedEdges(
     randomNumber1 = (distribution(rand) % MaxValue);
     randomNumber2 = (distribution(rand) % MaxValue);
     CXXGraph::UndirectedEdge<int> *newEdge = new CXXGraph::UndirectedEdge<int>(
-        index, *(nodes.at(randomNumber1)), *(nodes.at(randomNumber2)));
+        std::to_string(index), *(nodes.at(randomNumber1)),
+        *(nodes.at(randomNumber2)));
     edges[index] = newEdge;
   }
   return edges;

examples/DijkstraExample/dijkstra_example.cpp

@@ -9,10 +9,10 @@ int main() {
   CXXGraph::Node<int> node2("2", 2);
   CXXGraph::Node<int> node3("3", 3);
 
-  CXXGraph::DirectedWeightedEdge<int> edge1(1, node1, node2, 2.0);
-  CXXGraph::DirectedWeightedEdge<int> edge2(2, node2, node3, 2.0);
-  CXXGraph::DirectedWeightedEdge<int> edge3(3, node0, node1, 2.0);
-  CXXGraph::DirectedWeightedEdge<int> edge4(4, node0, node3, 1.0);
+  CXXGraph::DirectedWeightedEdge<int> edge1("1", node1, node2, 2.0);
+  CXXGraph::DirectedWeightedEdge<int> edge2("2", node2, node3, 2.0);
+  CXXGraph::DirectedWeightedEdge<int> edge3("3", node0, node1, 2.0);
+  CXXGraph::DirectedWeightedEdge<int> edge4("4", node0, node3, 1.0);
 
   CXXGraph::T_EdgeSet<int> edgeSet;
   edgeSet.insert(make_shared<CXXGraph::DirectedWeightedEdge<int>>(edge1));

examples/FloydWarshallExample/floyd_warshall.cpp

@@ -11,12 +11,12 @@ int main() {
   CXXGraph::Node<int> node3("3", 3);
   CXXGraph::Node<int> node4("4", 4);
 
-  CXXGraph::UndirectedWeightedEdge<int> edge1(1, node0, node1, 1);
-  CXXGraph::UndirectedWeightedEdge<int> edge2(2, node0, node2, 2);
-  CXXGraph::UndirectedWeightedEdge<int> edge3(3, node1, node2, 6);
-  CXXGraph::UndirectedWeightedEdge<int> edge4(4, node1, node3, 4);
-  CXXGraph::UndirectedWeightedEdge<int> edge5(5, node2, node3, 5);
-  CXXGraph::UndirectedWeightedEdge<int> edge6(6, node3, node4, 3);
+  CXXGraph::UndirectedWeightedEdge<int> edge1("1", node0, node1, 1);
+  CXXGraph::UndirectedWeightedEdge<int> edge2("2", node0, node2, 2);
+  CXXGraph::UndirectedWeightedEdge<int> edge3("3", node1, node2, 6);
+  CXXGraph::UndirectedWeightedEdge<int> edge4("4", node1, node3, 4);
+  CXXGraph::UndirectedWeightedEdge<int> edge5("5", node2, node3, 5);
+  CXXGraph::UndirectedWeightedEdge<int> edge6("6", node3, node4, 3);
 
   CXXGraph::T_EdgeSet<int> edgeSet;
   edgeSet.insert(make_shared<CXXGraph::UndirectedWeightedEdge<int>>(edge1));

examples/NetworkDynamicsExample/network_dynamics_example.cpp

@@ -10,10 +10,10 @@ int main() {
   CXXGraph::Node<int> node2("2", 2);
   CXXGraph::Node<int> node3("3", 3);
 
-  CXXGraph::UndirectedWeightedEdge<int> edge1(1, node1, node2, 2.0);
-  CXXGraph::UndirectedWeightedEdge<int> edge2(2, node2, node3, 2.0);
-  CXXGraph::UndirectedWeightedEdge<int> edge3(3, node0, node1, 2.0);
-  CXXGraph::UndirectedWeightedEdge<int> edge4(4, node0, node3, 1.0);
+  CXXGraph::UndirectedWeightedEdge<int> edge1("1", node1, node2, 2.0);
+  CXXGraph::UndirectedWeightedEdge<int> edge2("2", node2, node3, 2.0);
+  CXXGraph::UndirectedWeightedEdge<int> edge3("3", node0, node1, 2.0);
+  CXXGraph::UndirectedWeightedEdge<int> edge4("4", node0, node3, 1.0);
 
   CXXGraph::T_EdgeSet<int> edgeSet;
   edgeSet.insert(make_shared<CXXGraph::UndirectedWeightedEdge<int>>(edge1));

examples/PrimExample/prim_example.cpp

@@ -17,21 +17,21 @@ int main() {
   CXXGraph::Node<int> node7("7", 7);
   CXXGraph::Node<int> node8("8", 8);
 
-  CXXGraph::UndirectedWeightedEdge<int> edge1(1, node0, node1, 4);
-  CXXGraph::UndirectedWeightedEdge<int> edge2(2, node0, node7, 8);
-  CXXGraph::UndirectedWeightedEdge<int> edge3(3, node1, node7, 11);
-  CXXGraph::UndirectedWeightedEdge<int> edge4(4, node1, node2, 8);
-  CXXGraph::UndirectedWeightedEdge<int> edge5(5, node2, node8, 2);
-  CXXGraph::UndirectedWeightedEdge<int> edge6(6, node2, node5, 4);
-  CXXGraph::UndirectedWeightedEdge<int> edge7(7, node2, node3, 7);
-  CXXGraph::UndirectedWeightedEdge<int> edge8(8, node3, node3, 1);
-  CXXGraph::UndirectedWeightedEdge<int> edge9(9, node3, node4, 9);
-  CXXGraph::UndirectedWeightedEdge<int> edge10(10, node3, node5, 14);
-  CXXGraph::UndirectedWeightedEdge<int> edge11(11, node4, node5, 10);
-  CXXGraph::UndirectedWeightedEdge<int> edge12(12, node5, node6, 2);
-  CXXGraph::UndirectedWeightedEdge<int> edge13(13, node6, node8, 6);
-  CXXGraph::UndirectedWeightedEdge<int> edge14(14, node6, node7, 1);
-  CXXGraph::UndirectedWeightedEdge<int> edge15(15, node7, node8, 7);
+  CXXGraph::UndirectedWeightedEdge<int> edge1("1", node0, node1, 4);
+  CXXGraph::UndirectedWeightedEdge<int> edge2("2", node0, node7, 8);
+  CXXGraph::UndirectedWeightedEdge<int> edge3("3", node1, node7, 11);
+  CXXGraph::UndirectedWeightedEdge<int> edge4("4", node1, node2, 8);
+  CXXGraph::UndirectedWeightedEdge<int> edge5("5", node2, node8, 2);
+  CXXGraph::UndirectedWeightedEdge<int> edge6("6", node2, node5, 4);
+  CXXGraph::UndirectedWeightedEdge<int> edge7("7", node2, node3, 7);
+  CXXGraph::UndirectedWeightedEdge<int> edge8("8", node3, node3, 1);
+  CXXGraph::UndirectedWeightedEdge<int> edge9("9", node3, node4, 9);
+  CXXGraph::UndirectedWeightedEdge<int> edge10("10", node3, node5, 14);
+  CXXGraph::UndirectedWeightedEdge<int> edge11("11", node4, node5, 10);
+  CXXGraph::UndirectedWeightedEdge<int> edge12("12", node5, node6, 2);
+  CXXGraph::UndirectedWeightedEdge<int> edge13("13", node6, node8, 6);
+  CXXGraph::UndirectedWeightedEdge<int> edge14("14", node6, node7, 1);
+  CXXGraph::UndirectedWeightedEdge<int> edge15("15", node7, node8, 7);
 
   CXXGraph::T_EdgeSet<int> edgeSet;
   edgeSet.insert(make_shared<CXXGraph::UndirectedWeightedEdge<int>>(edge1));