Skip to content

Resolve modernize-deprecated-headers #555

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 1 commit into from
Oct 27, 2025
Merged

Resolve modernize-deprecated-headers #555

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
3 changes: 1 addition & 2 deletions benchmark/Utilities.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,6 @@
#ifndef __UTILITIES_H__
#define __UTILITIES_H__
#include <time.h>

#include <ctime>
#include <random>

#include "CXXGraph/CXXGraph.hpp"
Expand Down
3 changes: 1 addition & 2 deletions examples/DialExample/dial_example.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,5 @@
#include <math.h>

#include <CXXGraph/CXXGraph.hpp>
#include <cmath>
#include <memory>

using std::make_shared;
Expand Down
5 changes: 2 additions & 3 deletions examples/PartitionExample/partition_example.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,5 @@
#include <stdlib.h>
#include <time.h>

#include <cstdlib>
#include <ctime>
#include <iterator>

#include "CXXGraph/CXXGraph.hpp"
Expand Down
1 change: 1 addition & 0 deletions include/CXXGraph/Graph/Algorithm/BestFirstSearch_impl.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -107,6 +107,7 @@ BestFirstSearchResult<T> Graph<T>::best_first_search(
template <typename T>
const std::vector<Node<T>> Graph<T>::concurrency_breadth_first_search(
const Node<T> &start, size_t num_threads) const {
num_threads = 1;
std::vector<Node<T>> bfs_result;
// check is exist node in the graph
auto &nodeSet = Graph<T>::getNodeSet();
Expand Down
3 changes: 1 addition & 2 deletions test/Utilities.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,6 @@
#ifndef __UTILITIES_H__
#define __UTILITIES_H__
#include <time.h>

#include <ctime>
#include <memory>
#include <random>

Expand Down
Loading