SimplexTree

SimplexTree

Functions

Name Description
SimplexTree.insert Inserts simplices into the Simplex Tree.
SimplexTree.remove Removes simplices into the Simplex Tree.
SimplexTree.find Finds whether simplices exist in Simplex Tree.
SimplexTree.adjacent Finds adjacent vertices of a collection of vertices.
SimplexTree.collapse Performs an elementary collapse on two given simplices.
SimplexTree.contract Performs an pair contraction.
SimplexTree.vertex_collapse Maps a pair of vertices into a single vertex.
SimplexTree.degree Computes the degree of select vertices in the trie.
SimplexTree.traverse Traverses the simplex tree in the specified order, calling f on each simplex encountered.
SimplexTree.cofaces Returns the cofaces of sigma.
SimplexTree.skeleton Returns the simplices in the p-skeleton of sigma.
SimplexTree.simplices Returns the p-simplices in the complex.
SimplexTree.faces Returns the p-faces of a given simplex.
SimplexTree.maximal Returns the maximal simplices in the complex.
SimplexTree.link Returns the simplices in the link of sigma.
SimplexTree.expand Performs a k-expansion of the complex.
SimplexTree.reindex Reindexes the vertex labels of the complex.
SimplexTree.dim
SimplexTree.card Returns the cardinality of various skeleta of the complex.
SimplexTree.print
SimplexTree.__iter__
SimplexTree.__contains__
SimplexTree.__len__