Windows builds are broken due to MSVC fold expression bug (#416)

* Fix Windows builds * Run clang-format * Run clang-format-16
ZigRazor · Apr 22, 2024 · 11e80f2 · 11e80f2
1 parent 6c8f96d
commit 11e80f2
Show file tree

Hide file tree

Showing 10 changed files with 636 additions and 430 deletions.
diff --git a/include/CXXGraph/Graph/Algorithm/Boruvka_impl.hpp b/include/CXXGraph/Graph/Algorithm/Boruvka_impl.hpp
@@ -187,16 +187,16 @@ const MstResult Graph<T>::boruvka_deterministic() const {
       // Else check if current edge is closer to previous
       // cheapest edges of set1 and set2
       if (cheapest[set1] == INT_MAX ||
-                (edgeWeight[cheapest[set1]] > edgeWeight[edgeId]) ||
-                (edgeWeight[cheapest[set1]] == edgeWeight[edgeId] && cheapest[set1] > edgeId)
-          )
-          cheapest[set1] = edgeId;
+          (edgeWeight[cheapest[set1]] > edgeWeight[edgeId]) ||
+          (edgeWeight[cheapest[set1]] == edgeWeight[edgeId] &&
+           cheapest[set1] > edgeId))
+        cheapest[set1] = edgeId;
 
       if (cheapest[set2] == INT_MAX ||
-                (edgeWeight[cheapest[set2]] > edgeWeight[edgeId]) ||
-                (edgeWeight[cheapest[set2]] == edgeWeight[edgeId] && cheapest[set2] > edgeId)
-          )
-          cheapest[set2] = edgeId;
+          (edgeWeight[cheapest[set2]] > edgeWeight[edgeId]) ||
+          (edgeWeight[cheapest[set2]] == edgeWeight[edgeId] &&
+           cheapest[set2] > edgeId))
+        cheapest[set2] = edgeId;
     }
 
     // iterate over all the vertices and add picked