Create clang-format workflow (#390)

* Create clang-format workflow * Fix typo * Formatting * Formatting
ZigRazor · Jan 15, 2024 · 92a8ea5 · 92a8ea5
1 parent e319dc5
commit 92a8ea5
Show file tree

Hide file tree

Showing 81 changed files with 483 additions and 409 deletions.
diff --git a/.github/workflows/clang_format.yml b/.github/workflows/clang_format.yml
@@ -0,0 +1,26 @@
+name: clang-format Check
+
+on:
+  push:
+    branches: [ "master" ]
+  pull_request:
+    branches: [ "master" ]
+
+jobs:
+  formatting-check:
+    name: Formatting Check
+    runs-on: ubuntu-latest
+    strategy:
+      matrix:
+        path:
+          - 'benchmark'
+          - 'examples'
+          - 'include/CXXGraph'
+          - 'test'
+    steps:
+    - uses: actions/checkout@v3
+    - name: Run clang-format style check
+      uses: jidicula/[email protected]
+      with:
+        clang-format-version: '16'
+        check-path: ${{ matrix.path }}
diff --git a/benchmark/BellmanFord_BM.cpp b/benchmark/BellmanFord_BM.cpp
@@ -30,4 +30,4 @@ static void BellmanFord_FromReadedCitHep(benchmark::State &state) {
   }
 }
 
-BENCHMARK(BellmanFord_FromReadedCitHep);
+BENCHMARK(BellmanFord_FromReadedCitHep);
diff --git a/benchmark/Boruvka_BM.cpp b/benchmark/Boruvka_BM.cpp
@@ -26,4 +26,4 @@ static void Boruvka_FromReadedCitHep(benchmark::State &state) {
   }
 }
 
-BENCHMARK(Boruvka_FromReadedCitHep);
+BENCHMARK(Boruvka_FromReadedCitHep);
diff --git a/benchmark/Connectivity_BM.cpp b/benchmark/Connectivity_BM.cpp
@@ -53,4 +53,4 @@ static void StrongConnectivity_FromReadedCitHep(benchmark::State &state) {
   }
 }
 
-BENCHMARK(StrongConnectivity_FromReadedCitHep);
+BENCHMARK(StrongConnectivity_FromReadedCitHep);
diff --git a/benchmark/CycleCheck_BM.cpp b/benchmark/CycleCheck_BM.cpp
@@ -53,4 +53,4 @@ static void CycleCheckDFS_FromReadedCitHep(benchmark::State &state) {
   }
 }
 
-BENCHMARK(CycleCheckDFS_FromReadedCitHep);
+BENCHMARK(CycleCheckDFS_FromReadedCitHep);
diff --git a/benchmark/Dial_BM.cpp b/benchmark/Dial_BM.cpp
@@ -27,4 +27,4 @@ static void Dial_FromReadedCitHep(benchmark::State &state) {
   }
 }
 
-BENCHMARK(Dial_FromReadedCitHep);
+BENCHMARK(Dial_FromReadedCitHep);
diff --git a/benchmark/Edge_BM.cpp b/benchmark/Edge_BM.cpp
@@ -47,4 +47,4 @@ static void NodeGetNodePair(benchmark::State &state) {
     e.getNodePair();
   }
 }
-BENCHMARK(NodeGetNodePair);
+BENCHMARK(NodeGetNodePair);
diff --git a/benchmark/FloydWarshall_BM.cpp b/benchmark/FloydWarshall_BM.cpp
@@ -1,4 +1,5 @@
 #include <benchmark/benchmark.h>
+
 #include <memory>
 
 #include "CXXGraph/CXXGraph.hpp"

diff --git a/benchmark/FordFulkerson_BM.cpp b/benchmark/FordFulkerson_BM.cpp
@@ -31,4 +31,4 @@ static void FordFulkerson_FromReadedCitHep(benchmark::State &state) {
   }
 }
 
