Loading...
Searching...
No Matches
SimplicialComplexForCech.h
1/* This file is part of the Gudhi Library - https://gudhi.inria.fr/ - which is released under MIT.
2 * See file LICENSE or go to https://gudhi.inria.fr/licensing/ for full license details.
3 * Author(s): Vincent Rouvreau
4 *
5 * Copyright (C) 2018 Inria
6 *
7 * Modification(s):
8 * - YYYY/MM Author: Description of the modification
9 */
10
11#ifndef CONCEPT_CECH_COMPLEX_SIMPLICIAL_COMPLEX_FOR_CECH_H_
12#define CONCEPT_CECH_COMPLEX_SIMPLICIAL_COMPLEX_FOR_CECH_H_
13
14namespace Gudhi {
15
16namespace cech_complex {
17
23 typedef unspecified Simplex_handle;
25 typedef unspecified Vertex_handle;
27 typedef unspecified Filtration_value;
28
31
34 Simplex_vertex_range simplex_vertex_range(Simplex_handle const & simplex);
35
37 template<class ProximityGraph>
38 void insert_graph(const ProximityGraph& proximity_graph);
39
42 template< typename Blocker >
43 void expansion_with_blockers(int max_dim, Blocker block_simplex);
44
46 std::size_t num_vertices();
47
48};
49
50} // namespace cech_complex
51
52} // namespace Gudhi
53
54#endif // CONCEPT_CECH_COMPLEX_SIMPLICIAL_COMPLEX_FOR_CECH_H_
The concept SimplicialComplexForCech describes the requirements for a type to implement a simplicial ...
Definition: SimplicialComplexForCech.h:21
int assign_filtration(Simplex_handle simplex, Filtration_value filtration)
Simplex_vertex_range simplex_vertex_range(Simplex_handle const &simplex)
Returns a range over vertices of a given simplex.
unspecified Filtration_value
Definition: SimplicialComplexForCech.h:27
void insert_graph(const ProximityGraph &proximity_graph)
Inserts a given Gudhi::ProximityGraph in the simplicial complex.
void expansion_with_blockers(int max_dim, Blocker block_simplex)
Expands the simplicial complex containing only its one skeleton until a given maximal dimension....
unspecified Vertex_handle
Definition: SimplicialComplexForCech.h:25
unspecified Simplex_handle
Definition: SimplicialComplexForCech.h:23