From 28cf0027507795dddb3b686e538f4bd8948fcf21 Mon Sep 17 00:00:00 2001
From: toge <toge.mail@gmail.com>
Date: Thu, 20 Jun 2024 18:35:21 +0900
Subject: [PATCH] include <algorithm> for gcc 14 compilation errors (#428)

* include <algorithm> for gcc 14 compilation errors

* revert Graph_decl.h

* include algorithm header (retry)
---
 include/CXXGraph/Graph/Algorithm/BellmanFord_impl.hpp        | 4 +++-
 include/CXXGraph/Graph/Algorithm/BestFirstSearch_impl.hpp    | 3 ++-
 include/CXXGraph/Graph/Algorithm/BreadthFirstSearch_impl.hpp | 4 +++-
 include/CXXGraph/Graph/Algorithm/CycleDetection_impl.hpp     | 4 +++-
 include/CXXGraph/Graph/Algorithm/DepthFirstSearch_impl.hpp   | 4 +++-
 include/CXXGraph/Graph/Algorithm/Dial_impl.hpp               | 4 +++-
 include/CXXGraph/Graph/Algorithm/Dijkstra_impl.hpp           | 4 +++-
 include/CXXGraph/Graph/Algorithm/FordFulkerson_impl.hpp      | 4 +++-
 include/CXXGraph/Graph/Graph_impl.hpp                        | 1 +
 9 files changed, 24 insertions(+), 8 deletions(-)

diff --git a/include/CXXGraph/Graph/Algorithm/BellmanFord_impl.hpp b/include/CXXGraph/Graph/Algorithm/BellmanFord_impl.hpp
index cbb6fd036..09d186c9f 100644
--- a/include/CXXGraph/Graph/Algorithm/BellmanFord_impl.hpp
+++ b/include/CXXGraph/Graph/Algorithm/BellmanFord_impl.hpp
@@ -22,6 +22,8 @@
 
 #pragma once
 
+#include <algorithm>
+
 #include "CXXGraph/Graph/Graph_decl.h"
 
 namespace CXXGraph {
@@ -126,4 +128,4 @@ const BellmanFordResult Graph<T>::bellmanford(const Node<T> &source,
   return result;
 }
 }  // namespace CXXGraph
-#endif  // __CXXGRAPH_BELLMANFORD_IMPL_H__
\ No newline at end of file
+#endif  // __CXXGRAPH_BELLMANFORD_IMPL_H__
diff --git a/include/CXXGraph/Graph/Algorithm/BestFirstSearch_impl.hpp b/include/CXXGraph/Graph/Algorithm/BestFirstSearch_impl.hpp
index d61aed940..4930a978c 100644
--- a/include/CXXGraph/Graph/Algorithm/BestFirstSearch_impl.hpp
+++ b/include/CXXGraph/Graph/Algorithm/BestFirstSearch_impl.hpp
@@ -27,6 +27,7 @@
 #include <mutex>
 #include <queue>
 #include <thread>
+#include <algorithm>
 
 #include "CXXGraph/Graph/Graph_decl.h"
 
@@ -259,4 +260,4 @@ const std::vector<Node<T>> Graph<T>::concurrency_breadth_first_search(
   return bfs_result;
 }
 }  // namespace CXXGraph
-#endif  // __CXXGRAPH_BESTFIRSTSEARCH_IMPL_H__
\ No newline at end of file
+#endif  // __CXXGRAPH_BESTFIRSTSEARCH_IMPL_H__
diff --git a/include/CXXGraph/Graph/Algorithm/BreadthFirstSearch_impl.hpp b/include/CXXGraph/Graph/Algorithm/BreadthFirstSearch_impl.hpp
index 82d0b33f0..0002627f7 100644
--- a/include/CXXGraph/Graph/Algorithm/BreadthFirstSearch_impl.hpp
+++ b/include/CXXGraph/Graph/Algorithm/BreadthFirstSearch_impl.hpp
@@ -22,6 +22,8 @@
 
 #pragma once
 
+#include <algorithm>
+
 #include "CXXGraph/Graph/Graph_decl.h"
 
 namespace CXXGraph {
@@ -65,4 +67,4 @@ const std::vector<Node<T>> Graph<T>::breadth_first_search(
 }
 
 }  // namespace CXXGraph
-#endif  // __CXXGRAPH_BREADTHFIRSTSEARCH_IMPL_H__
\ No newline at end of file
+#endif  // __CXXGRAPH_BREADTHFIRSTSEARCH_IMPL_H__
diff --git a/include/CXXGraph/Graph/Algorithm/CycleDetection_impl.hpp b/include/CXXGraph/Graph/Algorithm/CycleDetection_impl.hpp
index a66f5e2a0..43d5313c7 100644
--- a/include/CXXGraph/Graph/Algorithm/CycleDetection_impl.hpp
+++ b/include/CXXGraph/Graph/Algorithm/CycleDetection_impl.hpp
@@ -22,6 +22,8 @@
 
 #pragma once
 
