@@ -180,7 +180,8 @@ class Graph
180180 /* *
181181 * @brief Construct graph without edges, creating a node for each id in node_ids from the same node_args.
182182 */
183- template <class ... Args> requires std::constructible_from<NodePropertyT, Args...>
183+ template <class ... Args>
184+ requires std::constructible_from<NodePropertyT, Args...>
184185 Graph (const std::vector<int >& node_ids, Args&&... node_args)
185186 {
186187 for (int id : node_ids) {
@@ -191,7 +192,8 @@ class Graph
191192 /* *
192193 * @brief Construct graph without edges, creating each node from the same node_args with default node ids [0, 1, ...].
193194 */
194- template <class ... Args> requires std::constructible_from<NodePropertyT, Args...>
195+ template <class ... Args>
196+ requires std::constructible_from<NodePropertyT, Args...>
195197 Graph (const int number_of_nodes, Args&&... args)
196198 {
197199 for (int id = 0 ; id < number_of_nodes; ++id) {
@@ -213,7 +215,8 @@ class Graph
213215 * @param id id for the node
214216 * @tparam args additional arguments for node construction
215217 */
216- template <class ... Args> requires std::constructible_from<NodePropertyT, Args...>
218+ template <class ... Args>
219+ requires std::constructible_from<NodePropertyT, Args...>
217220 void add_node (int id, Args&&... args)
218221 {
219222 m_nodes.emplace_back (id, std::forward<Args>(args)...);
@@ -227,7 +230,8 @@ class Graph
227230 *
228231 * If an edge with the same start and end node indices already exists, it is replaced by the newly constructed edge.
229232 */
230- template <class ... Args> requires std::constructible_from<EdgePropertyT, Args...>
233+ template <class ... Args>
234+ requires std::constructible_from<EdgePropertyT, Args...>
231235 void add_edge (size_t start_node_idx, size_t end_node_idx, Args&&... args)
232236 {
233237 assert (m_nodes.size () > start_node_idx && m_nodes.size () > end_node_idx);
0 commit comments