# SimplexTree

This is an internal module used for representing simplicial complexes.

The methods in here allow for low level manipulation of the simplicial structure and may break the representation assumptions made throughout the remainder of the code. Only use these if you know what you are doing (and really need to do that).

Hodge.SimplexTrees.SimplexTreeType

Store a simplicial complex using the Simplex Tree data structure.

Based on the paper:

• Jean-Daniel Boissonnat, Clément Maria. The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes. [Research Report] RR-7993, 2012, pp.20. hal-00707901v1
source
Hodge.SimplexTrees.foldSTMethod
foldST(st::SimplexTree; basecase, joiner)

Fold st applying the function basecase to the leafs and joining siblings using the function joiner.

source
Hodge.SimplexTrees.numsimplicesMethod
numsimplices(st, k)

Return the number of k-simplices of st.

This is a more efficient implementation of length ∘ getsimplices.

source