Java library to determine if face pairing graphs are admissible.
Note that you will also need the LibTW library. This library was originally taken from http://www.treewidth.com but it requires a few modifications and bugfixes to work, so check out https://github.com/WPettersson/libtw/
Once you have the .jar file, you can check for admissibility by running
java -jar AdmissibleFPG.jar pairs.file
where pairs.file is a file containing a list of face-pairing graphs as generated by tricensus, which is part of Regina
Copyright (C) 2014 William Pettersson william@ewpettersson.se
AdmissibleFPG is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
AdmissibleFPG is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with AdmissibleFPG. If not, see http://www.gnu.org/licenses/.