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 Heawood graph.
038 * 
039 * <dl>
040 * <dt>Nodes</dt>
041 * <dd>12</dd>
042 * <dt>LCF</dt>
043 * <dd>[5, -5]^7</dd>
044 * </dl>
045 * 
046 * @reference Heawood, P. J. (1890). "Map colouring theorems". Quarterly J.
047 *            Math. Oxford Ser. 24: 322–339.
048 * 
049 */
050public class HeawoodGraphGenerator extends LCFGenerator {
051        /**
052         * LCF notation of a Headwood graph.
053         */
054        public static final LCF HEAWOOD_GRAPH_LCF = new LCF(7, 5, -5);
055
056        public HeawoodGraphGenerator() {
057                super(HEAWOOD_GRAPH_LCF, 14, false);
058        }
059}