Skip to content

remove BOOST_NO_STD_ITERATOR_TRAITS from isomorphism.hpp #648

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
Becheler merged 1 commit into from
Oct 19, 2026
Merged

remove BOOST_NO_STD_ITERATOR_TRAITS from isomorphism.hpp #648

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
28 changes: 0 additions & 28 deletions include/boost/graph/isomorphism.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -54,10 +54,6 @@ namespace detail
std::vector< int > dfs_num_vec;
typedef safe_iterator_property_map<
typename std::vector< int >::iterator, IndexMap1
#ifdef BOOST_NO_STD_ITERATOR_TRAITS
,
int, int&
#endif /* BOOST_NO_STD_ITERATOR_TRAITS */
>
DFSNumMap;
DFSNumMap dfs_num;
Expand All @@ -67,10 +63,6 @@ namespace detail
std::vector< char > in_S_vec;
typedef safe_iterator_property_map<
typename std::vector< char >::iterator, IndexMap2
#ifdef BOOST_NO_STD_ITERATOR_TRAITS
,
char, char&
#endif /* BOOST_NO_STD_ITERATOR_TRAITS */
>
InSMap;
InSMap in_S;
Expand Down Expand Up @@ -153,10 +145,6 @@ namespace detail
in_S_vec.resize(num_vertices(G1));
in_S = make_safe_iterator_property_map(
in_S_vec.begin(), in_S_vec.size(), index_map2
#ifdef BOOST_NO_STD_ITERATOR_TRAITS
,
in_S_vec.front()
#endif /* BOOST_NO_STD_ITERATOR_TRAITS */
);
}

Expand Down Expand Up @@ -221,10 +209,6 @@ namespace detail
std::vector< default_color_type > color_vec(num_vertices(G1));
safe_iterator_property_map<
std::vector< default_color_type >::iterator, IndexMap1
#ifdef BOOST_NO_STD_ITERATOR_TRAITS
,
default_color_type, default_color_type&
#endif /* BOOST_NO_STD_ITERATOR_TRAITS */
>
color_map(color_vec.begin(), color_vec.size(), index_map1);
record_dfs_order dfs_visitor(dfs_vertices, ordered_edges);
Expand All @@ -241,10 +225,6 @@ namespace detail
dfs_num_vec.resize(num_vertices(G1));
dfs_num = make_safe_iterator_property_map(
dfs_num_vec.begin(), dfs_num_vec.size(), index_map1
#ifdef BOOST_NO_STD_ITERATOR_TRAITS
,
dfs_num_vec.front()
#endif /* BOOST_NO_STD_ITERATOR_TRAITS */
);
size_type n = 0;
for (vertex_iter v = dfs_vertices.begin(); v != dfs_vertices.end();
Expand Down Expand Up @@ -617,10 +597,6 @@ namespace detail
std::vector< std::size_t > in_degree1_vec(num_vertices(G1));
typedef safe_iterator_property_map<
std::vector< std::size_t >::iterator, IndexMap1
#ifdef BOOST_NO_STD_ITERATOR_TRAITS
,
std::size_t, std::size_t&
#endif /* BOOST_NO_STD_ITERATOR_TRAITS */
>
InDeg1;
InDeg1 in_degree1(
Expand All @@ -630,10 +606,6 @@ namespace detail
std::vector< std::size_t > in_degree2_vec(num_vertices(G2));
typedef safe_iterator_property_map<
std::vector< std::size_t >::iterator, IndexMap2
#ifdef BOOST_NO_STD_ITERATOR_TRAITS
,
std::size_t, std::size_t&
#endif /* BOOST_NO_STD_ITERATOR_TRAITS */
>
InDeg2;
InDeg2 in_degree2(
Expand Down
Loading