Skip to main content

SimplicialComplex

Struct SimplicialComplex 

Source
pub struct SimplicialComplex {
    pub simplices: Vec<Vec<usize>>,
    pub n_vertices: usize,
}
Expand description

A simplicial complex defined by a collection of simplices over a vertex set.

A simplex is a list of vertex indices; e.g., [0,1,2] is a triangle. The complex automatically includes all faces (sub-simplices) when a simplex is added.

Fields§

§simplices: Vec<Vec<usize>>

All simplices stored as sorted vertex-index lists.

§n_vertices: usize

Number of vertices (0-simplices) in the complex.

Implementations§

Source§

impl SimplicialComplex

Source

pub fn new(n_vertices: usize) -> Self

Create an empty simplicial complex with n_vertices vertices.

Source

pub fn add_simplex(&mut self, simplex: &[usize])

Add a simplex (and all its faces) to the complex.

simplex is a slice of vertex indices. Duplicate simplices are ignored.

Source

pub fn k_simplices(&self, k: usize) -> Vec<&Vec<usize>>

Return all k-simplices (simplices of dimension k).

Source

pub fn boundary_operator(&self, k: usize) -> Vec<Vec<i32>>

Compute the boundary operator matrix ∂_k as a matrix over .

Rows index (k-1)-simplices, columns index k-simplices. Entry [i][j] is ±1 if the i-th (k-1)-simplex is the i-th face of the j-th k-simplex (with the appropriate sign), or 0 otherwise.

Source

pub fn betti_numbers(&self) -> Vec<usize>

Compute Betti numbers β_0, β_1, … via Smith normal form over .

β_k = dim(ker ∂_k) − dim(im ∂_{k+1}).

Source

pub fn euler_characteristic(&self) -> i32

Euler characteristic χ = Σ_k (-1)^k * #(k-simplices).

Source

pub fn is_manifold(&self) -> bool

Check if the complex is a (combinatorial) manifold.

Every (n-1)-simplex must be shared by exactly 1 or 2 n-simplices, and the link of every vertex must be a sphere or a ball.

Source

pub fn skeleton(&self, k: usize) -> Self

Return the k-skeleton (sub-complex of all simplices of dimension ≤ k).

Return the link of vertex v.

lk(v) = { τ ∈ K | v ∉ τ, {v} ∪ τ ∈ K }.

Source

pub fn star(&self, v: usize) -> Self

Return the star of vertex v.

st(v) = { σ ∈ K | v ∈ σ }.

Trait Implementations§

Source§

impl Clone for SimplicialComplex

Source§

fn clone(&self) -> SimplicialComplex

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for SimplicialComplex

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.