pub struct SimplexTree {
pub simplices: Vec<FilteredSimplex>,
}Expand description
Simplex tree data structure for filtration-based TDA.
Stores all simplices sorted by filtration value, supporting insertion, lookup, and filtration-order iteration.
Fields§
§simplices: Vec<FilteredSimplex>All simplices, in arbitrary insertion order.
Implementations§
Source§impl SimplexTree
impl SimplexTree
Sourcepub fn insert(&mut self, vertices: Vec<usize>, f: f64)
pub fn insert(&mut self, vertices: Vec<usize>, f: f64)
Insert a simplex defined by vertices at filtration value f.
Vertices are sorted before insertion.
Sourcepub fn from_vietoris_rips(vr: &VietorisRips) -> Self
pub fn from_vietoris_rips(vr: &VietorisRips) -> Self
Build a SimplexTree from a VietorisRips complex.
Inserts all vertices (at f=0), edges, and triangles at their respective filtration values (maximum edge length).
Sourcepub fn sorted_simplices(&self) -> Vec<&FilteredSimplex>
pub fn sorted_simplices(&self) -> Vec<&FilteredSimplex>
Return all simplices sorted by filtration value (ascending).
Sourcepub fn max_filtration(&self) -> f64
pub fn max_filtration(&self) -> f64
Filtration threshold that includes all simplices (maximum filtration value).
Trait Implementations§
Source§impl Clone for SimplexTree
impl Clone for SimplexTree
Source§fn clone(&self) -> SimplexTree
fn clone(&self) -> SimplexTree
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for SimplexTree
impl Debug for SimplexTree
Source§impl Default for SimplexTree
impl Default for SimplexTree
Source§fn default() -> SimplexTree
fn default() -> SimplexTree
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl Freeze for SimplexTree
impl RefUnwindSafe for SimplexTree
impl Send for SimplexTree
impl Sync for SimplexTree
impl Unpin for SimplexTree
impl UnsafeUnpin for SimplexTree
impl UnwindSafe for SimplexTree
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.