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 Balaban 10-cage graph.
038 * 
039 * <dl>
040 * <dt>Nodes</dt>
041 * <dd>70</dd>
042 * <dt>LCF</dt>
043 * <dd>[-9, -25, -19, 29, 13, 35, -13, -29, 19, 25, 9, -29, 29, 17, 33, 21,
044 * 9,-13, -31, -9, 25, 17, 9, -31, 27, -9, 17, -19, -29, 27, -17, -9, -29, 33,
045 * -25,25, -21, 17, -17, 29, 35, -29, 17, -17, 21, -25, 25, -33, 29, 9, 17, -27,
046 * 29, 19, -17, 9, -27, 31, -9, -17, -25, 9, 31, 13, -9, -21, -33, -17, -29, 29]
047 * </dd>
048 * </dl>
049 * 
050 * @reference A. T. Balaban, A trivalent graph of girth ten, J. Combinatorial
051 *            Theory, Set. B, 12:1-5, 1972
052 * 
053 */
054public class Balaban10CageGraphGenerator extends LCFGenerator {
055        /**
056         * LCF notation of a Balaban 10-cage graph.
057         */
058        public static final LCF BALABAN_10CAGE_GRAPH_LCF = new LCF(1, -9, -25, -19,
059                        29, 13, 35, -13, -29, 19, 25, 9, -29, 29, 17, 33, 21, 9, -13, -31,
060                        -9, 25, 17, 9, -31, 27, -9, 17, -19, -29, 27, -17, -9, -29, 33,
061                        -25, 25, -21, 17, -17, 29, 35, -29, 17, -17, 21, -25, 25, -33, 29,
062                        9, 17, -27, 29, 19, -17, 9, -27, 31, -9, -17, -25, 9, 31, 13, -9,
063                        -21, -33, -17, -29, 29);
064
065        public Balaban10CageGraphGenerator() {
066                super(BALABAN_10CAGE_GRAPH_LCF, 70, false);
067        }
068}