-BENCHMARK(FordFulkerson_FromReadedCitHep);
+BENCHMARK(FordFulkerson_FromReadedCitHep);
diff --git a/benchmark/Kruskal_BM.cpp b/benchmark/Kruskal_BM.cpp
@@ -26,4 +26,4 @@ static void Kruskal_FromReadedCitHep(benchmark::State &state) {
   }
 }
 
-BENCHMARK(Kruskal_FromReadedCitHep);
+BENCHMARK(Kruskal_FromReadedCitHep);
diff --git a/benchmark/Node_BM.cpp b/benchmark/Node_BM.cpp
@@ -33,4 +33,4 @@ static void NodeGetData(benchmark::State &state) {
     n1.getData();
   }
 }
-BENCHMARK(NodeGetData);
+BENCHMARK(NodeGetData);
diff --git a/benchmark/Partition_BM.cpp b/benchmark/Partition_BM.cpp
@@ -113,4 +113,4 @@ static void PartitionEBV_FromReadedCitHep(benchmark::State &state) {
   }
 }
 
-BENCHMARK(PartitionEBV_FromReadedCitHep);
+BENCHMARK(PartitionEBV_FromReadedCitHep);
diff --git a/benchmark/Prim_BM.cpp b/benchmark/Prim_BM.cpp
@@ -26,4 +26,4 @@ static void Prim_FromReadedCitHep(benchmark::State &state) {
   }
 }
 
-BENCHMARK(Prim_FromReadedCitHep);
+BENCHMARK(Prim_FromReadedCitHep);
diff --git a/benchmark/main.cpp b/benchmark/main.cpp
@@ -1,3 +1,3 @@
 #include <benchmark/benchmark.h>
 
-BENCHMARK_MAIN();
+BENCHMARK_MAIN();
diff --git a/examples/DialExample/dial_example.cpp b/examples/DialExample/dial_example.cpp
@@ -1,7 +1,7 @@
 #include <math.h>
-#include <memory>
 
 #include <CXXGraph/CXXGraph.hpp>
+#include <memory>
 
 using std::make_shared;
 

diff --git a/examples/DijkstraExample/dijkstra_example.cpp b/examples/DijkstraExample/dijkstra_example.cpp
@@ -1,5 +1,4 @@
 #include <CXXGraph/CXXGraph.hpp>
-
 #include <memory>
 
 using std::make_shared;

diff --git a/examples/NetworkDynamicsExample/network_dynamics_example.cpp b/examples/NetworkDynamicsExample/network_dynamics_example.cpp
@@ -1,7 +1,7 @@
-#include "CXXGraph/CXXGraph.hpp"
-
 #include <memory>
 
