Skip to content

Remove unused tracker_mutex #567

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
Nov 27, 2025
Merged

Remove unused tracker_mutex #567

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
8 changes: 0 additions & 8 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 @@ -147,7 +147,6 @@ const std::vector<Node<T>> Graph<T>::concurrency_breadth_first_search(
// a worker is assigned a small part of tasks for each time
// assignments of tasks in current level and updates of tasks in next
// level are inclusive
std::mutex tracker_mutex;
std::mutex next_tracker_mutex;
std::atomic<int> assigned_tasks = 0;
int num_tasks = 1;
Expand All @@ -158,13 +157,6 @@ const std::vector<Node<T>> Graph<T>::concurrency_breadth_first_search(

auto extract_tasks = [&assigned_tasks, &num_tasks,
&block_size]() -> std::pair<int, int> {
/*
std::lock_guard<std::mutex> tracker_guard(tracker_mutex);
int task_block_size = std::min(num_tasks - assigned_tasks,
block_size); std::pair<int,int> task_block{assigned_tasks,
assigned_tasks + task_block_size}; assigned_tasks += task_block_size;
return task_block;
*/
int start = assigned_tasks.fetch_add(block_size);
int end = std::min(num_tasks, start + block_size);
return {start, end};
Expand Down
Loading