From 40fc81e704a652ed648441b64254e25e44a3ad9d Mon Sep 17 00:00:00 2001
From: Raphael Steiner <raphael.steiner@huawei.com>
Date: Wed, 12 Nov 2025 15:47:58 +0100
Subject: [PATCH] replaced exclusive scan with manual for loop for old compiler
 compatability

---
 .../adj_list_impl/compact_sparse_graph.hpp                   | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/include/osp/graph_implementations/adj_list_impl/compact_sparse_graph.hpp b/include/osp/graph_implementations/adj_list_impl/compact_sparse_graph.hpp
index bedfa623..81305773 100644
--- a/include/osp/graph_implementations/adj_list_impl/compact_sparse_graph.hpp
+++ b/include/osp/graph_implementations/adj_list_impl/compact_sparse_graph.hpp
@@ -277,8 +277,9 @@ class Compact_Sparse_Graph {
                 csc_source_ptr[num_vertices()] = static_cast<edge_t>( csc_edge_children.size() );
 
                 csr_target_ptr = std::vector<edge_t>(num_vertices() + 1, 0);
-                std::exclusive_scan(num_parents_tmp.cbegin(), num_parents_tmp.cend(), csr_target_ptr.begin(), 0);
-                csr_target_ptr[num_vertices()] = num_edges();
+                for (std::size_t i = 0U; i < num_parents_tmp.size(); ++i) {
+                    csr_target_ptr[i + 1] = csr_target_ptr[i] + num_parents_tmp[i];
+                }
 
                 std::vector<edge_t> offset = csr_target_ptr;
                 for (vertex_idx vert = 0; vert < num_vertices(); ++vert) {