Skip to content

removed BGL_FORALL_VERTICES_T from rcsp #698

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

Open
andreacassioli wants to merge 3 commits into
base: develop
Choose a base branch
from
Open

removed BGL_FORALL_VERTICES_T from rcsp #698

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
c4672c5
removed BGL_FORALL_VERTICES_T from rcsp
andreacassioli Nov 3, 2026
27424c1
reorder includes
andreacassioli Nov 3, 2026
e8b644a
remove unnecessary shared_ptr reset at the end of the algorithm
andreacassioli Nov 4, 2026
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
16 changes: 4 additions & 12 deletions include/boost/graph/r_c_shortest_paths.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,11 +11,11 @@
#include <queue>
#include <vector>
#include <list>

#include <memory>

#include <boost/range/iterator_range_core.hpp>
#include <boost/graph/detail/visitor_wrapper.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/iteration_macros.hpp>
#include <boost/property_map/property_map.hpp>

namespace boost
Expand Down Expand Up @@ -193,7 +193,8 @@ namespace detail
vec_last_valid_positions_for_dominance(
vec_last_valid_positions_for_dominance_data.begin(),
vertex_index_map);
BGL_FORALL_VERTICES_T(v, g, Graph)

for(const auto v: boost::make_iterator_range(vertices(g)))
{
put(vec_last_valid_positions_for_dominance, v,
vec_vertex_labels[v].begin());
Expand Down Expand Up @@ -434,15 +435,6 @@ namespace detail
break;
}
}

BGL_FORALL_VERTICES_T(i, g, Graph)
{
auto& list_labels_cur_vertex = vec_vertex_labels[i];
for (auto& label : list_labels_cur_vertex)
{
label.reset();
}
}
} // r_c_shortest_paths_dispatch

} // detail
Expand Down
Loading