Applied clang-format.

stdgraph · Sep 12, 2024 · 3d572ef · 3d572ef
1 parent 4f4a148
commit 3d572ef
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 5 deletions.
diff --git a/include/graph/algorithm/bellman_ford_shortest_paths.hpp b/include/graph/algorithm/bellman_ford_shortest_paths.hpp
@@ -233,8 +233,7 @@ requires is_arithmetic_v<range_value_t<Distances>> &&                   //
       Compare&& compare = less<range_value_t<Distances>>(),
       Combine&& combine = plus<range_value_t<Distances>>()) {
   return bellman_ford_shortest_paths(g, subrange(&source, (&source + 1)), distances, predecessor, weight,
-                                     forward<Visitor>(visitor), forward<Compare>(compare),
-                                     forward<Combine>(combine));
+                                     forward<Visitor>(visitor), forward<Compare>(compare), forward<Combine>(combine));
 }
 
 
@@ -288,8 +287,7 @@ requires convertible_to<range_value_t<Sources>, vertex_id_t<G>> && //
       Compare&& compare = less<range_value_t<Distances>>(),
       Combine&& combine = plus<range_value_t<Distances>>()) {
   return bellman_ford_shortest_paths(g, sources, distances, _null_predecessors, forward<WF>(weight),
-                                     forward<Visitor>(visitor), forward<Compare>(compare),
-                                     forward<Combine>(combine));
+                                     forward<Visitor>(visitor), forward<Compare>(compare), forward<Combine>(combine));
 }
 
 template <index_adjacency_list G,

diff --git a/tests/dijkstra_shortest_paths_tests.cpp b/tests/dijkstra_shortest_paths_tests.cpp
@@ -90,7 +90,7 @@ auto to_string(const Predecessors& predecessors) {
   return pred;
 }
 
-template<typename G>
+template <typename G>
 using visited_vertex_t = vertex_descriptor<vertex_id_t<G>, vertex_reference_t<G>, void>;
 template <typename G>
 using visited_edge_t = edge_descriptor<vertex_id_t<G>, true, edge_reference_t<G>, void>;