refactor: Simplify recursive depth_first_search

oboukli · Feb 1, 2025 · 57fc2f1 · 57fc2f1
1 parent 2d79d93
commit 57fc2f1
Showing 1 changed file with 3 additions and 8 deletions.
diff --git a/include/forfun/graph/depth_first_search.hpp b/include/forfun/graph/depth_first_search.hpp
@@ -37,16 +37,11 @@ constexpr auto depth_first_search_imp(
     vertex_state_list[start] = vertex_visit_state::visited;
     preorder_step(start);
 
-    auto const adjacencies_iter{
-        get_adjacencies_iter(vertex_adjacency_list, start)
-    };
+    auto const adj_iter{get_adjacencies_iter(vertex_adjacency_list, start)};
 
-    auto itr{adjacencies_iter->cbegin()};
-    auto const end{adjacencies_iter->cend()};
-
-    for (; itr != end; ++itr)
+    for (auto iter{adj_iter->cbegin()}; iter != adj_iter->cend(); ++iter)
     {
-        if (auto const adjacency{*itr};
+        if (auto const adjacency{*iter};
             vertex_state_list[adjacency] == vertex_visit_state::unvisited)
         {
             depth_first_search_imp(