Applied clang-format.

stdgraph · May 28, 2023 · d6d75b8 · d6d75b8
1 parent 64abe31
commit d6d75b8
Showing 1 changed file with 12 additions and 12 deletions.
diff --git a/include/graph/views/depth_first_search.hpp b/include/graph/views/depth_first_search.hpp
@@ -617,12 +617,12 @@ TAG_INVOKE_DEF(vertices_depth_first_search); // vertices_depth_first_search(g,se
 
 template <class G, class A>
 concept _has_vtx_dfs_adl = vertex_range<G> && requires(G&& g, vertex_id_t<G> seed, const A& alloc) {
-                                                { vertices_depth_first_search(g, seed, alloc) };
-                                              };
+  { vertices_depth_first_search(g, seed, alloc) };
+};
 template <class G, class VVF, class A>
 concept _has_vtx_dfs_vvf_adl = vertex_range<G> && requires(G&& g, vertex_id_t<G> seed, const VVF& vvf, const A& alloc) {
-                                                    { vertices_depth_first_search(g, seed, vvf, alloc) };
-                                                  };
+  { vertices_depth_first_search(g, seed, vvf, alloc) };
+};
 
 // edges_depth_first_search CPO
 //  sourced_edges_depth_first_search
@@ -633,22 +633,22 @@ TAG_INVOKE_DEF(sourced_edges_depth_first_search); // sourced_edges_depth_first_s
 
 template <class G, class A>
 concept _has_edg_dfs_adl = vertex_range<G> && requires(G&& g, vertex_id_t<G> seed, const A& alloc) {
-                                                { edges_depth_first_search(g, seed, alloc) };
-                                              };
+  { edges_depth_first_search(g, seed, alloc) };
+};
 template <class G, class EVF, class A>
 concept _has_edg_dfs_evf_adl = vertex_range<G> && requires(G&& g, vertex_id_t<G> seed, const EVF& evf, const A& alloc) {
-                                                    { edges_depth_first_search(g, seed, evf, alloc) };
-                                                  };
+  { edges_depth_first_search(g, seed, evf, alloc) };
+};
 
 template <class G, class A>
 concept _has_src_edg_dfs_adl = vertex_range<G> && requires(G&& g, vertex_id_t<G> seed, const A& alloc) {
-                                                    { sourced_edges_depth_first_search(g, seed, alloc) };
-                                                  };
+  { sourced_edges_depth_first_search(g, seed, alloc) };
+};
 template <class G, class EVF, class A>
 concept _has_src_edg_dfs_evf_adl =
       vertex_range<G> && requires(G&& g, vertex_id_t<G> seed, const EVF& evf, const A& alloc) {
-                           { sourced_edges_depth_first_search(g, seed, evf, alloc) };
-                         };
+        { sourced_edges_depth_first_search(g, seed, evf, alloc) };
+      };
 } // namespace std::graph::tag_invoke