Applied clang-format.

include/graph/algorithm/experimental/visitor_dijkstra.hpp

@@ -228,8 +228,8 @@ void dijkstra_with_visitor(
       Compare&& compare = less<ranges::range_value_t<Distances>>(),
       Combine&& combine = plus<ranges::range_value_t<Distances>>(),
       Queue     queue   = Queue()) {
-  dijkstra_with_visitor(g_, forward<Visitor>(visitor), ranges::subrange(&seed, (&seed + 1)), predecessor,
-                               distances, weight, forward<Compare>(compare), forward<Combine>(combine), queue);
+  dijkstra_with_visitor(g_, forward<Visitor>(visitor), ranges::subrange(&seed, (&seed + 1)), predecessor, distances,
+                        weight, forward<Compare>(compare), forward<Combine>(combine), queue);
 }
 
 } // namespace std::graph::experimental

include/graph/container/compressed_graph.hpp

@@ -231,7 +231,7 @@ class csr_row_values<EV, void, GV, VId, EIndex, Alloc> {
   using value_type = void;
   using size_type  = size_t; //VId;
 
-public:                      // Properties
+public: // Properties
   [[nodiscard]] constexpr size_type size() const noexcept { return 0; }
   [[nodiscard]] constexpr bool      empty() const noexcept { return true; }
   [[nodiscard]] constexpr size_type capacity() const noexcept { return 0; }
@@ -343,7 +343,7 @@ class csr_col_values<void, VV, GV, VId, EIndex, Alloc> {
   using value_type = void;
   using size_type  = size_t; //VId;
 
-public:                      // Properties
+public: // Properties
   [[nodiscard]] constexpr size_type size() const noexcept { return 0; }
   [[nodiscard]] constexpr bool      empty() const noexcept { return true; }
   [[nodiscard]] constexpr size_type capacity() const noexcept { return 0; }
@@ -516,7 +516,7 @@ class compressed_graph_base
   }
 
 public:
-public:                            // Operations
+public: // Operations
   void reserve_vertices(size_type count) {
     row_index_.reserve(count + 1); // +1 for terminating row
     row_values_base::reserve(count);
@@ -803,13 +803,13 @@ class compressed_graph_base
 private: // CPO properties
   friend constexpr vertices_type vertices(compressed_graph_base& g) {
     if (g.row_index_.empty())
-      return vertices_type(g.row_index_);                                 // really empty
+      return vertices_type(g.row_index_); // really empty
     else
       return vertices_type(g.row_index_.begin(), g.row_index_.end() - 1); // don't include terminating row
   }
   friend constexpr const_vertices_type vertices(const compressed_graph_base& g) {
     if (g.row_index_.empty())
-      return const_vertices_type(g.row_index_);                                 // really empty
+      return const_vertices_type(g.row_index_); // really empty
     else
       return const_vertices_type(g.row_index_.begin(), g.row_index_.end() - 1); // don't include terminating row
   }
@@ -826,15 +826,15 @@ class compressed_graph_base
   friend constexpr edges_type edges(graph_type& g, vertex_type& u) {
     static_assert(ranges::contiguous_range<row_index_vector>, "row_index_ must be a contiguous range to get next row");
     vertex_type* u2 = &u + 1;
-    assert(static_cast<size_t>(u2 - &u) < g.row_index_.size());    // in row_index_ bounds?
+    assert(static_cast<size_t>(u2 - &u) < g.row_index_.size()); // in row_index_ bounds?
     assert(static_cast<size_t>(u.index) <= g.col_index_.size() &&
            static_cast<size_t>(u2->index) <= g.col_index_.size()); // in col_index_ bounds?
     return edges_type(g.col_index_.begin() + u.index, g.col_index_.begin() + u2->index);
   }
   friend constexpr const_edges_type edges(const graph_type& g, const vertex_type& u) {
     static_assert(ranges::contiguous_range<row_index_vector>, "row_index_ must be a contiguous range to get next row");
     const vertex_type* u2 = &u + 1;
-    assert(static_cast<size_t>(u2 - &u) < g.row_index_.size());    // in row_index_ bounds?
+    assert(static_cast<size_t>(u2 - &u) < g.row_index_.size()); // in row_index_ bounds?
     assert(static_cast<size_t>(u.index) <= g.col_index_.size() &&
            static_cast<size_t>(u2->index) <= g.col_index_.size()); // in col_index_ bounds?
     return const_edges_type(g.col_index_.begin() + u.index, g.col_index_.begin() + u2->index);

include/graph/container/dynamic_graph.hpp

@@ -1254,7 +1254,7 @@ class dynamic_graph_base {
   constexpr typename vertices_type::value_type&       operator[](size_type i) noexcept { return vertices_[i]; }
   constexpr const typename vertices_type::value_type& operator[](size_type i) const noexcept { return vertices_[i]; }
 
-public:                                      // Operations
+public: // Operations
   void reserve_vertices(size_type count) {
     if constexpr (reservable<vertices_type>) // reserve if we can; otherwise ignored
       vertices_.reserve(count);
@@ -1271,13 +1271,13 @@ class dynamic_graph_base {
     // ignored for this graph; may be meaningful for another data structure like CSR
   }
 
-private:                       // Member Variables
+private: // Member Variables
   vertices_type    vertices_;
   partition_vector partition_; // partition_[n] holds the first vertex id for each partition n
                                // holds +1 extra terminating partition
   size_t edge_count_ = 0;      // total number of edges in the graph
 
-private:                       // CPO properties
+private: // CPO properties
   friend constexpr vertices_type&       vertices(dynamic_graph_base& g) { return g.vertices_; }
   friend constexpr const vertices_type& vertices(const dynamic_graph_base& g) { return g.vertices_; }
 
@@ -1732,7 +1732,7 @@ class dynamic_graph : public dynamic_graph_base<EV, VV, GV, VId, Sourced, Traits
 private:
   value_type value_; ///< Graph value
 
-private:             // CPO properties
+private: // CPO properties
   friend constexpr value_type&       graph_value(graph_type& g) { return g.value_; }
   friend constexpr const value_type& graph_value(const graph_type& g) { return g.value_; }
 };

tests/co_dijkstra_tests.cpp

@@ -81,8 +81,7 @@ TEST_CASE("co_dijstra_clrs test", "[dynamic][dijkstra][bfs][vertex][coroutine]")
 
   SECTION("co_dijkstra fnc vertices") {
     auto distance = [&g](edge_reference_t<G> uv) -> double { return edge_value(g, uv); };
-    for (auto bfs = co_dijkstra(g, dijkstra_events::discover_vertex, seeds, predecessors, distances, distance);
-         bfs;) {
+    for (auto bfs = co_dijkstra(g, dijkstra_events::discover_vertex, seeds, predecessors, distances, distance); bfs;) {
       auto&& [event, payload] = bfs();
       switch (event) {
       case dijkstra_events::discover_vertex: {