Refactor: added invalidateCache() for core cache rebuilding (Issue 499)

Author: V1102D

include/CXXGraph/CXXGraphConfig.h

@@ -1,4 +1,4 @@
-// the configured options and settings for CXXGraph
-#define CXXGraph_VERSION_MAJOR 4
-#define CXXGraph_VERSION_MINOR 1
-#define CXXGraph_VERSION_PATCH 0
+// the configured options and settings for CXXGraph
+#define CXXGraph_VERSION_MAJOR 4
+#define CXXGraph_VERSION_MINOR 1
+#define CXXGraph_VERSION_PATCH 0

include/CXXGraph/Graph/Graph_decl.h

@@ -573,10 +573,9 @@ class Graph {
   virtual std::shared_ptr<std::vector<Node<T>>> eulerianPath() const;
 
   /**
-   * @brief Function runs the dijkstra algorithm with inverted metric for some source node and
-   * target node in the graph and returns the longest distance of target
-   * from the source (called critical path).
-   * Note: No Thread Safe
+   * @brief Function runs the dijkstra algorithm with inverted metric for some
+   * source node and target node in the graph and returns the longest distance
+   * of target from the source (called critical path). Note: No Thread Safe
    *
    * @param source source vertex
    * @param target target vertex
@@ -585,9 +584,8 @@ class Graph {
    * case if target is not reachable from source or there is error in the
    * computation.
    */
-  virtual const DijkstraResult criticalpath_deterministic(const Node<T>& source, 
-                                                          const Node<T>& target) const;
-
+  virtual const DijkstraResult criticalpath_deterministic(
+      const Node<T> &source, const Node<T> &target) const;
 
   /**
    * @brief Function runs the dijkstra algorithm for some source node and