Abstract simplex used in Skeleton blockers data-structure.
More...
template<typename T>
class Gudhi::skeleton_blocker::Skeleton_blocker_simplex< T >
Abstract simplex used in Skeleton blockers data-structure.
An abstract simplex is represented as an ordered set of T elements, each element representing a vertex.
The element representing a vertex can be SkeletonBlockerDS::Vertex_handle or SkeletonBlockerDS::Root_vertex_handle.
- Examples
- Skeleton_blocker_from_simplices.cpp, Skeleton_blocker_iteration.cpp, Skeleton_blocker_link.cpp, and simple_toplex_map.cpp.
◆ Skeleton_blocker_simplex()
Initialize a simplex with a string such as {0,1,2}
◆ add_vertex()
Add the vertex v to the simplex: Note that adding two times the same vertex is the same that adding it once.
◆ contains()
- Returns
- true iff the simplex contains the simplex a.
◆ contains_difference() [1/3]
- Returns
- true iff the simplex contains the difference \( a \setminus b \).
◆ contains_difference() [2/3]
- Returns
- true iff the simplex contains the difference \( a \setminus \{ x \} \).
◆ contains_difference() [3/3]
- Returns
- true iff the simplex contains the difference \( a \setminus \{ x,y \} \).
◆ difference()
Substracts a from the simplex.
◆ dimension()
Returns the dimension of the simplex.
◆ first_vertex()
Returns the first and smallest vertex of the simplex.
Be careful : assumes the simplex is non-empty.
◆ intersection()
Intersects the simplex with the simplex a.
◆ last_vertex()
Returns the last and greatest vertex of the simplex.
Be careful : assumes the simplex is non-empty.
◆ remove_vertex()
Remove the vertex v from the simplex:
◆ union_vertices()
Add vertices of a to the simplex.
The documentation for this class was generated from the following file: