diff options
| author | Vincent Rouvreau <vincent.rouvreau@inria.fr> | 2022-06-17 16:33:54 +0200 |
|---|---|---|
| committer | Vincent Rouvreau <vincent.rouvreau@inria.fr> | 2022-06-17 16:33:54 +0200 |
| commit | fc910c1bcb3451bcf3e288db25fecafe15cc42bb (patch) | |
| tree | 1be9b439b0e74eb04c873612dbca28990284f24c /src/Collapse/include/gudhi/Flag_complex_edge_collapser.h | |
| parent | 048fff97cd0a53be5953c4d5799f8e2e097c181c (diff) | |
| parent | 854ae4169ece5edfaae15526f42314b0976e2b84 (diff) | |
Merge master
Diffstat (limited to 'src/Collapse/include/gudhi/Flag_complex_edge_collapser.h')
| -rw-r--r-- | src/Collapse/include/gudhi/Flag_complex_edge_collapser.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/Collapse/include/gudhi/Flag_complex_edge_collapser.h b/src/Collapse/include/gudhi/Flag_complex_edge_collapser.h index c823901f..d0b3fe4a 100644 --- a/src/Collapse/include/gudhi/Flag_complex_edge_collapser.h +++ b/src/Collapse/include/gudhi/Flag_complex_edge_collapser.h @@ -53,7 +53,7 @@ struct Flag_complex_edge_collapser { #ifdef GUDHI_COLLAPSE_USE_DENSE_ARRAY // Minimal matrix interface // Using this matrix generally helps performance, but the memory use may be excessive for a very sparse graph - // (and in extreme cases the constant initialization of the matrix may start to dominate the runnning time). + // (and in extreme cases the constant initialization of the matrix may start to dominate the running time). // Are there cases where the matrix is too big but a hash table would help? std::vector<Filtration_value> neighbors_data; void init_neighbors_dense(){ |