summaryrefslogtreecommitdiff
path: root/src/Collapse/include/gudhi/Flag_complex_edge_collapser.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/Collapse/include/gudhi/Flag_complex_edge_collapser.h')
-rw-r--r--src/Collapse/include/gudhi/Flag_complex_edge_collapser.h8
1 files changed, 4 insertions, 4 deletions
diff --git a/src/Collapse/include/gudhi/Flag_complex_edge_collapser.h b/src/Collapse/include/gudhi/Flag_complex_edge_collapser.h
index 6afeaefc..02460efb 100644
--- a/src/Collapse/include/gudhi/Flag_complex_edge_collapser.h
+++ b/src/Collapse/include/gudhi/Flag_complex_edge_collapser.h
@@ -218,7 +218,7 @@ class Flag_complex_edge_collapser {
if ((closed && rw_u == rw_v) ||
(ei = it.value()) <= current_backward ||
critical_edge_indicator_[ei]) {
- neighbors.push_back(rw_v);
+ neighbors.emplace_back(rw_v);
#ifdef DEBUG_TRACES
std::cout << row_to_vertex_[rw_v] << ", " ;
#endif // DEBUG_TRACES
@@ -254,7 +254,7 @@ class Flag_complex_edge_collapser {
// Initializing the diagonal element of the adjency matrix corresponding to rw_b.
sparse_row_adjacency_matrix_[n].insert(n) = -1; // not an edge
// Must be done after reading its size()
- row_to_vertex_.push_back(vertex);
+ row_to_vertex_.emplace_back(vertex);
}
return result.first->second;
}
@@ -319,7 +319,7 @@ class Flag_complex_edge_collapser {
auto edge = *(edge_it.first);
Vertex_handle u = source(edge, one_skeleton_graph);
Vertex_handle v = target(edge, one_skeleton_graph);
- f_edge_vector_.push_back({{u, v}, boost::get(Gudhi::edge_filtration_t(), one_skeleton_graph, edge)});
+ f_edge_vector_.emplace_back(Filtered_edge({u, v}, boost::get(Gudhi::edge_filtration_t(), one_skeleton_graph, edge)));
}
}
@@ -353,7 +353,7 @@ class Flag_complex_edge_collapser {
IEdge ie = insert_new_edge(u, v, endIdx);
iedge_to_index_map_.emplace(ie, endIdx);
- critical_edge_indicator_.push_back(false);
+ critical_edge_indicator_.emplace_back(false);
if (!edge_is_dominated(edge)) {
critical_edge_indicator_[endIdx] = true;