Sage code for enumeration of level-2 Coxeter graphs

This is the public release of the Sage code for enumerating 326 connected level-2 Coxeter graphs with at least 5 vertices. These Coxeter graphs correspond to ball packings as described in this paper (joint work with J.-P. Labbé). The algorithm of the code is described in the same paper.

Here, we follow the idea of Maxwell, so the simple roots are the basis of the Lorentz space, and the fundamental weights are the dual basis. The more general case where the simple roots are positively independent will be considered in the future releases.