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 Biggs-Smith graph.
038 * 
039 * <dl>
040 * <dt>Nodes</dt>
041 * <dd>102</dd>
042 * <dt>LCF</dt>
043 * <dd>[16, 24, -38, 17, 34, 48, -19, 41, -35, 47, -20, 34, -36, 21, 14, 48,
044 * -16, -36, -43, 28, -17, 21, 29, -43, 46, -24, 28, -38, -14, -50, -45, 21, 8,
045 * 27, -21, 20, -37, 39, -34, -44, -8, 38, -21, 25, 15, -34, 18, -28, -41, 36,
046 * 8, -29, -21, -48, -28, -20, -47, 14, -8, -15, -27, 38, 24, -48, -18, 25, 38,
047 * 31, -25, 24, -46, -14, 28, 11, 21, 35, -39, 43, 36, -38, 14, 50, 43, 36, -11,
048 * -36, -24, 45, 8, 19, -25, 38, 20, -24, -14, -21, -8, 44, -31, -38, -28, 37]</dd>
049 * </dl>
050 * 
051 * @reference On trivalent graphs, NL Biggs, DH Smith - Bulletin of the London
052 *            Mathematical Society, 3 (1971) 155-158
053 * 
054 */
055public class BiggsSmithGraphGenerator extends LCFGenerator {
056        /**
057         * LCF notation of a Biggs-Smith graph.
058         */
059        public static final LCF BIGGS_SMITH_GRAPH_LCF = new LCF(1, 16, 24, -38, 17,
060                        34, 48, -19, 41, -35, 47, -20, 34, -36, 21, 14, 48, -16, -36, -43,
061                        28, -17, 21, 29, -43, 46, -24, 28, -38, -14, -50, -45, 21, 8, 27,
062                        -21, 20, -37, 39, -34, -44, -8, 38, -21, 25, 15, -34, 18, -28, -41,
063                        36, 8, -29, -21, -48, -28, -20, -47, 14, -8, -15, -27, 38, 24, -48,
064                        -18, 25, 38, 31, -25, 24, -46, -14, 28, 11, 21, 35, -39, 43, 36,
065                        -38, 14, 50, 43, 36, -11, -36, -24, 45, 8, 19, -25, 38, 20, -24,
066                        -14, -21, -8, 44, -31, -38, -28, 37);
067
068        public BiggsSmithGraphGenerator() {
069                super(BIGGS_SMITH_GRAPH_LCF, 102, false);
070        }
071}