This [package][1] provides data structures and algorithms for combinatorial topology. Currently, it can handle filtered simplicial complexes, directed complexes, and combinatorial codes. The package is written in [Julia][2]. The long-term goal of this project is to be a "swiss-knife" for manipulating (very large) combinatorial structures, with an eye towards topological data analysis. This software is free under the terms of the GNU General Public License ([GPLv3][3]). The work was supported by the ARO award W911NF-15-1-0084 and NIH R01GM117592. DISCLAIMER: This software is still in development. The documentation is currently very sparse. Use at your own risk! Please let us know if you'd like to contribute. This package interfaces with existing TDA software for homology computations. Currently it uses [PHAT][4] and [Perseus][5]. In the future, Simplicial will interface with other TDA software as well. [1]: https://github.com/nebneuron/Simplicial.jl [2]: https://julialang.org/ [3]: http://www.gnu.org/licenses/gpl-3.0.html [4]: https://github.com/blazs/phat [5]: http://people.maths.ox.ac.uk/nanda/perseus/index.html