summaryrefslogtreecommitdiff
path: root/src/Collapse/include
AgeCommit message (Collapse)Author
2020-06-25Remove interface with boost graphs and use boost transform for data from graphsROUVREAU Vincent
2020-06-25Doc review: no duplicated edgesROUVREAU Vincent
2020-06-25Doc review: link on recent boost docROUVREAU Vincent
2020-06-25Merge conflictsROUVREAU Vincent
2020-06-25Code review: remove 'boost::' in front of edges and get methodROUVREAU Vincent
2020-06-23Fix uses of emplace_backMarc Glisse
2020-06-22Don't explicitly copy the neighbors to a vector each timeMarc Glisse
2020-06-18Code review: modify last element with final aka. std::endROUVREAU Vincent
2020-06-18Code review: Use a flat (u, v, filt) instead of (pair(u, v), filt)ROUVREAU Vincent
2020-06-18Code review: replace push_back with emplace_backROUVREAU Vincent
2020-06-18code review: graph not hardcoded. Implies ctor from filtered edges to be ↵ROUVREAU Vincent
modified
2020-06-18Code review: rename Flag_complex_sparse_matrix as edge_collapser and ↵ROUVREAU Vincent
filtered_edge_collapse method as process_edges
2020-06-17Map *internal* edges to their indexMarc Glisse
2020-06-17Let insert_vertex return some infoMarc Glisse
2020-06-17Expand the matrix dynamically when inserting new verticesMarc Glisse
2020-06-17Split Row_index into IVertex and Edge_indexMarc Glisse
We can always choose other names, the main goal was being able to identify what is what from the name.
2020-06-11Make some neighborhoods openMarc Glisse
2020-06-11Replace SparseMatrix with vector<SparseVector>Marc Glisse
This makes insertions much faster
2020-06-11Store edge indices instead of unused filtration value, in the matrixMarc Glisse
2020-06-11Make u_set_dominated_edges_ implicitMarc Glisse
2020-06-11Remove unused u_set_removed_edges_Marc Glisse
2020-06-04rollback 85dc5c1 as the information is not quite the same in both structureROUVREAU Vincent
2020-06-04code review: better use a for loopROUVREAU Vincent
2020-06-04code review: remove u_set_dominated_edges_ as it is redundant with ↵ROUVREAU Vincent
critical_edge_indicator_
2020-06-04code review: no need to loop backwardROUVREAU Vincent
2020-06-02code review: GUDHI_CHECK if u==v oninsert_edge methodROUVREAU Vincent
2020-06-02code review: Remove the clear as this function won't be called several timesROUVREAU Vincent
2020-05-25Code review: remove inner_effected_indcs clear as it will be done when ↵ROUVREAU Vincent
closing the brackets
2020-05-25Code review: filtered_edge_collapse is not requiring an output_iterator but ↵ROUVREAU Vincent
a callback/functor
2020-05-25Code review: add some comments on three_clique_indicesROUVREAU Vincent
2020-05-25Code review: remove effected_indices clearROUVREAU Vincent
2020-05-25Code review: Remove domination_indicator_ as it is a left over from strong ↵ROUVREAU Vincent
collapse
2020-05-25Code review: No need to pass an edge to closed_common_neighbours_row_index, ↵ROUVREAU Vincent
can be 2 vertices as it simplifies the code
2020-05-25Code review: rename check_edge_domination as edge_is_dominatedROUVREAU Vincent
2020-05-25Code review: rows_ is not mandatoryROUVREAU Vincent
2020-05-25Code review: emplace wo std::make_pairROUVREAU Vincent
2020-05-25Code review: use emplace on unordered_map in insert_vertexROUVREAU Vincent
2020-05-25Code review: Rename insert_new_edge methodROUVREAU Vincent
2020-05-25Use C++ boolean logical operatorROUVREAU Vincent
2020-05-25Code review: Remove num_vertices and initialize sparse matrix in the constructorROUVREAU Vincent
2020-05-25Code review: use std::sort instead of std::stable_sortROUVREAU Vincent
2020-05-25Code review: row_to_vertex_ can be a vectorROUVREAU Vincent
2020-04-28Code and doc review fixROUVREAU Vincent
2020-04-14Windows appveyor do not like not operatorROUVREAU Vincent
2020-04-14Some documentation and examplesROUVREAU Vincent
2020-04-14Some documentationROUVREAU Vincent
2020-04-13Add some documentationROUVREAU Vincent
2020-04-13Remove Rips_edge_list and review the interfacesROUVREAU Vincent
2020-04-12Modify interface and utilsROUVREAU Vincent
2020-04-12constifyROUVREAU Vincent