From 8b77158f8f3bea4b9cf103c9f814ef792f2cee28 Mon Sep 17 00:00:00 2001
From: yangyongkang2000 <yangyongkang@stu.wit.edu.cn>
Date: Mon, 26 Feb 2024 20:11:03 +0800
Subject: [PATCH] Cite this repository

---
 README.md                                          | 13 +++++++++++++
 include/SEvoBench/parallel_algorithm_benchmark.hpp |  5 ++---
 2 files changed, 15 insertions(+), 3 deletions(-)

diff --git a/README.md b/README.md
index 86919a1..ffaad7f 100644
--- a/README.md
+++ b/README.md
@@ -18,3 +18,16 @@ To learn how to use and for more details about the framework, please refer to th
 + [Chinese Documentation](./doc/User_Guide_Chinese.md)
 + [English Documentation](./doc/User_Guide.md)
 
+### Cite this repository
+If you use this software in your work, please cite it as below.
+
+```bibtex
+@software{Yongkang_SEvoBench_A_C_Framework_2024,
+author = {Yongkang, Yang},
+month = feb,
+title = {{SEvoBench:A C++ Framework for Evolutionary Single-Objective Optimization Benchmarking}},
+url = {https://github.com/yangyongkang2000/SEvoBench},
+version = {1.0.0},
+year = {2024}
+} 
+```
\ No newline at end of file
diff --git a/include/SEvoBench/parallel_algorithm_benchmark.hpp b/include/SEvoBench/parallel_algorithm_benchmark.hpp
index e67cbaa..9ea25fd 100644
--- a/include/SEvoBench/parallel_algorithm_benchmark.hpp
+++ b/include/SEvoBench/parallel_algorithm_benchmark.hpp
@@ -157,15 +157,14 @@ class benchmark_result {
       fs::create_directory(dir);
     }
     if (!graph_data.empty()) {
-      auto len = graph_data.size() / size;
       for (int i = 0; i < size; i++) {
         auto file_path =
             dir / (std::string(algname) + "_" + std::to_string(pop) + "_" +
                    std::string(proname) + "_F" + std::to_string(i + 1) + "_" +
                    std::to_string(dim) + "_curve.txt");
         std::ofstream os(file_path.string());
-        for (int j = 0; j < len; j++)
-          os << graph_data[i * len + j] << '\n';
+        for (int j = 0; j < 2*max; j++)
+          os << graph_data[2*i * max + j] << '\n';
       }
     }
   }