Skip to content

include <algorithm> for gcc 14 compilation errors #428

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
ZigRazor merged 3 commits into from
Jun 20, 2024
Merged

include <algorithm> for gcc 14 compilation errors #428

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
bf6fb10
include <algorithm> for gcc 14 compilation errors
toge May 5, 2024
7e7a9c7
revert Graph_decl.h
toge May 12, 2024
58a20a4
include algorithm header (retry)
toge May 12, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 3 additions & 1 deletion include/CXXGraph/Graph/Algorithm/BellmanFord_impl.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,6 +22,8 @@

#pragma once

#include <algorithm>

#include "CXXGraph/Graph/Graph_decl.h"

namespace CXXGraph {
Expand Down Expand Up @@ -126,4 +128,4 @@ const BellmanFordResult Graph<T>::bellmanford(const Node<T> &source,
return result;
}
} // namespace CXXGraph
#endif // __CXXGRAPH_BELLMANFORD_IMPL_H__
#endif // __CXXGRAPH_BELLMANFORD_IMPL_H__
3 changes: 2 additions & 1 deletion include/CXXGraph/Graph/Algorithm/BestFirstSearch_impl.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -27,6 +27,7 @@
#include <mutex>
#include <queue>
#include <thread>
#include <algorithm>

#include "CXXGraph/Graph/Graph_decl.h"

Expand Down Expand Up @@ -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__
#endif // __CXXGRAPH_BESTFIRSTSEARCH_IMPL_H__
4 changes: 3 additions & 1 deletion include/CXXGraph/Graph/Algorithm/BreadthFirstSearch_impl.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,6 +22,8 @@

#pragma once

#include <algorithm>

#include "CXXGraph/Graph/Graph_decl.h"

namespace CXXGraph {
Expand Down Expand Up @@ -65,4 +67,4 @@ const std::vector<Node<T>> Graph<T>::breadth_first_search(
}

} // namespace CXXGraph
#endif // __CXXGRAPH_BREADTHFIRSTSEARCH_IMPL_H__
#endif // __CXXGRAPH_BREADTHFIRSTSEARCH_IMPL_H__
4 changes: 3 additions & 1 deletion include/CXXGraph/Graph/Algorithm/CycleDetection_impl.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,6 +22,8 @@

#pragma once

#include <algorithm>

#include "CXXGraph/Graph/Graph_decl.h"

namespace CXXGraph {
Expand Down Expand Up @@ -228,4 +230,4 @@ bool Graph<T>::isCyclicDirectedGraphBFS() const {
return !(remain == 0);
}
} // namespace CXXGraph
#endif // __CXXGRAPH_CYCLEDETECTION_IMPL_H__
#endif // __CXXGRAPH_CYCLEDETECTION_IMPL_H__
4 changes: 3 additions & 1 deletion include/CXXGraph/Graph/Algorithm/DepthFirstSearch_impl.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,6 +22,8 @@

#pragma once

#include <algorithm>

#include "CXXGraph/Graph/Graph_decl.h"

namespace CXXGraph {
Expand Down Expand Up @@ -61,4 +63,4 @@ const std::vector<Node<T>> Graph<T>::depth_first_search(
}

} // namespace CXXGraph
#endif // __CXXGRAPH_DEPTHFIRSTSEARCH_IMPL_H__
#endif // __CXXGRAPH_DEPTHFIRSTSEARCH_IMPL_H__
4 changes: 3 additions & 1 deletion include/CXXGraph/Graph/Algorithm/Dial_impl.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,6 +22,8 @@

#pragma once

#include <algorithm>

#include "CXXGraph/Graph/Graph_decl.h"

namespace CXXGraph {
Expand Down Expand Up @@ -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__
#endif // __CXXGRAPH_DIAL_IMPL_H__
4 changes: 3 additions & 1 deletion include/CXXGraph/Graph/Algorithm/Dijkstra_impl.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,6 +22,8 @@

#pragma once

#include <algorithm>

#include "CXXGraph/Graph/Graph_decl.h"

namespace CXXGraph {
Expand Down Expand Up @@ -452,4 +454,4 @@ const DijkstraResult Graph<T>::dijkstra_deterministic2(
}

} // namespace CXXGraph
#endif // __CXXGRAPH_DIJKSTRA_IMPL_H__
#endif // __CXXGRAPH_DIJKSTRA_IMPL_H__
4 changes: 3 additions & 1 deletion include/CXXGraph/Graph/Algorithm/FordFulkerson_impl.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,6 +22,8 @@

#pragma once

#include <algorithm>

#include "CXXGraph/Graph/Graph_decl.h"

namespace CXXGraph {
Expand Down Expand Up @@ -105,4 +107,4 @@ double Graph<T>::fordFulkersonMaxFlow(const Node<T> &source,
return maxFlow;
}
} // namespace CXXGraph
#endif // __CXXGRAPH_FORDFULKERSON_IMPL_H__
#endif // __CXXGRAPH_FORDFULKERSON_IMPL_H__
1 change: 1 addition & 0 deletions include/CXXGraph/Graph/Graph_impl.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -23,6 +23,7 @@
#pragma once

#include <deque>
#include <algorithm>

#include "CXXGraph/Graph/Graph_decl.h"
#include "CXXGraph/Utility/ConstString.hpp"
Expand Down