|
| | simplex_coboundary_enumerator (const diameter_entry_t _simplex, index_t _dim, const Ripser< compressed_lower_distance_matrix > &parent) |
| |
| bool | has_next (bool all_cofacets=true) |
| |
| diameter_entry_t | next () |
| |
| | simplex_coboundary_enumerator (const diameter_entry_t _simplex, const index_t _dim, const Ripser< sparse_distance_matrix > &parent) |
| |
| bool | has_next (bool all_cofacets=true) |
| |
| diameter_entry_t | next () |
| |
| std::vector< diameter_index_t > | get_edges () |
| |
| std::vector< diameter_index_t > | get_edges () |
| |
| | Ripser (compressed_lower_distance_matrix &&_dist, index_t _dim_max, value_t _threshold, float _ratio, bool _critical_edges_only, bool _infinite_pairs, coefficient_t _modulus) |
| |
| index_t | get_max_vertex (const index_t idx, const index_t k, const index_t n_) const |
| |
| index_t | get_edge_index (const index_t i, const index_t j) const |
| |
| OutputIterator | get_simplex_vertices (index_t idx, const index_t dim, index_t n_, OutputIterator out) const |
| |
| void | assemble_columns_to_reduce (std::vector< diameter_index_t > &simplices, std::vector< diameter_index_t > &columns_to_reduce, entry_hash_map &pivot_column_index, index_t dim) |
| |
| void | compute_dim_0_pairs (std::vector< diameter_index_t > &edges, std::vector< diameter_index_t > &columns_to_reduce, PersistenceType &ph) |
| |
| diameter_entry_t | pop_pivot (Column &column) |
| |
| diameter_entry_t | get_pivot (Column &column) |
| |
| diameter_entry_t | init_coboundary_and_get_pivot (const diameter_entry_t simplex, Column &working_coboundary, const index_t &dim, entry_hash_map &pivot_column_index) |
| |
| void | add_simplex_coboundary (const diameter_entry_t simplex, const index_t &dim, Column &working_reduction_column, Column &working_coboundary) |
| |
| void | add_coboundary (compressed_sparse_matrix< diameter_entry_t > &reduction_matrix, const std::vector< diameter_index_t > &columns_to_reduce, const size_t index_column_to_add, const coefficient_t factor, const size_t &dim, Column &working_reduction_column, Column &working_coboundary) |
| |
| Edge | find_longest_edge (const Simplex &vertices) const |
| |
| void | compute_pairs (std::vector< diameter_index_t > &columns_to_reduce, entry_hash_map &pivot_column_index, index_t dim, PersistenceType &ph) |
| |
| std::vector< diameter_index_t > | get_edges () |
| |
| std::vector< diameter_index_t > | get_edges () |
| |
| std::vector< diameter_index_t > | get_edges () |
| |
| void | compute_barcodes (PersistenceType &ph) |
| |
template<typename DistanceMatrix>
class Ripser< DistanceMatrix >::simplex_coboundary_enumerator
Definition at line 991 of file ripser.cpp.