+#include <algorithm>
+
 #include "CXXGraph/Graph/Graph_decl.h"
 
 namespace CXXGraph {
@@ -228,4 +230,4 @@ bool Graph<T>::isCyclicDirectedGraphBFS() const {
   return !(remain == 0);
 }
 }  // namespace CXXGraph
-#endif  // __CXXGRAPH_CYCLEDETECTION_IMPL_H__
\ No newline at end of file
+#endif  // __CXXGRAPH_CYCLEDETECTION_IMPL_H__
diff --git a/include/CXXGraph/Graph/Algorithm/DepthFirstSearch_impl.hpp b/include/CXXGraph/Graph/Algorithm/DepthFirstSearch_impl.hpp
index 6f3bcf105..12365df1c 100644
--- a/include/CXXGraph/Graph/Algorithm/DepthFirstSearch_impl.hpp
+++ b/include/CXXGraph/Graph/Algorithm/DepthFirstSearch_impl.hpp
@@ -22,6 +22,8 @@
 
 #pragma once
 
+#include <algorithm>
+
 #include "CXXGraph/Graph/Graph_decl.h"
 
 namespace CXXGraph {
@@ -61,4 +63,4 @@ const std::vector<Node<T>> Graph<T>::depth_first_search(
 }
 
 }  // namespace CXXGraph
-#endif  // __CXXGRAPH_DEPTHFIRSTSEARCH_IMPL_H__
\ No newline at end of file
+#endif  // __CXXGRAPH_DEPTHFIRSTSEARCH_IMPL_H__
diff --git a/include/CXXGraph/Graph/Algorithm/Dial_impl.hpp b/include/CXXGraph/Graph/Algorithm/Dial_impl.hpp
index ffebbc370..b341d291c 100644
--- a/include/CXXGraph/Graph/Algorithm/Dial_impl.hpp
+++ b/include/CXXGraph/Graph/Algorithm/Dial_impl.hpp
@@ -22,6 +22,8 @@
 
 #pragma once
 
+#include <algorithm>
+
 #include "CXXGraph/Graph/Graph_decl.h"
 
 namespace CXXGraph {
@@ -155,4 +157,4 @@ const DialResult Graph<T>::dial(const Node<T> &source, int maxWeight) const {
   return result;
 }
 }  // namespace CXXGraph
-#endif  // __CXXGRAPH_DIAL_IMPL_H__
\ No newline at end of file
+#endif  // __CXXGRAPH_DIAL_IMPL_H__
diff --git a/include/CXXGraph/Graph/Algorithm/Dijkstra_impl.hpp b/include/CXXGraph/Graph/Algorithm/Dijkstra_impl.hpp
index 3893d1fb3..760706b43 100644
--- a/include/CXXGraph/Graph/Algorithm/Dijkstra_impl.hpp
+++ b/include/CXXGraph/Graph/Algorithm/Dijkstra_impl.hpp
@@ -22,6 +22,8 @@
 
 #pragma once
 
+#include <algorithm>
+
 #include "CXXGraph/Graph/Graph_decl.h"
 
 namespace CXXGraph {
@@ -452,4 +454,4 @@ const DijkstraResult Graph<T>::dijkstra_deterministic2(
 }
 
 }  // namespace CXXGraph
-#endif  // __CXXGRAPH_DIJKSTRA_IMPL_H__
\ No newline at end of file
+#endif  // __CXXGRAPH_DIJKSTRA_IMPL_H__
diff --git a/include/CXXGraph/Graph/Algorithm/FordFulkerson_impl.hpp b/include/CXXGraph/Graph/Algorithm/FordFulkerson_impl.hpp
index 1a1ad3efc..82efebeea 100644
--- a/include/CXXGraph/Graph/Algorithm/FordFulkerson_impl.hpp
+++ b/include/CXXGraph/Graph/Algorithm/FordFulkerson_impl.hpp
@@ -22,6 +22,8 @@
 
 #pragma once
 
+#include <algorithm>
+
 #include "CXXGraph/Graph/Graph_decl.h"
 
 namespace CXXGraph {
@@ -105,4 +107,4 @@ double Graph<T>::fordFulkersonMaxFlow(const Node<T> &source,
   return maxFlow;
 }
 }  // namespace CXXGraph
-#endif  // __CXXGRAPH_FORDFULKERSON_IMPL_H__
\ No newline at end of file
+#endif  // __CXXGRAPH_FORDFULKERSON_IMPL_H__
diff --git a/include/CXXGraph/Graph/Graph_impl.hpp b/include/CXXGraph/Graph/Graph_impl.hpp
index e6ca0221b..2c865d12b 100644
--- a/include/CXXGraph/Graph/Graph_impl.hpp
+++ b/include/CXXGraph/Graph/Graph_impl.hpp
@@ -23,6 +23,7 @@
 #pragma once
 
 #include <deque>
+#include <algorithm>
 
 #include "CXXGraph/Graph/Graph_decl.h"
 #include "CXXGraph/Utility/ConstString.hpp"