+#include "CXXGraph/CXXGraph.hpp"
+
 using std::make_shared;
 
 int main() {
@@ -25,23 +25,26 @@ int main() {
 
   auto degreeMatrix = graph.getDegreeMatrix();
   for (const auto& nodePair : *degreeMatrix) {
-        const CXXGraph::shared<const CXXGraph::Node<int>>& node = nodePair.first;
-        const std::vector<int>& degrees = nodePair.second;
+    const CXXGraph::shared<const CXXGraph::Node<int>>& node = nodePair.first;
+    const std::vector<int>& degrees = nodePair.second;
 
-        std::cout << "Node: " << node->getId() << ", Degree: " << degrees[0] << "\n";
-    }
+    std::cout << "Node: " << node->getId() << ", Degree: " << degrees[0]
+              << "\n";
+  }
   auto laplacianMatrix = graph.getLaplacianMatrix();
   for (const auto& nodePair : *laplacianMatrix) {
     const auto& node = nodePair.first;
     const auto& neighbors = nodePair.second;
 
     std::cout << "Node " << node->getId() << " connected to:" << std::endl;
     for (const auto& neighbor : neighbors) {
-        if (neighbor.first == node) {
-            std::cout << "  -> Itself" << std::endl;
-        } else {
-            std::cout << "  -> Node " << neighbor.first->getId() << " with Edge ID " << (neighbor.second ? neighbor.second->getId() : -1) << std::endl;
-        }
+      if (neighbor.first == node) {
+        std::cout << "  -> Itself" << std::endl;
+      } else {
+        std::cout << "  -> Node " << neighbor.first->getId() << " with Edge ID "
+                  << (neighbor.second ? neighbor.second->getId() : -1)
+                  << std::endl;
+      }
     }
     std::cout << std::endl;
   }
@@ -53,7 +56,8 @@ int main() {
 
     std::cout << "Transitions from Node " << node->getId() << ":" << std::endl;
     for (const auto& transition : transitions) {
-        std::cout << "  -> To Node " << transition.first->getId() << " with Probability " << transition.second << std::endl;
+      std::cout << "  -> To Node " << transition.first->getId()
+                << " with Probability " << transition.second << std::endl;
     }
     std::cout << std::endl;
   }

diff --git a/examples/PartitionExample/partition_example.cpp b/examples/PartitionExample/partition_example.cpp
@@ -19,14 +19,17 @@ int main() {
   // std::cout << *cit_graph_ptr << std::endl;
   std::cout << cit_graph_ptr->getEdgeSet().size() << std::endl;
   std::cout << cit_graph_ptr->getNodeSet().size() << std::endl;
-  auto partitionedTwo = CXXGraph::Partitioning::Partitioner<int>::partitionGraph( *cit_graph_ptr,
-      CXXGraph::Partitioning::HDRF_ALG, 2, 1, 1, 1, 4);
+  auto partitionedTwo =
+      CXXGraph::Partitioning::Partitioner<int>::partitionGraph(
+          *cit_graph_ptr, CXXGraph::Partitioning::HDRF_ALG, 2, 1, 1, 1, 4);
   std::cout << "end partition two" << std::endl;
-  auto partitionedFour = CXXGraph::Partitioning::Partitioner<int>::partitionGraph( *cit_graph_ptr,
-      CXXGraph::Partitioning::HDRF_ALG, 4, 1, 1, 1, 4);
+  auto partitionedFour =
+      CXXGraph::Partitioning::Partitioner<int>::partitionGraph(
+          *cit_graph_ptr, CXXGraph::Partitioning::HDRF_ALG, 4, 1, 1, 1, 4);
   std::cout << "end partition four" << std::endl;
-  auto partitionedEight = CXXGraph::Partitioning::Partitioner<int>::partitionGraph( *cit_graph_ptr,
-      CXXGraph::Partitioning::HDRF_ALG, 8, 1, 1, 1, 4);
+  auto partitionedEight =
+      CXXGraph::Partitioning::Partitioner<int>::partitionGraph(
+          *cit_graph_ptr, CXXGraph::Partitioning::HDRF_ALG, 8, 1, 1, 1, 4);
   std::cout << "end partition eight" << std::endl;
   auto statsTwo = CXXGraph::Partitioning::getPartitionStats(partitionedTwo);
   auto statsFour = CXXGraph::Partitioning::getPartitionStats(partitionedFour);

diff --git a/include/CXXGraph/Edge/DirectedEdge_decl.h b/include/CXXGraph/Edge/DirectedEdge_decl.h
@@ -29,7 +29,7 @@ namespace CXXGraph {
 template <typename T>
 using unique = std::unique_ptr<T>;
 template <typename T>
-using shared= std::shared_ptr<T>;
+using shared = std::shared_ptr<T>;
 
 template <typename T>
 class UndirectedEdge;
@@ -48,8 +48,9 @@ class DirectedEdge : public Edge<T> {
                shared<const Node<T>> node2);
   DirectedEdge(const CXXGraph::id_t id,
                const std::pair<const Node<T> *, const Node<T> *> &nodepair);
-  DirectedEdge(const CXXGraph::id_t id,
-               const std::pair<shared<const Node<T>>, shared<const Node<T>>> &nodepair);
+  DirectedEdge(
+      const CXXGraph::id_t id,
+      const std::pair<shared<const Node<T>>, shared<const Node<T>>> &nodepair);
   DirectedEdge(const Edge<T> &edge);
   virtual ~DirectedEdge() = default;
   const Node<T> &getFrom() const;

diff --git a/include/CXXGraph/Edge/DirectedEdge_impl.hpp b/include/CXXGraph/Edge/DirectedEdge_impl.hpp
@@ -25,18 +25,20 @@
 #include "DirectedEdge_decl.h"
 
 namespace CXXGraph {
-
-using std::make_unique;
+
 using std::make_shared;
+using std::make_unique;
 
 template <typename T>
 DirectedEdge<T>::DirectedEdge(const CXXGraph::id_t id, const Node<T> &node1,
                               const Node<T> &node2)
     : Edge<T>(id, node1, node2) {}
 
 template <typename T>
-DirectedEdge<T>::DirectedEdge(const CXXGraph::id_t id, shared<const Node<T>> node1,
-			 shared<const Node<T>> node2) : Edge<T>(id, node1, node2) {}
+DirectedEdge<T>::DirectedEdge(const CXXGraph::id_t id,
+                              shared<const Node<T>> node1,
+                              shared<const Node<T>> node2)
+    : Edge<T>(id, node1, node2) {}
 
 template <typename T>
 DirectedEdge<T>::DirectedEdge(

diff --git a/include/CXXGraph/Edge/DirectedWeightedEdge_decl.h b/include/CXXGraph/Edge/DirectedWeightedEdge_decl.h
@@ -29,7 +29,7 @@ namespace CXXGraph {
 template <typename T>
 using unique = std::unique_ptr<T>;
 template <typename T>
-using shared= std::shared_ptr<T>;
+using shared = std::shared_ptr<T>;
 
 // Foward Declaration
 template <typename T>

diff --git a/include/CXXGraph/Edge/DirectedWeightedEdge_impl.hpp b/include/CXXGraph/Edge/DirectedWeightedEdge_impl.hpp
@@ -26,8 +26,8 @@
 
 namespace CXXGraph {
 
-using std::make_unique;
 using std::make_shared;
+using std::make_unique;
 
 template <typename T>
 DirectedWeightedEdge<T>::DirectedWeightedEdge(const CXXGraph::id_t id,

diff --git a/include/CXXGraph/Edge/UndirectedEdge_decl.h b/include/CXXGraph/Edge/UndirectedEdge_decl.h
@@ -29,7 +29,7 @@ namespace CXXGraph {
 template <typename T>
 using unique = std::unique_ptr<T>;
 template <typename T>
-using shared= std::shared_ptr<T>;
+using shared = std::shared_ptr<T>;
 
 template <typename T>
 class UndirectedEdge;
@@ -47,8 +47,9 @@ class UndirectedEdge : public Edge<T> {
                  shared<const Node<T>> node2);
   UndirectedEdge(const CXXGraph::id_t id,
                  const std::pair<const Node<T> *, const Node<T> *> &nodepair);
-  UndirectedEdge(const CXXGraph::id_t id,
-                 const std::pair<shared<const Node<T>>, shared<const Node<T>>> &nodepair);
+  UndirectedEdge(
+      const CXXGraph::id_t id,
+      const std::pair<shared<const Node<T>>, shared<const Node<T>>> &nodepair);
   UndirectedEdge(const Edge<T> &edge);
   virtual ~UndirectedEdge() = default;
   const Node<T> &getNode1() const;

diff --git a/include/CXXGraph/Edge/UndirectedEdge_impl.hpp b/include/CXXGraph/Edge/UndirectedEdge_impl.hpp
@@ -26,16 +26,17 @@
 
 namespace CXXGraph {
 
-using std::make_unique;
 using std::make_shared;
+using std::make_unique;
 
 template <typename T>
 UndirectedEdge<T>::UndirectedEdge(const CXXGraph::id_t id, const Node<T> &node1,
                                   const Node<T> &node2)
     : Edge<T>(id, node1, node2) {}
 
 template <typename T>
-UndirectedEdge<T>::UndirectedEdge(const CXXGraph::id_t id, shared<const Node<T>> node1,
+UndirectedEdge<T>::UndirectedEdge(const CXXGraph::id_t id,
+                                  shared<const Node<T>> node1,
                                   shared<const Node<T>> node2)
     : Edge<T>(id, node1, node2) {}
 

diff --git a/include/CXXGraph/Edge/UndirectedWeightedEdge_impl.hpp b/include/CXXGraph/Edge/UndirectedWeightedEdge_impl.hpp
@@ -26,8 +26,8 @@
 
 namespace CXXGraph {
 
-using std::make_unique;
 using std::make_shared;
+using std::make_unique;
 
 template <typename T>
 UndirectedWeightedEdge<T>::UndirectedWeightedEdge(const CXXGraph::id_t id,

diff --git a/include/CXXGraph/Graph/Algorithm/BestFirstSearch_impl.hpp b/include/CXXGraph/Graph/Algorithm/BestFirstSearch_impl.hpp
@@ -22,12 +22,13 @@
 
 #pragma once
 
-#include "CXXGraph/Graph/Graph_decl.h"
-#include <thread>
-#include <queue>
-#include <mutex>
 #include <atomic>
 #include <condition_variable>
+#include <mutex>
+#include <queue>
+#include <thread>
+
+#include "CXXGraph/Graph/Graph_decl.h"
 
 namespace CXXGraph {
 template <typename T>

diff --git a/include/CXXGraph/Graph/Algorithm/Boruvka_impl.hpp b/include/CXXGraph/Graph/Algorithm/Boruvka_impl.hpp
@@ -22,11 +22,12 @@
 
 #pragma once
 
-#include "CXXGraph/Graph/Graph_decl.h"
 #include <limits.h>
 
+#include "CXXGraph/Graph/Graph_decl.h"
+
 namespace CXXGraph {
-    
+
 template <typename T>
 const MstResult Graph<T>::boruvka() const {
   MstResult result;

diff --git a/include/CXXGraph/Graph/Algorithm/BreadthFirstSearch_impl.hpp b/include/CXXGraph/Graph/Algorithm/BreadthFirstSearch_impl.hpp
@@ -64,6 +64,5 @@ const std::vector<Node<T>> Graph<T>::breadth_first_search(
   return visited;
 }
 
-
 }  // namespace CXXGraph
 #endif  // __CXXGRAPH_BREADTHFIRSTSEARCH_IMPL_H__
diff --git a/include/CXXGraph/Graph/Algorithm/DepthFirstSearch_impl.hpp b/include/CXXGraph/Graph/Algorithm/DepthFirstSearch_impl.hpp
@@ -25,7 +25,7 @@
 #include "CXXGraph/Graph/Graph_decl.h"
 
 namespace CXXGraph {
-    
+
 template <typename T>
 const std::vector<Node<T>> Graph<T>::depth_first_search(
     const Node<T> &start) const {

diff --git a/include/CXXGraph/Graph/Algorithm/Kosaraju_impl.hpp b/include/CXXGraph/Graph/Algorithm/Kosaraju_impl.hpp
@@ -22,9 +22,10 @@
 
 #pragma once
 
-#include "CXXGraph/Graph/Graph_decl.h"
 #include <stack>
 
+#include "CXXGraph/Graph/Graph_decl.h"
+
 namespace CXXGraph {
 
 template <typename T>
-Original file line number
+Diff line change
@@ Expand Up @@
       }
     }
-    BENCHMARK(BellmanFord_FromReadedCitHep);
+    BENCHMARK(BellmanFord_FromReadedCitHep);