v1.2.2: fix for MSVC which has no stdalign.h

Author: DrTimothyAldenDavis

CMakeLists.txt

@@ -36,13 +36,13 @@
 # get the version
 #-------------------------------------------------------------------------------
 
-cmake_minimum_required ( VERSION 3.20 ) # LAGraph can be built stand-alone
+cmake_minimum_required ( VERSION 3.23 )
 
 # version of LAGraph
-set ( LAGraph_DATE "Sept 8, 2025" )
+set ( LAGraph_DATE "July 21, 2026" )
 set ( LAGraph_VERSION_MAJOR 1 CACHE STRING "" FORCE )
 set ( LAGraph_VERSION_MINOR 2 CACHE STRING "" FORCE )
-set ( LAGraph_VERSION_SUB   1 CACHE STRING "" FORCE )
+set ( LAGraph_VERSION_SUB   2 CACHE STRING "" FORCE )
 
 message ( STATUS "Building LAGraph version: v"
     ${LAGraph_VERSION_MAJOR}.
@@ -70,6 +70,17 @@ include ( SuiteSparsePolicy )
 
 enable_language ( C )
 
+# check if stdalign.h exists
+include ( CheckIncludeFile )
+check_include_file ( stdalign.h HAVE_STDALIGN_H )
+if ( HAVE_STDALIGN_H )
+    set ( LAGraph_HAS_STDALIGN_H 1 )
+    message ( STATUS "stdalign.h is available" )
+else ( )
+    message ( STATUS "stdalign.h is not available" )
+    set ( LAGraph_HAS_STDALIGN_H 0 )
+endif ( )
+
 # configure LAGraph.h with the LAGraph date and version
 configure_file (
     "Config/LAGraph.h.in"

Config/LAGraph.h.in

@@ -41,6 +41,7 @@
 #define LAGRAPH_VERSION_MAJOR  @LAGraph_VERSION_MAJOR@
 #define LAGRAPH_VERSION_MINOR  @LAGraph_VERSION_MINOR@
 #define LAGRAPH_VERSION_UPDATE @LAGraph_VERSION_SUB@
+#define LAGRAPH_HAS_STDALIGN_H @LAGraph_HAS_STDALIGN_H@
 
 //==============================================================================
 // include files and helper macros
@@ -104,8 +105,8 @@
 
 #if ( !LAGRAPH_VANILLA ) && defined ( GxB_SUITESPARSE_GRAPHBLAS )
     // use SuiteSparse, and its GxB* extensions
-    #if GxB_IMPLEMENTATION < GxB_VERSION (9,0,0)
-    #error "If using SuiteSparse::GraphBLAS, version 9.0.0 or later is required"
+    #if GxB_IMPLEMENTATION < GxB_VERSION (10,0,0)
+    #error "SuiteSparse::GraphBLAS v10.0.0 or later is required"
     #endif
     #define LAGRAPH_SUITESPARSE 1
 #else
@@ -2410,11 +2411,11 @@ int LAGr_SingleSourceShortestPath
 ) ;
 
 //------------------------------------------------------------------------------
-// LAGr_Betweenness: betweeness centrality metric
+// LAGr_Betweenness: betweenness centrality metric
 //------------------------------------------------------------------------------
 
-/** LAGr_Betweenness: betweeness centrality metric.  This methods computes an
- * approximation of the betweeness-centrality metric of all nodes in the graph.
+/** LAGr_Betweenness: betweenness centrality metric.  This methods computes an
+ * approximation of the betweenness-centrality metric of all nodes in the graph.
  * Only a few given source nodes are used for the approximation.  This is an
  * Advanced algorithm (G->AT is required).
  *
@@ -2442,7 +2443,7 @@ LAGRAPH_PUBLIC
 int LAGr_Betweenness
 (
     // output:
-    GrB_Vector *centrality,     // centrality(i): betweeness centrality of i
+    GrB_Vector *centrality,     // centrality(i): betweenness centrality of i
     // input:
     const LAGraph_Graph G,      // input graph
     const GrB_Index *sources,   // source vertices to compute shortest paths

experimental/algorithm/LAGraph_cdlp.c

@@ -73,7 +73,13 @@
 
 #include <LAGraph.h>
 #include <LAGraphX.h>
-#include <stdalign.h>
+#if LAGRAPH_HAS_STDALIGN_H
+    #include <stdalign.h>
+    #define ALIGNAS_64 alignas(64)
+#else
+    // the alignas keyword/macro is not available
+    #define ALIGNAS_64
+#endif
 #include "LG_internal.h"
 
 // A Go-style slice / Lisp-style property list
@@ -141,7 +147,7 @@ void counts_reducer(GrB_Index* e1, GrB_Index* c1, GrB_Index e2, GrB_Index c2) {
 #define bucket_shift (64llu - bucket_bits)
 
 typedef struct {
-    alignas(64) plist buckets[nof_buckets];
+    ALIGNAS_64 plist buckets[nof_buckets];
 } ptable;
 
 void ptable_free(ptable* table) {
@@ -187,6 +193,7 @@ void ptable_reduce(ptable* table, GrB_Index* entry, GrB_Index* count, plist_redu
 }
 
 //****************************************************************************
+
 int LAGraph_cdlp
         (
                 GrB_Vector *CDLP_handle,    // output vector

include/LAGraph.h

@@ -37,10 +37,11 @@
 // See also the LAGraph_Version utility method, which returns these values.
 // These definitions are derived from LAGraph/CMakeLists.txt.
 
-#define LAGRAPH_DATE "Sept 8, 2025"
+#define LAGRAPH_DATE "July 21, 2026"
 #define LAGRAPH_VERSION_MAJOR  1
 #define LAGRAPH_VERSION_MINOR  2
-#define LAGRAPH_VERSION_UPDATE 1
+#define LAGRAPH_VERSION_UPDATE 2
+#define LAGRAPH_HAS_STDALIGN_H 1
 
 //==============================================================================
 // include files and helper macros
@@ -104,8 +105,8 @@
 
 #if ( !LAGRAPH_VANILLA ) && defined ( GxB_SUITESPARSE_GRAPHBLAS )
     // use SuiteSparse, and its GxB* extensions
-    #if GxB_IMPLEMENTATION < GxB_VERSION (9,0,0)
-    #error "If using SuiteSparse::GraphBLAS, version 9.0.0 or later is required"
+    #if GxB_IMPLEMENTATION < GxB_VERSION (10,0,0)
+    #error "SuiteSparse::GraphBLAS v10.0.0 or later is required"
     #endif
     #define LAGRAPH_SUITESPARSE 1
 #else
@@ -2410,11 +2411,11 @@ int LAGr_SingleSourceShortestPath
 ) ;
 
 //------------------------------------------------------------------------------
-// LAGr_Betweenness: betweeness centrality metric
+// LAGr_Betweenness: betweenness centrality metric
 //------------------------------------------------------------------------------
 
-/** LAGr_Betweenness: betweeness centrality metric.  This methods computes an
- * approximation of the betweeness-centrality metric of all nodes in the graph.
+/** LAGr_Betweenness: betweenness centrality metric.  This methods computes an
+ * approximation of the betweenness-centrality metric of all nodes in the graph.
  * Only a few given source nodes are used for the approximation.  This is an
  * Advanced algorithm (G->AT is required).
  *
@@ -2442,7 +2443,7 @@ LAGRAPH_PUBLIC
 int LAGr_Betweenness
 (
     // output:
-    GrB_Vector *centrality,     // centrality(i): betweeness centrality of i
+    GrB_Vector *centrality,     // centrality(i): betweenness centrality of i
     // input:
     const LAGraph_Graph G,      // input graph
     const GrB_Index *sources,   // source vertices to compute shortest paths