Updates for performance and ease of moving to constexpr later, C++26 or using a constexpr set lib

Author: OlekRaymond

include/CXXGraph/Edge/DirectedEdge.h

@@ -17,11 +17,11 @@
 /***	 License: MPL v2.0 ***/
 /***********************************************************/
 
-#ifndef __CXXGRAPH_DIRECTEDEDGE_H__
-#define __CXXGRAPH_DIRECTEDEDGE_H__
+#ifndef CXXGRAPH_DIRECTEDEDGE_H
+#define CXXGRAPH_DIRECTEDEDGE_H
 
 #pragma once
 
 #include "DirectedEdge_impl.hpp"
 
-#endif  // __CXXGRAPH_DIRECTEDEDGE_H__
+#endif  // CXXGRAPH_DIRECTEDEDGE_H

include/CXXGraph/Graph/Graph_impl.hpp

@@ -31,28 +31,21 @@
 namespace CXXGraph {
 
 using std::make_shared;
-using std::make_unique;
 
 template <typename T>
-Graph<T>::Graph() {
-  /* Caching the adjacency matrix */
-  cacheAdjMatrix();
-  cacheDegreeMatrix();
-  cacheLaplacianMatrix();
-  cacheTransitionMatrix();
-}
+Graph<T>::Graph()
+    : cachedAdjMatrix(Graph<T>::getAdjMatrix()),
+      cachedDegreeMatrix(Graph<T>::getDegreeMatrix()),
+      cachedLaplacianMatrix(Graph<T>::getLaplacianMatrix()),
+      cachedTransitionMatrix(Graph<T>::getTransitionMatrix()) {}
 
 template <typename T>
-Graph<T>::Graph(const T_EdgeSet<T> &edgeSet) {
-  for (auto edgeIt : edgeSet) {
-    this->edgeSet.insert(edgeIt);
-  }
-  /* Caching the adjacency matrix */
-  cacheAdjMatrix();
-  cacheDegreeMatrix();
-  cacheLaplacianMatrix();
-  cacheTransitionMatrix();
-}
+Graph<T>::Graph(const T_EdgeSet<T> &edgeSetToCopy)
+    : edgeSet(edgeSetToCopy),
+      cachedAdjMatrix(Graph<T>::getAdjMatrix()),
+      cachedDegreeMatrix(Graph<T>::getDegreeMatrix()),
+      cachedLaplacianMatrix(Graph<T>::getLaplacianMatrix()),
+      cachedTransitionMatrix(Graph<T>::getTransitionMatrix()) {}
 
 template <typename T>
 const T_EdgeSet<T> &Graph<T>::getEdgeSet() const {