001/*
002 * Copyright 2006 - 2013
003 *     Stefan Balev     <stefan.balev@graphstream-project.org>
004 *     Julien Baudry    <julien.baudry@graphstream-project.org>
005 *     Antoine Dutot    <antoine.dutot@graphstream-project.org>
006 *     Yoann Pigné      <yoann.pigne@graphstream-project.org>
007 *     Guilhelm Savin   <guilhelm.savin@graphstream-project.org>
008 * 
009 * This file is part of GraphStream <http://graphstream-project.org>.
010 * 
011 * GraphStream is a library whose purpose is to handle static or dynamic
012 * graph, create them from scratch, file or any source and display them.
013 * 
014 * This program is free software distributed under the terms of two licenses, the
015 * CeCILL-C license that fits European law, and the GNU Lesser General Public
016 * License. You can  use, modify and/ or redistribute the software under the terms
017 * of the CeCILL-C license as circulated by CEA, CNRS and INRIA at the following
018 * URL <http://www.cecill.info> or under the terms of the GNU LGPL as published by
019 * the Free Software Foundation, either version 3 of the License, or (at your
020 * option) any later version.
021 * 
022 * This program is distributed in the hope that it will be useful, but WITHOUT ANY
023 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
024 * PARTICULAR PURPOSE.  See the GNU Lesser General Public License for more details.
025 * 
026 * You should have received a copy of the GNU Lesser General Public License
027 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
028 * 
029 * The fact that you are presently reading this means that you have had
030 * knowledge of the CeCILL-C and LGPL licenses and that you accept their terms.
031 */
032package org.graphstream.algorithm.generator.lcf;
033
034import org.graphstream.algorithm.generator.LCFGenerator;
035
036/**
037 * Build a Tutte 12-cage graph.
038 * 
039 * <dl>
040 * <dt>Nodes</dt>
041 * <dd>126</dd>
042 * <dt>LCF</dt>
043 * <dd>[17, 27, -13, -59, -35, 35, -11, 13, -53, 53, -27, 21, 57, 11, -21, -57,
044 * 59, -17]^7</dd>
045 * </dl>
046 * 
047 * @reference Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance Regular
048 *            Graphs. New York: Springer-Verlag, 1989.
049 * 
050 */
051public class Tutte12CageGraphGenerator extends LCFGenerator {
052        /**
053         * LCF notation of a Tutte 12-cage graph.
054         */
055        public static final LCF TUTTE_12CAGE_GRAPH_LCF = new LCF(7, 17, 27, -13,
056                        -59, -35, 35, -11, 13, -53, 53, -27, 21, 57, 11, -21, -57, 59, -17);
057
058        public Tutte12CageGraphGenerator() {
059                super(TUTTE_12CAGE_GRAPH_LCF, 126, false);
060        }
061}